The central limit theorem for Euclidean minimal spanning trees II
Author:
- Sungchul LeeSLSungchul Lee
- 1 December 1999
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 31 (4) , 969-984
Abstract
Let Xi : i ≥ 1 be i.i.d. points in ℝd, d ≥ 2, and let Tn be a minimal spanning tree on X1,…,Xn. Let L(X1,…,Xn) be the length of Tn and for each strictly positive integer α let N(X1,…,Xn;α) be the number of vertices of degree α in Tn. If the common distribution satisfies certain regularity conditions, then we prove central limit theorems for L(X1,…,Xn) and N(X1,…,Xn;α). We also study the rate of convergence for EL(X1,…,Xn).Keywords
This publication has 12 references indexed in Scilit:
- The central limit theorem for Euclidean minimal spanning trees I IThe Annals of Applied Probability, 1997
- The central limit theorem for weighted minimal spanning trees on random pointsThe Annals of Applied Probability, 1996
- Simultaneous uniq H ueness of infinite clusters in stationary random labeled graphsCommunications in Mathematical Physics, 1995
- Rates of Convergence of Means for Distance-Minimizing Subadditive Euclidean FunctionalsThe Annals of Applied Probability, 1994
- Rate of convergence for the Euclidean minimum spanning tree limit lawOperations Research Letters, 1993
- Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted EdgesThe Annals of Probability, 1988
- On the number of leaves of a euclidean minimal spanning treeJournal of Applied Probability, 1987
- Graph-Theoretic Measures of Multivariate Association and PredictionThe Annals of Statistics, 1983
- Generalization of the Gap Test for the Detection of Multivariate Outliers1975
- Dependent Central Limit Theorems and Invariance PrinciplesThe Annals of Probability, 1974