Asymptotic normality of the size of the giant component via a random walk
Authors:
- 1 January 2012
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 102 (1) , 53-61
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Counting connected graphs inside-outJournal of Combinatorial Theory, Series B, 2005
- Brownian excursions, critical random graphs and the multiplicative coalescentThe Annals of Probability, 1997
- On tree census and the giant component in sparse random graphsRandom Structures & Algorithms, 1990
- The transitive closure of a random digraphRandom Structures & Algorithms, 1990
- Symmetric sampling procedures, general epidemic processes and their threshold limit theoremsJournal of Applied Probability, 1986
- Martingale Central Limit TheoremsThe Annals of Mathematical Statistics, 1971