Critical random graphs: limiting constructions and distributional properties

From MaRDI portal
Revision as of 09:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:638299


DOI10.1214/EJP.v15-772zbMath1227.05224arXiv0903.4730MaRDI QIDQ638299

Christina Goldschmidt, Louigi Addario-Berry, Nicolas Broutin

Publication date: 9 September 2011

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

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



Related Items

The mesoscopic geometry of sparse random maps, On breadth‐first constructions of scaling limits of random graphs and random unicellular maps, Random gluing of metric spaces, Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023, Cycle structure of percolation on high-dimensional tori, The scaling limit of a critical random directed graph, Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees, Stable graphs: distributions and line-breaking construction, The continuum limit of critical random graphs, Multisource invasion percolation on the complete graph, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Scaling Limits of Random Trees and 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, Continuum limit of critical inhomogeneous random graphs, Asymptotics of trees with a prescribed degree sequence and applications, Critical random forests, Anatomy of the giant component: the strictly supercritical regime, Geometry of the minimal spanning tree of a random 3-regular graph, The probability of unusually large components in the near-critical Erdős–Rényi graph, Speeding up non-Markovian first-passage percolation with a few extra edges, Scaling limit of random forests with prescribed degree sequences, 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