Heavy-tailed configuration models at criticality

DOI10.1214/19-AIHP980zbMath1475.60020arXiv1612.00650MaRDI QIDQ2227459

Sanchayan Sen, Souvik Dhara, Remco van der Hofstad, Johan S. H. van Leeuwaarden

Publication date: 15 February 2021

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

universalitycritical percolationcritical configuration modelaugmented multiplicative coalescentheavy-tailed degreethinned Lévy process

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, Largest component of subcritical random graphs with given degree sequence, Unnamed Item, 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, 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large deviations for power-law thinned Lévy processes
• A new encoding of coalescent processes: applications to the additive and multiplicative cases
• 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
• Novel scaling limits for critical inhomogeneous random graphs
• The largest component in a subcritical random graph with a power law degree distribution
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• The entrance boundary of the multiplicative coalescent
• The scaling limit of the minimum spanning tree of the complete graph
• Cluster tails for critical power-law inhomogeneous random graphs
• Differential equations for random processes and random graphs
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Stochastic-Process Limits
• Random Graphs and Complex Networks
• The Phase Transition in the Configuration Model
• Critical percolation on random regular graphs
• Critical epidemics, random graphs, and Brownian motion with a parabolic drift
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Probability That a Random Multigraph is Simple
• The Evolution of Random Graphs
• Gray codes for partial match and range queries
• Compensators and Cox convergence
• Component behavior near the critical point of the random graph process
• Foundations of Modern Probability
• On a random graph with immigrating vertices: Emergence of the giant component
• A critical point for random graphs with a given degree sequence
• Component structure of the configuration model: Barely supercritical case
• The birth of the giant component
• Percolation on Sparse Random Graphs with Given Degree Sequence