<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>A short proof of a central limit theorem for the order of the giant component and k-core</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Michael</namePart>
  <namePart type="family">Anastos</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">0b2a4358-bb35-11ec-b7b9-e3279b593dbb</identifier></name>
<name type="personal">
  <namePart type="given">Joshua</namePart>
  <namePart type="family">Erde</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Mihyun</namePart>
  <namePart type="family">Kang</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Vincent</namePart>
  <namePart type="family">Pfenninger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Combinatorial Optimisation Problems on Sparse Random Graphs</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">In this note we outline a new and simple approach to proving central limit theorems for various ‘global’ graph parameters that have robust ‘local’ approximations, using the Efron–Stein inequality, which relies on a combinatorial analysis of the stability of these approximations under resampling an edge. As an application, we give short proofs of a central limit theorem for the order of the giant component and of the 𝑘
-core for sparse random graphs.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_BulletinLondonMathSoc_Anastos.pdf">https://research-explorer.ista.ac.at/download/22752/22845/2026_BulletinLondonMathSoc_Anastos.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Wiley</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Bulletin of the London Mathematical Society</title></titleInfo>
  <identifier type="issn">0024-6093</identifier>
  <identifier type="eIssn">1469-2120</identifier>
  <identifier type="arXiv">2506.11651</identifier><identifier type="doi">10.1112/blms.70464</identifier>
<part><detail type="volume"><number>58</number></detail><detail type="issue"><number>8</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ieee>M. Anastos, J. Erde, M. Kang, and V. Pfenninger, “A short proof of a central limit theorem for the order of the giant component and k-core,” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;, vol. 58, no. 8. Wiley, 2026.</ieee>
<ista>Anastos M, Erde J, Kang M, Pfenninger V. 2026. A short proof of a central limit theorem for the order of the giant component and k-core. Bulletin of the London Mathematical Society. 58(8), e70464.</ista>
<ama>Anastos M, Erde J, Kang M, Pfenninger V. A short proof of a central limit theorem for the order of the giant component and k-core. &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. 2026;58(8). doi:&lt;a href=&quot;https://doi.org/10.1112/blms.70464&quot;&gt;10.1112/blms.70464&lt;/a&gt;</ama>
<apa>Anastos, M., Erde, J., Kang, M., &amp;#38; Pfenninger, V. (2026). A short proof of a central limit theorem for the order of the giant component and k-core. &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. Wiley. &lt;a href=&quot;https://doi.org/10.1112/blms.70464&quot;&gt;https://doi.org/10.1112/blms.70464&lt;/a&gt;</apa>
<mla>Anastos, Michael, et al. “A Short Proof of a Central Limit Theorem for the Order of the Giant Component and K-Core.” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;, vol. 58, no. 8, e70464, Wiley, 2026, doi:&lt;a href=&quot;https://doi.org/10.1112/blms.70464&quot;&gt;10.1112/blms.70464&lt;/a&gt;.</mla>
<short>M. Anastos, J. Erde, M. Kang, V. Pfenninger, Bulletin of the London Mathematical Society 58 (2026).</short>
<chicago>Anastos, Michael, Joshua Erde, Mihyun Kang, and Vincent Pfenninger. “A Short Proof of a Central Limit Theorem for the Order of the Giant Component and K-Core.” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. Wiley, 2026. &lt;a href=&quot;https://doi.org/10.1112/blms.70464&quot;&gt;https://doi.org/10.1112/blms.70464&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22752</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-08-23T22:01:47Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-09-07T13:56:17Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
