Abstract
The last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models to gain insight into real-world systems. In this study we analyze the maximal components at criticality of one famous class of such models, the rank-one inhomogeneous random graph model (Norros and Reittu, Adv Appl Probab 38(1):59–75, 2006; Bollobás et al., Random Struct Algorithms 31(1):3–122, 2007, Section 16.4). Viewing these components as measured random metric spaces, under finite moment assumptions for the weight distribution, we show that the components in the critical scaling window with distances scaled by \(n^{-1/3}\) converge in the Gromov–Haussdorf–Prokhorov metric to rescaled versions of the limit objects identified for the Erdős–Rényi random graph components at criticality in Addario-Berry et al. (Probab. Theory Related Fields, 152(3–4):367–406, 2012). A key step is the construction of connected components of the random graph through an appropriate tilt of a fundamental class of random trees called \(\mathbf {p}\)-trees (Camarri and Pitman, Electron. J. Probab 5(2):1–18, 2000; Aldous et al., Probab Theory Related Fields 129(2):182–218, 2004). This is the first step in rigorously understanding the scaling limits of objects such as the minimal spanning tree and other strong disorder models from statistical physics (Braunstein et al., Phys Rev Lett 91(16):168701, 2003) for such graph models. By asymptotic equivalence (Janson, Random Struct Algorithms 36(1):26–45, 2010), the same results are true for the Chung–Lu model (Chung and Lu, Proc Natl Acad Sci 99(25):15879–15882, 2002; Chung and Lu, Ann Combin 6(2):125–145, 2002; Chung and Lu, Complex graphs and networks, 2006) and the Britton–Deijfen–Martin–Löf model (Britton et al., J Stat Phys 124(6):1377–1397, 2006). A crucial ingredient of the proof of independent interest are tail bounds for the height of \(\mathbf {p}\)-trees. The techniques developed in this paper form the main technical bedrock for the general program developed in Bhamidi et al. (Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős–Rényi random graph. arXiv preprint, 2014) for proving universality of the continuum scaling limits in the critical regime for a wide array of other random graph models including the configuration model and inhomogeneous random graphs with general kernels (Bollobás et al., Random Struct Algorithms 31(1):3–122, 2007).
This is a preview of subscription content, access via your institution.



