Novel scaling limits for critical inhomogeneous random graphs

Annals of Probability

Volumn 40, Issue 6, 2012, Pages 2299-2361

  Bhamidi, Shankar ^a   van Der Hofstad, Remco ^b   van Leeuwaarden, Johan S H ^b  

^a The University of North Carolina at Chapel Hill   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Critical random graphs; Inhomogeneous networks; Multiplicative coalescent; Phase transitions; Thinned L vy processes

Indexed keywords

EID: 84872586705     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/11-AOP680     Document Type: Article

References (36)

1. ALBERT, R. and BARABÁSI, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47-97. MR1895096
2. ALDOUS, D. (1997). Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 812-854. MR1434128
3. ALDOUS, D. and LIMIC, V. (1998). The entrance boundary of the multiplicative coalescent. Electron. J. Probab. 3 59 pp. (electronic). MR1491528
4. ALDOUS, D. J. (1999). Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists. Bernoulli 5 3-48. MR1673235
5. ALON, N. and SPENCER, J. H. (2000). The Probabilistic Method, 2nd ed. Wiley, New York. With an appendix on the life and work of Paul Erd?os. MR1885388
6. BERTOIN, J. (1996). Lévy Processes. Cambridge Tracts in Mathematics 121. Cambridge Univ. Press, Cambridge. MR1406564
7. BERTOIN, J. (2006). Random Fragmentation and Coagulation Processes. Cambridge Studies in Advanced Mathematics 102. Cambridge Univ. Press, Cambridge. MR2253162
8. BHAMIDI, S., VAN DER HOFSTAD, R. and VAN LEEUWAARDEN, J. S. H. (2010). Scaling limits for critical inhomogeneous random graphs with finite third moments. Electron. J. Probab. 15 1682-1703. MR2735378
9. BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
10. BOLLOBÁS, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge. MR1864966
11. BOLLOBÁS, B., JANSON, S. andRIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3-122. MR2337396
12. BRITTON, T., DEIJFEN, M. andMARTIN-LÖF, A. (2006). Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124 1377-1397. MR2266448
13. CHUNG, F. and LU, L. (2002). The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99 15879-15882 (electronic). MR1944974
14. CHUNG, F. and LU, L. (2002). Connected components in random graphs with given expected degree sequences. Ann. Comb. 6 125-145. MR1955514
15. CHUNG, F. and LU, L. (2003). The average distance in a random graph with given expected degrees. Internet Math. 1 91-113. MR2076728
16. CHUNG, F. and LU, L. (2006). Complex Graphs and Networks. CBMS Regional Conference Series in Mathematics 107. Conference Board of the Mathematical Sciences, Washington, DC. MR2248695
17. CHUNG, F. and LU, L. (2006). The volume of the giant component of a random graph with given expected degrees. SIAM J. Discrete Math. 20 395-411 (electronic). MR2257269
18. DOROGOVTSEV, S. N. and MENDES, J. F. F. (2002). Evolution of networks. Adv. Phys. 51 1079-1187.
19. DURRETT, R. (2007). Random Graph Dynamics. Cambridge Univ. Press, Cambridge. MR2271734
20. GRIMMETT, G. (1999). Percolation, 2nd ed. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 321. Springer, Berlin. MR1707339
21. GRIMMETT, G. R. and STIRZAKER, D. R. (2001). Probability and Random Processes, 3rd ed. Oxford Univ. Press, New York. MR2059709
22. HATAMI, H. and MOLLOY, M. (2009). The scaling window for a random graph with a given degree sequence. Available at arXiv:0907.4211.
23. JACOD, J. and SHIRYAEV, A. N. (2003). Limit Theorems for Stochastic Processes, 2nd ed. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 288. Springer, Berlin. MR1943877
24. JANSON, S. (2008). The largest component in a subcritical random graph with a power law degree distribution. Ann. Appl. Probab. 18 1651-1668. MR2434185
25. JANSON, S. (2010). Asymptotic equivalence and contiguity of some random graphs. Random Structures Algorithms 36 26-45. MR2591045
26. JANSON, S., LUCZAK, T. and RUCINSKI, A. (2000). Random Graphs. Wiley, New York. MR1782847
27. JOSEPH, A. (2010). The component sizes of a critical random graph with pre-described degree sequence. Preprint.
28. KALLENBERG, O. (2002). Foundations of Modern Probability, 2nd ed. Springer, New York. MR1876169
29. KYPRIANOU, A. E. (2006). Introductory Lectures on Fluctuations of Lévy Processes with Applications. Springer, Berlin. MR2250061
30. NEWMAN, M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45 167-256 (electronic). MR2010377
31. NORROS, I. and REITTU, H. (2006). On a conditionally Poissonian graph process. Adv. in Appl. Probab. 38 59-75. MR2213964
32. THORISSON, H. (2000). Coupling, Stationarity, and Regeneration. Springer, New York. MR1741181
33. TUROVA, T. S. (2009). Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1. Preprint.
34. VAN DER HOFSTAD, R. (2009). Critical behavior in inhomogeneous random graphs. Preprint.
35. VAN DER HOFSTAD, R. (2011). Random graphs and complex networks. Unpublished manuscript. Available at http://www.win.tue.nl/~rhofstad/NotesRGCN.pdf.
36. VAN DER HOFSTAD, R., JANSON, S. and LUCZAK, M. The near-critical behavior for the configuration model with finite-variance degrees. Unpublished manuscript.