The central limit theorem for weighted minimal spanning trees on random points
From MaRDI portal
Publication:1814748
DOI10.1214/aoap/1034968141zbMath0862.60008OpenAlexW1991951594MaRDI QIDQ1814748
Publication date: 25 May 1997
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1034968141
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)
Related Items
A central limit theorem with applications to percolation, epidemics and Boolean models. ⋮ Weak laws of large numbers in geometric probability ⋮ Limit theory for random sequential packing and deposition ⋮ Asymptotics for weighted minimal spanning trees on random points ⋮ THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS ⋮ Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars ⋮ Limit Theorems in Discrete Stochastic Geometry ⋮ The central limit theorem for Euclidean minimal spanning trees. I ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Connected spatial networks over random points and a route-length statistic ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Fractal dimension estimation with persistent homology: a comparative study ⋮ Central limit theorems for the radial spanning tree ⋮ Tail bound for the minimal spanning tree of a complete graph. ⋮ A functional central limit theorem for spatial birth and death processes ⋮ Persistent homology and the upper box dimension ⋮ Normal approximation for stabilizing functionals ⋮ A new method of normal approximation ⋮ The random minimal spanning tree in high dimensions ⋮ Minimum spanning trees of random geometric graphs with location dependent weights ⋮ Malliavin-Stein method: a survey of some recent developments ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ Limit theorems for monotonic particle systems and sequential deposition. ⋮ Explicit laws of large numbers for random nearest-neighbour-type graphs ⋮ Extremes on trees ⋮ Limit theorems for random spatial drainage networks ⋮ Asymptotic theory for statistics of the Poisson-Voronoi approximation ⋮ On central limit theorems in stochastic geometry for add-one cost stabilizing functionals ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization ⋮ Asymptotic theory for the multidimensional random on-line nearest-neighbour graph ⋮ The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees ⋮ Rooted edges of a minimal directed spanning tree on random points ⋮ On the total length of the random minimal directed spanning tree ⋮ On a random directed spanning tree ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem ⋮ Multivariate normal approximation in geometric probability ⋮ Fractal dimension and the persistent homology of random geometric complexes ⋮ Quantitative two-scale stabilization on the Poisson space ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem ⋮ Multivariate spatial central limit theorems with applications to percolation and spatial graphs ⋮ The invariance principle for the total length of the nearest-neighbor graph ⋮ Gaussian tail for empirical distributions of MST on random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Asymptotics for Euclidean minimal spanning trees on random points
- On central limit theorems in geometrical probability
- Rates of convergence of means for distance-minimizing subadditive Euclidean functionals
- Limit theorems and rates of convergence for Euclidean functionals
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- Dependent central limit theorems and invariance principles
- Concentration of measure and isoperimetric inequalities in product spaces
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
This page was built for publication: The central limit theorem for weighted minimal spanning trees on random points