References
Abraham, R., Delmas, J.-F., Hoscheit, P.: A note on the Gromov–Hausdorff–Prokhorov distance between (locally) compact metric measure spaces. Electron. J. Probab. 18(14), 1–21 (2013)
Addario-Berry, L., Broutin, N., Goldschmidt, C.: Critical random graphs: limiting constructions and distributional properties. Electron. J. Probab 15(25), 741–775 (2010)
Addario-Berry, L., Broutin, N., Goldschmidt, C.: The continuum limit of critical random graphs. Probab. Theory Relat. Fields 152(3–4), 367–406 (2012)
Addario-Berry, L., Broutin, N., Goldschmidt, C., Miermont, G.: The scaling limit of the minimum spanning tree of the complete graph. arXiv:1301.1664 (2013)
Addario-Berry, L., Broutin, N., Reed, B.: Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms 35(3), 323–347 (2009)
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47 (2002)
Aldous, D.: Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25(2), 812–854 (1997)
Aldous, D., Miermont, G., Pitman, J.: The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin’s local time identity. Probab. Theory Relat. Fields 129(2), 182–218 (2004)
Aldous, D., Pitman, J.: Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent. Probab. Theory Relat. fields 118(4), 455–482 (2000)
Bender, E.A., Canfield, E.R.: The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 24(3), 296–307 (1978)
Bhamidi, S., Broutin, N., Sen, S., Wang, X.: Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős–Rényi random graph. arXiv preprint (2014)
Bhamidi, S., Budhiraja, A., Wang, X.: The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs. Probab. Theory Relat. Fields 160(3–4), 733–796 (2014)
Bhamidi, S., van der Hofstad, R., Sen, S.: The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs. arXiv:1508.04645 (2015)
Bhamidi, S., van der Hofstad, R., van Leeuwaarden, J.S.H.: Scaling limits for critical inhomogeneous random graphs with finite third moments. Electron. J. Probab. 15(54), 1682–1703 (2010)
Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combin. 1(4), 311–316 (1980)
Bollobás, B.: The evolution of random graphs. Trans. Am. Math. Soc. 286(1), 257–274 (1984)
Bollobás, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1), 3–122 (2007)
Bollobás, B., Riordan, O.: The phase transition in the Erdős–Rényi random graph process, pp. 59–110 (2013)
Braunstein, L.A., Buldyrev, S.V., Cohen, R., Havlin, S., Stanley, H.E.: Optimal paths in disordered complex networks. Phys. Rev. Lett. 91(16), 168701 (2003)
Britton, T., Deijfen, M., Martin-Löf, A.: Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124(6), 1377–1397 (2006)
Burago, D., Burago, Y., Ivanov, S.: A Course in Metric Geometry, vol. 33. American Mathematical Society, Providence (2001)
Camarri, M., Pitman, J.: Limit distributions and random trees derived from the birthday problem with unequal probabilities. Electron. J. Probab 5(2), 1–18 (2000)
Chow, Y.S., Teicher, H.: Probability Theory: Independence, Interchangeability. Martingales. Springer Science and Business Media, New York (2012)
Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. 99(25), 15879–15882 (2002)
Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Combin. 6(2), 125–145 (2002)
Chung, F.R.K., Lu, L.: Complex Graphs and Networks. AMS Bookstore (2006)
DasGupta, A.: Probability for Statistics and Machine Learning. Springer Texts in Statistics. Springer, New York (2011). Fundamentals and advanced topics
Durrett, R.: Random Graph Dynamics, vol. 20. Cambridge University Press, Cambridge (2007)
Erdős, P.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci 5, 17–61 (1960)
Evans, S.N.: Probability and real trees, Lecture Notes in Mathematics, vol. 1920. Springer, Berlin (2008). Lectures from the 35th Summer School on Probability Theory held in Saint-Flour, July 6–23 (2005)
Hatami, H., Molloy, M.: The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1), 99–123 (2012)
Hofstad, R.V.d.: Random Graphs and Complex Networks, vols. I, II. http://www.win.tue.nl/~rhofstad/ (2015)
Janson, S.: Asymptotic equivalence and contiguity of some random graphs. Random Struct. Algorithms 36(1), 26–45 (2010)
Janson, S., Knuth, D.E., Łuczak, T., Pittel, B.: The birth of the giant component. Random Struct. Algorithms 4(3), 233–358 (1993)
Joseph, A.: The component sizes of a critical random graph with given degree sequence. Ann. Appl. Probab. 24(6), 2560–2594 (2014)
Le Gall, J.-F.: Random trees and applications. Probab. Surv. 2, 245–311 (2005)
Łuczak, T.: Component behavior near the critical point of the random graph process. Random Struct. Algorithms 1(3), 287–310 (1990)
Łuczak, T., Pittel, B., Wierman, J.C.: The structure of a random graph at the point of the phase transition. Trans. Am. Math. Soc. 341(2), 721–748 (1994)
Massart, P.: The tight constant in the Dvoretzky–Kiefer–Wolfowitz inequality. Ann. Probab. 18(3), 1269–1283 (1990)
Molloy, M., Reed, B.: The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7(3), 295–305 (1998)
Nachmias, A., Peres, Y.: Critical percolation on random regular graphs. Random Struct. Algorithms 36(2), 111–148 (2010)
Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)
Norros, I., Reittu, H.: On a conditionally poissonian graph process. Adv. Appl. Probab. 38(1), 59–75 (2006)
Pitman, J.: Random mappings, forests, and subsets associated with Abel–Cayley–Hurwitz multinomial expansions. Sém. Lothar. Combin 46, 02 (2001)
Riordan, O.: The phase transition in the configuration model. Combin. Probab. Comput. 21(1–2), 265–299 (2012)
Rogers, L.C.G., Williams, D.: Diffusions, Markov Processes, and Martingales, vol. 1, Foundations. Cambridge University Press, Cambridge (2000)
Serfling, R.J., et al.: Probability inequalities for the sum in sampling without replacement. Ann. Stat. 2(1), 39–48 (1974)
Spencer, J., Wormald, N.: Birth control for giants. Combinatorica 27(5), 587–628 (2007)
Turova, T.S.: Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1. Random Struct. Algorithms 43(4), 486–539 (2013)
van der Hofstad, R.: Critical behavior in inhomogeneous random graphs. Random Struct. Algorithms 42(4), 480–508 (2013)
Acknowledgments
We thank an anonymous referee for a thorough review of the paper. This significantly improved both the proofs as well as presentation of the paper. We thank Amarjit Budhiraja for many stimulating conversations. We also thank Grégory Miermont for insightful discussions about the results of [8]. SS thanks UNC Chapel Hill for hospitality and support during visits. SB has been partially supported by NSF-DMS Grants 1105581, 1310002, 160683, 161307 and SES Grant 1357622. SS has been supported in part by NSF Grant DMS-1007524 and the Netherlands Organization for Scientific Research (NWO) through the Gravitation Networks Grant 024.002.003. XW has been supported in part by the National Science Foundation (DMS-1004418, DMS-1016441), the Army Research Office (W911NF-0-1-0080, W911NF-10-1-0158) and the US-Israel Binational Science Foundation (2008466).
Author information
Authors and Affiliations
Corresponding author
Appendix A.
Appendix A.
The aim of this section is to outline a proof of Lemma 7.7.
Proof of Lemma 7.7
By imitating the proof of (10.23), we can show that for any \(\varepsilon >0\),
where the meaning of the symbols is as in Lemma 10.10. Now if \(q_1\leqslant K\sigma (\mathbf {p})\) for some fixed \(K>0\), then \(q_1^2\leqslant \varepsilon \sigma (\mathbf {p})/2\) for large n since \(\sigma (\mathbf {p})\rightarrow 0\) under Assumption 7.1. Thus,
for large n provided \(q_1\leqslant K\sigma (\mathbf {p})\). Similarly, by imitating the proof of (10.24), we can show that for any \(\varepsilon >0\) and integer \(r\geqslant 2\),
if \(q_1\leqslant K\sigma (\mathbf {p})\) for some \(K>0\). Now, with notation as in the proof of Proposition 10.9,
Under Assumption 7.1, \(p_{\max }^{3/4}\leqslant \sigma (\mathbf {p})^{9/8}\leqslant \varepsilon \sigma (\mathbf {p})/2\) for large n. In view of (10.37) and (10.40),
As in the proof of Proposition 10.9, we use the following bound for \(Z_1\):
From (A.1) and (A.2), for every \(r\geqslant 2\), there exists \(C_r>0\) such that
for sufficiently large n. Similarly, conditioning on \(\mathbb {A}(v)\) and the children of \(\mathbb {B}(v)\) and using Lemma 10.11,
where the last step uses the bound \(p_{\max }\leqslant \sigma (\mathbf {p})^{3/2}\) for large n. Finally, from (10.40),
Combining (A.3)–(A.8) and using a union bound, we conclude that under Assumption 7.1,
This shows that [8, Equation (46)] remains valid under Assumption 7.1. Now the claim follows from the arguments given after Equation (46) in [8]. \(\square \)
Rights and permissions
About this article
Cite this article
Bhamidi, S., Sen, S. & Wang, X. Continuum limit of critical inhomogeneous random graphs. Probab. Theory Relat. Fields 169, 565–641 (2017). https://doi.org/10.1007/s00440-016-0737-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-016-0737-x
Keywords
- Multiplicative coalescent
- Continuum random tree
- Critical random graphs
- Branching processes
- \(\mathbf {p}\)-trees
- Scaling limits
Mathematics Subject Classification
- Primary 60C05
- 05C80