The central limit theorem for Euclidean minimal spanning trees I

Annals of Applied Probability

Volumn 7, Issue 4, 1997, Pages 996-1020

  Lee, Sungchul ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Yonsei University   (South Korea)

Author keywords

Central limit theorem; Continuum percolation; Minimal spanning tree

Indexed keywords

EID: 0031260688     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. ALDOUS, D. and STEELE, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Related Fields 92 247-258.
2. ALEXANDER, K. S. (1995). Simultaneous uniqueness of infinite clusters in stationary random labeled graphs. Comm. Math. Phys. 168 39-55.
3. ALEXANDER, K. S. (1996). The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees. Ann. Appl. Probab. 6 466-494.
4. BENTLEY, J. L. and FRIEDMAN, J. H. (1978). Fast algorithms for constructing minimal spanning trees in coordinate spaces. IEEE Comput. 27 97-105.
5. CHANG, C. L., CHANG, S. K., KANG, A. N. C. and LEE, R. C. T. (1977). Storage reduction through minimal spanning trees and spanning forests. IEEE Comput. 26 425-434.
6. CHIN, F. Y. and HOUCK, D. J. (1978). Algorithms for updating minimal spanning trees. J. Comput. System Sci. 16 333-344.
7. DUSSERT, C., LLEBARIA, A., MARTY, F., PALMARI, J., RASIGNI, G. and RASIGNI, M. (1987). Minimal spanning tree analysis of biological structures. J. Theoret. Biol. 125 317-323.
8. EDDY, W. F., SHEPP, L. A. and STEELE, J. M. (1987). On the number of leaves of a Euclidean minimal spanning tree. J. Appl. Probab. 24 809-826.
9. FRIEDMAN, J. H. and RAFSKY, L. C. (1979). Multivariate generalizations of the Wolfowitz and Smirnov two-sample tests. Ann. Statist. 7 697-717.
10. FRIEDMAN, J. H. and RAFSKY, L. C. (1983). Graph-theoretic measures of multivariate association and prediction. Ann. Statist. 11 377-391.
11. HALL, P. and HEYDE, C. C. (1980). Martingale Limit Theory and Its Application. Academic Press, New York.
12. JUNG, H. A. (1974). Determination of minimal paths and spanning trees in graphs. Computing 13 249.
13. KATAJAINEN, J. (1983). On the worst case of a minimal spanning tree algorithm for Euclidean space. BIT 23 2-8.
14. KESTEN, H. and LEE, S. (1996). The central limit theorem for weighted minimal spanning trees on random point. Ann. Appl. Probab. 6 495-527.
15. KRUSKAL, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7 48-50.
16. LÉVY, P. (1937). Théorie de l'Addition des Variables Aléatoires. Gauthier-Villars, Paris.
17. MALLION, R. B. (1975). Number of spanning trees in a molecular graph. Chem. Phys. Lett. 36 170-174.
18. MCLEISH, D. L. (1974). Dependent central limit theorems and invariance principles. Ann. Probab. 2 620-628.
19. PENNY, D. (1980). Techniques for the verification of minimal phylogenetic trees illustrated with 10 mammalian hemoglobin sequences. Biochem. J. 187 65-74.
20. PENROSE, M. D. (1996). The random minimal spanning tree in high dimensions. Ann. Probab. 6 528-544.
21. REDMOND, C. and YUKICH, J. E. (1994). Limit theorems and rates of convergence for Euclidean functional. Ann. Appl. Probab. 4 1057-1073.
22. RHEE, W. T. and TALAGRAND, M. (1989). A sharp deviation inequality for the stochastic traveling salesman problem. Ann. Probab. 17 1-8.
23. ROHLF, F. J. (1975). Generalization of the gap test for the detection of multivariate outliers. Biometrics 31 93-101.
24. ROMANE, F. (1977). Possible use of minimum spanning tree in phytoecology. Vegetation 33 99-106.
25. ROSEN, K. H. (1995). Discrete Mathematics and Its Applications, 3rd ed. McGraw-Hill, New York.
26. STEELE, J. M. (1988). Growth rates of Euclidean minimal spanning trees with power weighted edges. Ann. Probab. 16 1767-1787.
27. WHITNEY, V. K. M. (1972). Minimal spanning tree. Comm. ACM 15 273.
28. WU, F. Y. (1977). Number of spanning trees on a lattice. J. Phys. A 10 L113-L115.