Novel scaling limits for critical inhomogeneous random graphs

DOI10.1214/11-AOP680zbMath1257.05157arXiv0909.1472OpenAlexW3099739940MaRDI QIDQ693709

Shankar Bhamidi, Remco van der Hofstad, Johan S. H. van Leeuwaarden

Publication date: 10 December 2012

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

phase transitions critical random graphs thinned Lévy processes multiplicative coalescent inhomogeneous networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Signed and weighted graphs (05C22)

Related Items

Large deviations for power-law thinned Lévy processes, Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Mesoscopic scales in hierarchical configuration models, The scaling window for a random graph with a given degree sequence, Ising critical behavior of inhomogeneous Curie-Weiss models and annealed random graphs, Critical percolation on scale-free random graphs: new universality class for the configuration model, Scale-free percolation, Universality for critical heavy-tailed network models: metric structure of maximal components, A large-deviations principle for all the components in a sparse inhomogeneous random graph, A probabilistic approach to the leader problem in random graphs, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, Stable graphs: distributions and line-breaking construction, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Feller property of the multiplicative coalescent with linear deletion, Unnamed Item, The component sizes of a critical random graph with given degree sequence, Limit laws in the generalized random graphs with random vertex weights, Scaling Limits of Random Trees and Random Graphs, Big Jobs Arrive Early: From Critical Queues to Random Graphs, Heavy-tailed configuration models at criticality, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Cluster tails for critical power-law inhomogeneous random graphs, Asymptotics of trees with a prescribed degree sequence and applications, Aggregation models with limited choice and the multiplicative coalescent, Critical random forests, Finite-pool queueing with heavy-tailed services, Phase transition in random distance graphs on the torus, Inhomogeneous random graphs, isolated vertices, and Poisson approximation, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Number of edges in inhomogeneous random graphs, Expansion of Percolation Critical Points for Hamming Graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Component structure of the configuration model: Barely supercritical case, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.

Cites Work