The central limit theorem for Euclidean minimal spanning trees I I
Author:
- Sungchul LeeSLSungchul Lee
Open Access
- 1 November 1997
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 7 (4) , 996-1020
Abstract
Let ${X_i: i \geq 1}$ be i.i.d. with uniform distribution $[- 1/2, 1/2]^d, d \geq 2$, and let $T_n$ be a minimal spanning tree on ${X_1, \dots, X_n}$. For each strictly positive integer $\alpha$, let $N({X_1, \dots, X_n}; \alpha)$ be the number of vertices of degree $\alpha$ in $T_n$. Then, for each $\alpha$ such that $P(N({X_1, \dots, X_{\alpha+1}}; \alpha) = 1) > 0$, we prove a central limit theorem for $N({X_1, \dots, X_n}; \alpha)$.
Keywords
This publication has 24 references indexed in Scilit:
- The random minimal spanning tree in high dimensionsThe Annals of Probability, 1996
- The central limit theorem for weighted minimal spanning trees on random pointsThe Annals of Applied Probability, 1996
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning treesThe Annals of Applied Probability, 1996
- Simultaneous uniq H ueness of infinite clusters in stationary random labeled graphsCommunications in Mathematical Physics, 1995
- Limit Theorems and Rates of Convergence for Euclidean FunctionalsThe Annals of Applied Probability, 1994
- Asymptotics for Euclidean minimal spanning trees on random pointsProbability Theory and Related Fields, 1992
- On the number of leaves of a euclidean minimal spanning treeJournal of Applied Probability, 1987
- Minimal spanning tree analysis of biological structuresJournal of Theoretical Biology, 1987
- On the worst case of a minimal spanning tree algorithm for euclidean spaceBIT Numerical Mathematics, 1983
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972