Universality for critical heavy-tailed network models: metric structure of maximal components

DOI10.1214/19-EJP408zbMath1445.60015arXiv1703.07145MaRDI QIDQ2184610

Remco van der Hofstad, Souvik Dhara, Sanchayan Sen, Shankar Bhamidi

Publication date: 29 May 2020

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07145

zbMATH Keywords

universalitycritical percolationmultiplicative coalescentcritical configuration modelheavy-tailed degreesGromov-weak convergence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

A probabilistic approach to the leader problem in random graphs, Stable graphs: distributions and line-breaking construction, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Scaling Limits of Random Trees and Random Graphs, Heavy-tailed configuration models at criticality, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Geometry of the minimal spanning tree of a random 3-regular graph, Degree correlations in scale-free random graph models, Global lower mass-bound for critical configuration models in the heavy-tailed regime, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
• The component sizes of a critical random graph with given degree sequence
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Critical window for the configuration model: finite third moment degrees
• Susceptibility of random graphs with given vertex degrees
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Continuum limit of critical inhomogeneous random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• The gap between Gromov-Vague and Gromov-Hausdorff-vague topology
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Generating simple random graphs with prescribed degree distribution
• The critical random graph, with martingales
• Random trees and applications
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On tail probabilities for martingales
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• Geographical embedding of scale-free networks
• Length of optimal path in random networks with strong disorder
• The scaling limit of the minimum spanning tree of the complete graph
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
• Connected components in random graphs with given expected degree sequences
• Percolation on finite graphs and isoperimetric inequalities.
• The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
• Differential equations for random processes and random graphs
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• Global lower mass-bound for critical configuration models in the heavy-tailed regime
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
• The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
• The continuum limit of critical random graphs
• Stochastic-Process Limits
• Random Graphs and Complex Networks
• Critical behavior in inhomogeneous random graphs
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Critical percolation on random regular graphs
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• A family of random trees with random edge lengths
• A critical point for random graphs with a given degree sequence
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• Component structure of the configuration model: Barely supercritical case
• The birth of the giant component
• The phase transition in inhomogeneous random graphs
• The Critical Phase for Random Graphs with a Given Degree Sequence
• The average distances in random graphs with given expected degrees
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions
• Stable graphs: distributions and line-breaking construction