Extremes for the minimal spanning tree on normally distributed points
From MaRDI portal
Publication:4221245
DOI10.1239/aap/1035228120zbMath0919.60025MaRDI QIDQ4221245
Publication date: 3 January 1999
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1035228120
extreme values; Poisson process; minimal spanning tree; geometric probability; Chen-Stein method; nearest neighbour graph
60D05: Geometric probability and stochastic geometry
05C05: Trees
60G70: Extreme value theory; extremal stochastic processes
90C27: Combinatorial optimization
Related Items
Inhomogeneous random graphs, isolated vertices, and Poisson approximation, Robust estimation of location and scatter by pruning the minimum spanning tree, Nonuniform random geometric graphs with location-dependent radii, Vertex degree of random geometric graph on exponentially distributed points, A strong law for the longest edge of the minimal spanning tree, Inapplicability of asymptotic results on the minimal spanning tree in statistical testing, Extremes on trees, Resistant estimation of multivariate location using minimum spanning trees, Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs