Geometry of the minimal spanning tree of a random 3-regular graph

DOI10.1007/s00440-021-01071-3zbMath1484.60006arXiv1810.03802OpenAlexW3166416457MaRDI QIDQ2041649

Sanchayan Sen, Louigi Addario-Berry

Publication date: 23 July 2021

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

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

zbMATH Keywords

random regular graphsGromov-Hausdorff distancecritical percolationminimal spanning treeconfiguration modelreal treegraphs with prescribed degree sequence

Mathematics Subject Classification ID

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

Related Items

Stable graphs: distributions and line-breaking construction ⋮ Multisource invasion percolation on the complete graph ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Cycle structure of percolation on high-dimensional tori
• The component sizes of a critical random graph with given degree sequence
• Critical window for the configuration model: finite third moment degrees
• Hypercube percolation
• Critical random graphs: limiting constructions and distributional properties
• Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
• The random minimal spanning tree in high dimensions
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Continuum limit of critical inhomogeneous random graphs
• The continuum random tree. I
• Minimal spanning forests
• Random graph asymptotics on high-dimensional tori
• On random minimum length spanning trees
• Critical random graphs: Diameter and mixing time
• Random trees and applications
• On percolation in random graphs with given vertex degrees
• On the value of a random minimum spanning tree problem
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Asymptotics for Euclidean minimal spanning trees on random points
• The asymptotic number of labeled graphs with given degree sequences
• Random minimum length spanning trees in regular graphs
• Rates of convergence of means for distance-minimizing subadditive Euclidean functionals
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The longest edge of the random minimal spanning tree
• The central limit theorem for Euclidean minimal spanning trees. I
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• A note on random minimum length spanning trees
• The scaling limits of the minimal spanning tree and invasion percolation in the plane
• The scaling limit of the minimum spanning tree of the complete graph
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
• The central limit theorem for weighted minimal spanning trees on random points
• Percolation and minimal spanning forests in infinite graphs
• Percolation of level sets for two-dimensional random fields with lattice symmetry
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Heavy-tailed configuration models at criticality
• The continuum random tree. III
• Minimal spanning trees and Stein's method
• Component sizes for large quantum Erdős-Rényi graph near criticality
• The continuum limit of critical random graphs
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Random Graphs and Complex Networks
• The Phase Transition in the Configuration Model
• Critical random graphs and the structure of a minimum spanning tree
• Critical percolation on random regular graphs
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• The Probability That a Random Multigraph is Simple
• Susceptibility in subcritical random graphs
• Tessellations of random maps of arbitrary genus
• A random tree model associated with random graphs
• Component behavior near the critical point of the random graph process
• On a random directed spanning tree
• Critical Percolation and the Minimal Spanning Tree in Slabs
• Random minimal directed spanning trees and Dickman-type distributions
• A critical point for random graphs with a given degree sequence
• Paths in graphs
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• The central limit theorem for Euclidean minimal spanning trees II
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• The birth of the giant component
• The phase transition in inhomogeneous random graphs
• Asymptotics of trees with a prescribed degree sequence and applications
• Rooted edges of a minimal directed spanning tree on random points
• Exact Distribution of the Product of Independent Generalized Gamma Variables with the Same Shape Parameter
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Optimal Transport