---
res:
  bibo_abstract:
  - "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 \U0001D458\r\n-core for sparse random graphs.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Anastos, Michael
      foaf_surname: Anastos
      foaf_workInfoHomepage: http://www.librecat.org/personId=0b2a4358-bb35-11ec-b7b9-e3279b593dbb
  - foaf_Person:
      foaf_givenName: Joshua
      foaf_name: Erde, Joshua
      foaf_surname: Erde
  - foaf_Person:
      foaf_givenName: Mihyun
      foaf_name: Kang, Mihyun
      foaf_surname: Kang
  - foaf_Person:
      foaf_givenName: Vincent
      foaf_name: Pfenninger, Vincent
      foaf_surname: Pfenninger
  bibo_doi: 10.1112/blms.70464
  bibo_issue: '8'
  bibo_volume: 58
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0024-6093
  - http://id.crossref.org/issn/1469-2120
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: A short proof of a central limit theorem for the order of the giant component
    and k-core@
...