Global lower mass-bound for critical configuration models in the heavy-tailed regime

DOI10.1214/22-EJP821MaRDI QIDQ2082675

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

Publication date: 4 October 2022

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

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

zbMATH Keywords

critical configuration modelglobal lower mass-boundheavy-tailed degrees

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Susceptibility of random graphs with given vertex degrees
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• The gap between Gromov-Vague and Gromov-Hausdorff-vague topology
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Height and diameter of Brownian tree
• Critical random graphs: Diameter and mixing time
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On tail probabilities for martingales
• The asymptotic number of labeled graphs with given degree sequences
• Most trees are short and fat
• The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
• Limits of sparse configuration models and beyond: graphexes and multigraphexes
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Heavy-tailed configuration models at criticality
• The continuum limit of critical random graphs
• Stochastic-Process Limits
• Random Graphs and Complex Networks
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• A critical point for random graphs with a given degree sequence
• Balls and bins: A study in negative dependence
• On the concentration function of a sum of independent random variables
• Percolation on Sparse Random Graphs with Given Degree Sequence
• On breadth‐first constructions of scaling limits of random graphs and random unicellular maps