### Abstract

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al. in Phys Rev Lett 96(14):148702, 2006; Braunstein et al. Int J Bifurc Chaos 17(07):2215–2255, 2007; Chen et al. in Phys Rev Lett 96(6):068702, 2006) is as follows: for a wide array of random graph models with degree exponent τ∈ (3 , 4) , distances between typical points both within maximal components in the critical regime as well as on the minimal spanning tree on the giant component in the supercritical regime scale like n^{(} ^{τ} ^{-} ^{3} ^{)} ^{/} ^{(} ^{τ} ^{-} ^{1} ^{)}. In this paper we study the metric space structure of maximal components of the multiplicative coalescent, in the regime where the sizes converge to excursions of Lévy processes “without replacement” (Aldous and Limic Electron in J Probab 3(3):59, 1998), yielding a completely new class of limiting random metric spaces. A by-product of the analysis yields the continuum scaling limit of one fundamental class of random graph models with degree exponent τ∈ (3 , 4) where edges are rescaled by n^{-} ^{(} ^{τ} ^{-} ^{3} ^{)} ^{/} ^{(} ^{τ} ^{-} ^{1} ^{)} yielding the first rigorous proof of the above conjecture. The limits in this case are compact “tree-like” random fractals with a dense collection of hubs (infinite degree vertices), a finite number of which are identified with leaves to form shortcuts. In a special case, we show that the Minkowski dimension of the limiting spaces equal (τ- 2) / (τ- 3) a.s., in stark contrast to the Erdős-Rényi scaling limit whose Minkowski dimension is 2 a.s. It is generally believed that dynamic versions of a number of fundamental random graph models, as one moves from the barely subcritical to the critical regime can be approximated by the multiplicative coalescent. In work in progress, the general theory developed in this paper is used to prove analogous limit results for other random graph models with degree exponent τ∈ (3 , 4). Our proof makes crucial use of inhomogeneous continuum random trees (ICRT), which have previously arisen in the study of the entrance boundary of the additive coalescent. We show that tilted versions of the same objects using the associated mass measure, describe connectivity properties of the multiplicative coalescent. Since convergence of height processes of corresponding approximating p-trees is not known, we use general methodology in Athreya et al. (2014) and develop novel techniques relying on first showing convergence in the Gromov-weak topology and then extending this to Gromov–Hausdorff–Prokhorov convergence by proving a global lower mass-bound.

Language | English (US) |
---|---|

Pages | 387-474 |

Number of pages | 88 |

Journal | Probability Theory and Related Fields |

Volume | 170 |

Issue number | 1-2 |

DOIs | |

State | Published - Feb 1 2018 |

### Fingerprint

### Keywords

- Critical random graphs
- Gromov-Hausdorff distance
- Gromov-weak topology
- Inhomogeneous continuum random trees
- Multiplicative coalescent
- p-trees

### ASJC Scopus subject areas

- Analysis
- Statistics and Probability
- Statistics, Probability and Uncertainty

### Cite this

*Probability Theory and Related Fields*,

*170*(1-2), 387-474. DOI: 10.1007/s00440-017-0760-6

**The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs.** / Bhamidi, Shankar; van der Hofstad, Remco; Sen, Sanchayan.

Research output: Contribution to journal › Article

*Probability Theory and Related Fields*, vol 170, no. 1-2, pp. 387-474. DOI: 10.1007/s00440-017-0760-6

}

TY - JOUR

T1 - The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs

AU - Bhamidi,Shankar

AU - van der Hofstad,Remco

AU - Sen,Sanchayan

PY - 2018/2/1

Y1 - 2018/2/1

