Continuum limit of critical inhomogeneous random graphs

DOI10.1007/s00440-016-0737-xzbMath1407.60014arXiv1404.4118OpenAlexW1608202680MaRDI QIDQ682809

Shankar Bhamidi, Sanchayan Sen, Xu An Wang

Publication date: 5 February 2018

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

branching processesscaling limitscritical random graphsmultiplicative coalescentcontinuum random tree\(\mathbf {p}\)-trees

Mathematics Subject Classification ID

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

Related Items (17)

Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ A probabilistic approach to the leader problem in random graphs ⋮ On breadth‐first constructions of scaling limits of random graphs and random unicellular maps ⋮ Convergence of blanket times for sequences of random walks on critical 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 ⋮ Big Jobs Arrive Early: From Critical Queues to Random Graphs ⋮ 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 ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Critical random forests ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems ⋮ Degree correlations in scale-free random graph models ⋮ 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
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• 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 random graphs: limiting constructions and distributional properties
• 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
• The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
• Generating simple random graphs with prescribed degree distribution
• Birth control for giants
• Random trees and applications
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The scaling limit of the minimum spanning tree of the complete graph
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
• Probability inequalities for the sum in sampling without replacement
• Connected components in random graphs with given expected degree sequences
• 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
• The continuum limit of critical random graphs
• Critical behavior in inhomogeneous random graphs
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Critical random graphs and the structure of a minimum spanning tree
• Asymptotic equivalence and contiguity of some random graphs
• Critical percolation on random regular graphs
• Statistical mechanics of complex networks
• Probability for Statistics and Machine Learning
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure of a Random Graph at the Point of the Phase Transition
• The Structure and Function of Complex Networks
• The birth of the giant component
• The phase transition in inhomogeneous random graphs
• The Phase Transition in the Erdős-Rényi Random Graph Process
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process
• Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions

This page was built for publication: Continuum limit of critical inhomogeneous random graphs