The central limit theorem for Euclidean minimal spanning trees. I

From MaRDI portal
Publication:1379719

DOI10.1214/aoap/1043862422zbMath0892.60034OpenAlexW1995496381MaRDI QIDQ1379719

Sungchul Lee

Publication date: 9 August 1998

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1043862422




Related Items (29)

A central limit theorem with applications to percolation, epidemics and Boolean models.Limit theory for random sequential packing and depositionAsymptotics for weighted minimal spanning trees on random pointsCentral limit theorems for \(k\)-nearest neighbour distancesIntrinsic dimension identification via graph-theoretic methodsNavigation on a Poisson point processChase–escape in dynamic device-to-device networksMonte Carlo methods for sensitivity analysis of Poisson-driven stochastic systems, and applicationsConnected spatial networks over random points and a route-length statisticRate of convergence of power-weighted Euclidean minimal spanning treesMultiscale functional inequalities in probability: constructive approachTail bound for the minimal spanning tree of a complete graph.A functional central limit theorem for spatial birth and death processesOn approximation theorems for the Euler characteristic with applications to the bootstrapThe radial spanning tree of a Poisson point processExtremes on treesContinuum percolation for Cox point processesAsymptotic theory for statistics of the Poisson-Voronoi approximationOn central limit theorems in stochastic geometry for add-one cost stabilizing functionalsOn the law of the iterated logarithm and strong invariance principles in stochastic geometryGeometry of the minimal spanning tree of a random 3-regular graphNormal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilizationOn the multivariate runs testDegree Frequencies in the Minimal Spanning Tree and Dimension IdentificationAn average case analysis of the minimum spanning tree heuristic for the power assignment problemQuantitative two-scale stabilization on the Poisson spaceMultivariate spatial central limit theorems with applications to percolation and spatial graphsThe invariance principle for the total length of the nearest-neighbor graphGaussian tail for empirical distributions of MST on random graphs



Cites Work


This page was built for publication: The central limit theorem for Euclidean minimal spanning trees. I