On the number of leaves of a euclidean minimal spanning tree

DOI10.2307/3214207zbMath0639.60014OpenAlexW2121599632MaRDI QIDQ3780174

William F. Eddy, J. Michael Steele, Lawrence A. Shepp

Publication date: 1987

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

Full work available at URL: https://semanticscholar.org/paper/04c343d99693171cc07c5514d2a54eefb0f1e3d1

zbMATH Keywords

self-similar processesEfron-Stein inequalityvertex degreessubadditive Euclidean functionalsEuclidean minimal spanning tree

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Combinatorial probability (60C05)

Related Items (15)

Weak laws of large numbers in geometric probability ⋮ Multidimensional medians arising from geodesics on graphs ⋮ On properties of geometric random problems in the plane ⋮ Intrinsic dimension estimation: relevant techniques and a benchmark framework ⋮ The central limit theorem for Euclidean minimal spanning trees. I ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ Tail bound for the minimal spanning tree of a complete graph. ⋮ Euclidean semi-matchings of random samples ⋮ The random minimal spanning tree in high dimensions ⋮ Asymptotics for Euclidean minimal spanning trees on random points ⋮ Algorithms for Euclidean Degree Bounded Spanning Tree Problems ⋮ On the multivariate runs test ⋮ Degree Frequencies in the Minimal Spanning Tree and Dimension Identification ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem

This page was built for publication: On the number of leaves of a euclidean minimal spanning tree