arXiv Analytics

Sign in

arXiv:1010.4595 [math.PR]AbstractReferencesReviewsResources

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

Bela Bollobas, Oliver Riordan

Published 2010-10-21, updated 2011-04-16Version 2

In this paper we give a simple new proof of a result of Pittel and Wormald concerning the asymptotic value and (suitably rescaled) limiting distribution of the number of vertices in the giant component of $G(n,p)$ above the scaling window of the phase transition. Nachmias and Peres used martingale arguments to study Karp's exploration process, obtaining a simple proof of a weak form of this result. We use slightly different martingale arguments to obtain a much sharper result with little extra work.

Comments: 11 pages; slightly expanded, reference added
Journal: J. Combinatorial Theory B 102 (2012), 53--61
Categories: math.PR, math.CO
Subjects: 05C80
Related articles: Most relevant | Search more
arXiv:2501.02433 [math.PR] (Published 2025-01-05)
On the jump of the cover time in random geometric graphs
arXiv:math/0610459 [math.PR] (Published 2006-10-15, updated 2016-07-31)
The mixing time of the giant component of a random graph
arXiv:2311.07701 [math.PR] (Published 2023-11-13)
The process of fluctuations of the giant component of an Erdős-Rényi graph