N2 - One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al. in Phys Rev Lett 96(14):148702, 2006; Braunstein et al. Int J Bifurc Chaos 17(07):2215–2255, 2007; Chen et al. in Phys Rev Lett 96(6):068702, 2006) is as follows: for a wide array of random graph models with degree exponent τ∈ (3 , 4) , distances between typical points both within maximal components in the critical regime as well as on the minimal spanning tree on the giant component in the supercritical regime scale like n( τ - 3 ) / ( τ - 1 ). In this paper we study the metric space structure of maximal components of the multiplicative coalescent, in the regime where the sizes converge to excursions of Lévy processes “without replacement” (Aldous and Limic Electron in J Probab 3(3):59, 1998), yielding a completely new class of limiting random metric spaces. A by-product of the analysis yields the continuum scaling limit of one fundamental class of random graph models with degree exponent τ∈ (3 , 4) where edges are rescaled by n- ( τ - 3 ) / ( τ - 1 ) yielding the first rigorous proof of the above conjecture. The limits in this case are compact “tree-like” random fractals with a dense collection of hubs (infinite degree vertices), a finite number of which are identified with leaves to form shortcuts. In a special case, we show that the Minkowski dimension of the limiting spaces equal (τ- 2) / (τ- 3) a.s., in stark contrast to the Erdős-Rényi scaling limit whose Minkowski dimension is 2 a.s. It is generally believed that dynamic versions of a number of fundamental random graph models, as one moves from the barely subcritical to the critical regime can be approximated by the multiplicative coalescent. In work in progress, the general theory developed in this paper is used to prove analogous limit results for other random graph models with degree exponent τ∈ (3 , 4). Our proof makes crucial use of inhomogeneous continuum random trees (ICRT), which have previously arisen in the study of the entrance boundary of the additive coalescent. We show that tilted versions of the same objects using the associated mass measure, describe connectivity properties of the multiplicative coalescent. Since convergence of height processes of corresponding approximating p-trees is not known, we use general methodology in Athreya et al. (2014) and develop novel techniques relying on first showing convergence in the Gromov-weak topology and then extending this to Gromov–Hausdorff–Prokhorov convergence by proving a global lower mass-bound.

AB - One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al. in Phys Rev Lett 96(14):148702, 2006; Braunstein et al. Int J Bifurc Chaos 17(07):2215–2255, 2007; Chen et al. in Phys Rev Lett 96(6):068702, 2006) is as follows: for a wide array of random graph models with degree exponent τ∈ (3 , 4) , distances between typical points both within maximal components in the critical regime as well as on the minimal spanning tree on the giant component in the supercritical regime scale like n( τ - 3 ) / ( τ - 1 ). In this paper we study the metric space structure of maximal components of the multiplicative coalescent, in the regime where the sizes converge to excursions of Lévy processes “without replacement” (Aldous and Limic Electron in J Probab 3(3):59, 1998), yielding a completely new class of limiting random metric spaces. A by-product of the analysis yields the continuum scaling limit of one fundamental class of random graph models with degree exponent τ∈ (3 , 4) where edges are rescaled by n- ( τ - 3 ) / ( τ - 1 ) yielding the first rigorous proof of the above conjecture. The limits in this case are compact “tree-like” random fractals with a dense collection of hubs (infinite degree vertices), a finite number of which are identified with leaves to form shortcuts. In a special case, we show that the Minkowski dimension of the limiting spaces equal (τ- 2) / (τ- 3) a.s., in stark contrast to the Erdős-Rényi scaling limit whose Minkowski dimension is 2 a.s. It is generally believed that dynamic versions of a number of fundamental random graph models, as one moves from the barely subcritical to the critical regime can be approximated by the multiplicative coalescent. In work in progress, the general theory developed in this paper is used to prove analogous limit results for other random graph models with degree exponent τ∈ (3 , 4). Our proof makes crucial use of inhomogeneous continuum random trees (ICRT), which have previously arisen in the study of the entrance boundary of the additive coalescent. We show that tilted versions of the same objects using the associated mass measure, describe connectivity properties of the multiplicative coalescent. Since convergence of height processes of corresponding approximating p-trees is not known, we use general methodology in Athreya et al. (2014) and develop novel techniques relying on first showing convergence in the Gromov-weak topology and then extending this to Gromov–Hausdorff–Prokhorov convergence by proving a global lower mass-bound.

KW - Critical random graphs

KW - Gromov-Hausdorff distance

KW - Gromov-weak topology

KW - Inhomogeneous continuum random trees

KW - Multiplicative coalescent

KW - p-trees

UR - http://www.scopus.com/inward/record.url?scp=85014571076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014571076&partnerID=8YFLogxK

U2 - 10.1007/s00440-017-0760-6

DO - 10.1007/s00440-017-0760-6

M3 - Article

VL - 170

SP - 387

EP - 474

JO - Probability Theory and Related Fields

T2 - Probability Theory and Related Fields

JF - Probability Theory and Related Fields

SN - 0178-8051

IS - 1-2

ER -