Asymptotic normality of the size of the giant component via a random walk

Journal of Combinatorial Theory. Series B

Volumn 102, Issue 1, 2012, Pages 53-61

  Bollobás, Béla ^a,b   Riordan, Oliver ^b,c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Giant component; Normal approximation; Random graphs; Random walk

Indexed keywords

EID: 81455141562     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2011.04.003     Document Type: Article

References (9)

1. Aldous D. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 1997, 25:812-854.
2. Brown B.M. Martingale central limit theorems. Ann. Math. Stat. 1971, 42:59-66.
3. Doob J.L. Stochastic Processes 1953, John Wiley and Sons/Chapman and Hall, New York/London, viii+654 pp.
4. Karp R.M. The transitive closure of a random digraph. Random Structures Algorithms 1990, 1:73-93.
5. Martin-Löf A. Symmetric sampling procedures, general epidemic processes and their threshold limit theorems. J. Appl. Probab. 1986, 23:265-282.
6. Nachmias A., Peres Y. Component sizes of the random graph outside the scaling window. ALEA Lat. Am. J. Probab. Math. Stat. 2007, 3:133-142.
7. Pittel B. On tree census and the giant component in sparse random graphs. Random Structures Algorithms 1990, 1:311-342.
8. Pittel B., Wormald C. Counting connected graphs inside-out. J. Combin. Theory Ser. B 2005, 93:127-172.
9. Stepanov V.E. Phase transitions in random graphs. Teor. Verojatnost. i Primenen.. Theory Probab. Appl. 1970, 15:55-67. (in Russian), translated in:.