Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
From MaRDI portal
Publication:6193765
DOI10.1007/s00440-024-01259-3arXiv2009.10696OpenAlexW4391913356MaRDI QIDQ6193765
Shankar Bhamidi, Sanchayan Sen
Publication date: 19 March 2024
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.10696
Gromov-Hausdorff distancecritical random graphsmultiplicative coalescentGromov-weak topologyminimal spanning treesinhomogeneous continuum random trees\(\mathbf{p}\)-trees
Cites Work
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Critical random graphs: limiting constructions and distributional properties
- 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
- Novel scaling limits for critical inhomogeneous random graphs
- Rayleigh processes, real trees, and root growth with re-grafting
- Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
- Generating simple random graphs with prescribed degree distribution
- On random minimum length spanning trees
- Random trees and applications
- 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
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- 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 entrance boundary of the multiplicative coalescent
- 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
- Most trees are short and fat
- Concentration around the mean for maxima of empirical processes
- 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
- Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
- Connected components in random graphs with given expected degree sequences
- Percolation and minimal spanning forests in infinite graphs
- Limit distributions and random trees derived from the birthday problem with unequal probabilities
- Geometry of the minimal spanning tree of a random 3-regular graph
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- Minimal spanning trees and Stein's method
- 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
- Critical random graphs and the structure of a minimum spanning tree
- Asymptotic equivalence and contiguity of some random graphs
- OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
- The Probability That a Random Multigraph is Simple
- 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
- Random minimal directed spanning trees and Dickman-type distributions
- The Average Distance in a Random Graph with Given Expected Degrees
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
- The phase transition in inhomogeneous random graphs
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Random Fragmentation and Coagulation Processes
- On the concentration function of a sum of independent random variables
- Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions
- A probabilistic approach to the leader problem in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
