Critical random graphs: Limiting constructions and distributional properties

Electronic Journal of Probability

Volumn 15, Issue , 2010, Pages 741-775

  Addario Berry, L ^a   Broutin, N ^b   Goldschmidt, C ^c  

^a MCGILL UNIVERSITY   (Canada)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Brownian excursion; Continuum random tree; Gromov Hausdorff distance; Poisson process; Random graph; Real tree; Scaling limit; Urn model

Indexed keywords

EID: 77953160480     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v15-772     Document Type: Article

References (35)

1. L. Addario-Berry, N. Broutin, and C. Goldschmidt. The continuum limit of critical random graphs. arXiv: 0903.4730v1 [math. PR], 2009.
2. D. Aldous. The continuum random tree. I. Ann. Probab., 19(1):1-28, 1991. ISSN 0091-1798.
3. D. Aldous. The continuum random tree. II. An overview. In Stochastic analysis (Durham, 1990), volume 167 of London Math. Soc. Lecture Note Ser., pages 23-70. Cambridge University Press, Cambridge, 1991.
4. D. Aldous. The continuum random tree. III. Ann. Probab., 21(1):248-289, 1993. ISSN 00911798.
5. D. Aldous. Recursive self-similarity for random trees, random triangulations and Brownian excursion. Ann. Probab., 22(2):527-545, 1994. ISSN 0091-1798.
6. D. Aldous. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab., 25:812-854, 1997.
7. D. Aldous and J. Pitman. Brownian bridge asymptotics for random mappings. Random Structures Algorithms, 5(4):487-512, 1994. ISSN 1042-9832.
8. D. Aldous, G. Miermont, and J. Pitman. Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees. Probability Theory and Related Fields, 133(1):1-17, 2005.
9. D.J. Aldous. Exchangeability and related topics. In École d'été de probabilités de Saint-Flour, XIII, volume 1117, pages 1-198, Berlin, 1983. Springer.
10. K. B. Athreya and P E. Ney. Branching processes. Dover Publications Inc., Mineola, NY, 2004. ISBN 0-486-43474-5. Reprint of the 1972 original [Springer, New York;].
11. J. Bertoin and C. Goldschmidt. Dual random fragmentation and coagulation and an application to the genealogy of Yule processes. In Mathematics and computer science. III, Trends Math., pages 295-308. Birkhäuser, Basel, 2004.
12. J. Bertoin and J. Pitman. Path transformations connecting Brownian bridge, excursion and meander. Bull. Sci. Math., 118(2):147-166, 1994. ISSN 0007-4497.
13. D. Blackwell and D. G. Kendall. The Martin boundary for Polya's urn scheme, and an application to stochastic population growth. J. Appl. Probab., 1:284-296, 1964.
14. B. Bollobas. Random Graphs. Cambridge Studies in Advanced Mathematics. Cambridge University Press, second edition, 2001.
15. L. Chaumont and M. Yor. Exercises in probability, volume 13 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2003. ISBN 0521-82585-7. A guided tour from measure theory to random processes, via conditioning.
16. B. de Finetti. Funzione caratteristica di un fenomeno aleatorio. Atti della R. Academia Nazionale dei Lincei, Serie 6. Memorie, Classe di Scienze Fisiche, Mathematice e Naturale, 4: 251-299, 1931.
17. J. Ding, J.H. Kim, E. Lubetzky, and Y. Peres. Anatomy of a young giant component in the random graph. arXiv:0906.1839v1 [math.CO], 2009.
18. D. Dufresne. Algebraic properties of beta and gamma distributions, and applications. Adv. Appl. Math., 20:285-299, 1998.
19. F. Eggenberger and G. Polya. Uber die Statistik verketteter Vorgange. Zeitschrift fur Angewandte Mathematik und Mechanik, 3:279-289, 1923.
20. P Erdos and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
21. S.N. Evans, J. Pitman, and A. Winter. Rayleigh processes, real trees, and root growth with regrafting. Probab. Theory Related Fields, 134(1):81-126, 2006. ISSN 0178-8051.
22. W. Feller. An introduction to probability theory and its applications. Vol. II. Second edition. John Wiley & Sons Inc., New York, 1971.
23. D.A. Freedman. Bernard Friedman's urn. The Annals of Mathematical Statistics, 36:956-970, 1965.
24. L. Gordon. A stochastic approach to the gamma function. Amer. Math. Monthly, 101(9): 858-865, 1994.
25. S. Janson, D. E. Knuth, T. Euczak, and B. Pittel. The birth of the giant component. Random Structures Algorithms, 4:233-358, 1993.
26. S. Janson, T. Euczak, and A. Ruciinski. Random Graphs. Wiley, New York, 2000.
27. N.L. Johnson, S. Kotz, and N. Balakrishnan. Continuous Univariate Distributions, volume 1. Wiley, New York, NY, second edition, 1994.
28. J.-F. Le Gall. Random trees and applications. Probab. Surv., 2:245-311 (electronic), 2005. ISSN 1549-5787.
29. T. Euczak, B. Pittel, and J. C. Wierman. The structure of a random graph at the point of transition. Trans. Amer. Math. Soc., 341:721-748, 1994.
30. Y. Peres and D. Revelle. Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs. arXiv:math/0410430v2 [math.PR], 2004.
31. J. Pitman. Brownian motion, bridge, excursion, and meander characterized by sampling at independent uniform times. Electron. J. Probab., 4:no. 11, 33 pp. (electronic), 1999. ISSN 1083-6489.
32. J. Pitman. Combinatorial stochastic processes, volume 1875 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2006.
33. J.L. Rémy. Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire. RAIRO Inform. Théor., 19:179-195, 1985.
34. J. Schweinsberg. The loop-erased random walk and the uniform spanning tree on the fourdimensional discrete torus. Probability Theory and Related Fields,144(3):319-370, 2009.
35. S.S. Wilks. Certain generalizations in the analysis of variance. Biometrika, 24:471-494, 1932.