A local limit theorem for the critical random graph

Electronic Communications in Probability

Volumn 14, Issue , 2009, Pages 122-131

  Van Der Hofstad, Remco ^a   Kager, Wouter ^b   Müller, Tobias ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Random graphs

Indexed keywords

EID: 62649159384     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v14-1451     Document Type: Article

References (9)

1. D. Aldous. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab., 25(2):812-854, 1997.
2. B. Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2001.
3. S. Janson, D.E. Knuth, T. huczak, and B. Pittel. The birth of the giant component. Random Structures Algorithms, 4(3):231-358, 1993. With an introduction by the editors.
4. T. huczak, B. Pittel, and J. C. Wierman. The structure of a random graph at the point of the phase transition. Trans. Amer. Math. Soc., 341(2):721-748, 1994.
5. B. Pittel. On the largest component of the random graph at a nearcritical stage. J. Combin. Theory Ser. B, 82(2):237-269, 2001.
6. J. Spencer. Enumerating graphs and Brownian motion. Comm. PureAppl. Math., 50(3):291-294, 1997.
7. E. M. Wright. The number of connected sparsely edged graphs. J. Graph Theory, 1(4):317-330, 1977.
8. E. M. Wright. The number of connected sparsely edged graphs. II. Smooth graphs and blocks. J. Graph Theory, 2(4):299-305, 1978.
9. E. M. Wright. The number of connected sparsely edged graphs. III. Asymptotic results. J. Graph Theory, 4(4):393-407, 1980.