The scaling limit of the minimum spanning tree of the complete graph
From MaRDI portal
Publication:1681600
DOI10.1214/16-AOP1132zbMath1407.60013arXiv1301.1664OpenAlexW2962953861WikidataQ104501836 ScholiaQ104501836MaRDI QIDQ1681600
Christina Goldschmidt, Grégory Miermont, Nicolas Broutin, Louigi Addario-Berry
Publication date: 24 November 2017
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1664
scaling limitminimum spanning treeR-treecritical random graphsGromov-Hausdorff-Prokhorov distanceR-graph
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Related Items
Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, The scaling limits of the minimal spanning tree and invasion percolation in the plane, Zooming in at the root of the stable tree, Scaling limits of stochastic processes associated with resistance forms, The hyperbolic Brownian plane, Metrization of the Gromov-Hausdorff (-Prokhorov) topology for boundedly-compact metric spaces, 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, Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023, Stable graphs: distributions and line-breaking construction, Scaling Limits of Markov-Branching Trees and Applications, Parking on Cayley trees and frozen Erdős-Rényi, Multisource invasion percolation on the complete graph, Models of random subtrees of a graph, A unified framework for generalizing the Gromov-Hausdorff metric, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics, Long paths in first passage percolation on the complete graph II. Global branching dynamics, Noise sensitivity of critical random graphs, Scaling Limits of Random Trees and Random Graphs, Heavy-tailed configuration models at criticality, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Critical random graphs and the differential equations technique, Invariance principles for random walks in random environment on trees, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Scaling limits for some random trees constructed inhomogeneously, Continuum limit of critical inhomogeneous random graphs, Asymptotics of integrals of Betti numbers for random simplicial complex processes, Geometry of the minimal spanning tree of a random 3-regular graph, Scaling limits of multi-type Markov branching trees, The gap between Gromov-Vague and Gromov-Hausdorff-vague topology, Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, The dual tree of a recursive triangulation of the disk, A greedy algorithm for finding maximum spanning trees in infinite graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
