## Electronic Communications in Probability

### A local limit theorem for the critical random graph

#### Abstract

We consider the limit distribution of the orders of the $k$ largest components in the Erdos-Rényi random graph inside the "critical window" for arbitrary $k$. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.

#### Article information

Source
Electron. Commun. Probab., Volume 14 (2009), paper no. 12, 122-131.

Dates
Accepted: 19 February 2009
First available in Project Euclid: 6 June 2016

https://projecteuclid.org/euclid.ecp/1465234721

Digital Object Identifier
doi:10.1214/ECP.v14-1451

Mathematical Reviews number (MathSciNet)
MR2481672

Zentralblatt MATH identifier
1185.05129

Subjects

Keywords
Random graphs

Rights

#### Citation

van der Hofstad, Remco; Kager, Wouter; Müller, Tobias. A local limit theorem for the critical random graph. Electron. Commun. Probab. 14 (2009), paper no. 12, 122--131. doi:10.1214/ECP.v14-1451. https://projecteuclid.org/euclid.ecp/1465234721

#### References

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