The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
arXiv:1508.04645
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 [23, 24, 28, 63] is as follows: for a wide array of random graph models with degree exponent , 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 . 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" [10], 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 where edges are rescaled by yielding the first rigorous proof of the above conjecture. The limits in this case are compact "tree-like" random fractals with finite fractal dimensions and 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 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 .
arXiv comment71 pages, 5 figures, To appear in Probability Theory and Related Fields
References in corpus (14)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Random trees and applications
- Generating simple random graphs with prescribed degree distribution
- Concentration around the mean for maxima of empirical processes
- Optimal Paths in Disordered Complex Networks
- Transport in weighted networks: Partition into superhighways and roads
- A note on Gromov-Hausdorff-Prokhorov distance between (locally) compact measure spaces
- Optimal Path and Minimal Spanning Trees in Random Weighted Networks
- The gap between Gromov-vague and Gromov-Hausdorff-vague topology
- Universal behavior of optimal paths in weighted networks with general disorder
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
- Cluster tails for critical power-law inhomogeneous random graphs