Extremes for the minimal spanning tree on normally distributed points

DOI10.1239/AAP/1035228120MaRDI QIDQ4221245zbMATH OpenOpenAlexFDO

Authors Mathew D. Penrose

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

zbMATH Keywords

Chen-Stein methodextreme valuesgeometric probabilityminimal spanning treenearest neighbour graphPoisson process

Mathematics Subject Classification ID

Trees (05C05) Geometric probability and stochastic geometry (60D05) Extreme value theory; extremal stochastic processes (60G70) Combinatorial optimization (90C27)

Recommendations

• The longest edge of the random minimal spanning tree
• Extremes on trees
• The central limit theorem for Euclidean minimal spanning trees II

Cited in

(12)

• The longest edge of the random minimal spanning tree
• 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
• Robust estimation of location and scatter by pruning the minimum spanning tree
• Modeling a minimal spanning tree
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Fluctuations of the connectivity threshold and largest nearest-neighbour link
• Nonuniform random geometric graphs with location-dependent radii
• Vertex degree of random geometric graph on exponentially distributed points

This page was built for publication: Extremes for the minimal spanning tree on normally distributed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221245)