Universality for critical heavy-tailed network models: Metric structure of maximal components
arXiv:1703.07145 · doi:10.1214/19-EJP408
Abstract
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen [Probab. Theory Relat. Fields 2018]. We develop general principles under which the identical scaling limits as the rank-one case can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.
arXiv commentFinal published version. 47 pages, 6 figures
References in corpus (20)
- The phase transition in inhomogeneous random graphs
- Random trees and applications
- Generating simple random graphs with prescribed degree distribution
- Percolation Critical Exponents in Scale-Free Networks
- Optimal Paths in Disordered Complex Networks
- Percolation on finite graphs and isoperimetric inequalities
- The phase transition in the configuration model
- Optimal Path and Minimal Spanning Trees in Random Weighted Networks
- Novel scaling limits for critical inhomogeneous random graphs
- Geographical Embedding of Scale-Free Networks
- Critical window for the configuration model: finite third moment degrees
- The gap between Gromov-vague and Gromov-Hausdorff-vague topology
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
- Heavy-tailed configuration models at criticality
- The augmented multiplicative coalescent and critical dynamic random graph models
- The critical random graph, with martingales
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: The continuum graphs
- Critical Percolation on Random Networks with Prescribed Degrees
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Stable graphs: distributions and line-breaking construction
Cited by in corpus (9)
- Heavy-tailed configuration models at criticality
- Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
- Degree correlations in scale-free null models
- Scaling limit of dynamical percolation on critical Erdös-Rényi random graphs
- On breadth-first constructions of scaling limits of random graphs and random unicellular maps
- Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality
- Phase transitions of extremal cuts for the configuration model
- Critical scaling limits of the random intersection graph
- Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon