The central limit theorem for Euclidean minimal spanning trees II

DOI10.1239/aap/1029955253zbMath0949.60027OpenAlexW2027361823MaRDI QIDQ4954104

Sungchul Lee

Publication date: 3 December 2000

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aoap/1043862422

zbMATH Keywords

central limit theoremcontinuum percolationminimal spanning tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Trees (05C05) Combinatorial optimization (90C27) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Multivariate tests of uniformity ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Multiscale functional inequalities in probability: constructive approach ⋮ Tail bound for the minimal spanning tree of a complete graph. ⋮ On approximation theorems for the Euler characteristic with applications to the bootstrap ⋮ On central limit theorems in stochastic geometry for add-one cost stabilizing functionals ⋮ On the law of the iterated logarithm and strong invariance principles in stochastic geometry ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ An empirical study of tests for uniformity in multidimensional data ⋮ Degree Frequencies in the Minimal Spanning Tree and Dimension Identification ⋮ Multivariate spatial central limit theorems with applications to percolation and spatial graphs ⋮ The invariance principle for the total length of the nearest-neighbor graph