The longest edge of the random minimal spanning tree

Annals of Applied Probability

Volumn 7, Issue 2, 1997, Pages 340-361

  Penrose, Mathew D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Chen Stein method; Continuum percolation; Extreme values; Geometric probability; Minimal spanning tree; Nearest neighbor graph; Poisson process

Indexed keywords

EID: 0031287494     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034625335     Document Type: Article

References (30)

1. ALDOUS, D. J. (1989). Stein's method in a two-dimensional coverage problem. Statist. Probab. Lett. 8 307-314.
2. ALEXANDER, K. S. (1995). Percolation and minimal spanning forests in infinite graphs. Ann. Probab. 23 87-104.
3. d. Preprint. Univ. Iowa.
4. d. Adv. in Appl. Probab. To appear.
5. ARRATIA, R., GOLDSTEIN, L. and GORDON, L. (1989). Two moments suffice for Poisson approximations: the Chen-Stein method. Ann. Probab. 17 9-25.
6. AVRAM, F. and BERTSIMAS, D. (1993). On central limit theorems in geometrical probability. Ann. Appl. Probab. 3 1033-1046.
7. BEARDWOOD, J., HALTON, J. H. and HAMMERSLEY, J. (1959). The shortest path through many points. Proc. Cambridge Philos. Soc. 55 299-327.
8. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York.
9. CARONI, C. and PRESCOTT, P. (1995). On Rohlf's method for the detection of outliers in multivariate data. J. Multivariate Anal. 52 295-307.
10. DETTE, H. and HENZE, N. (1989). The limit distribution of the largest nearest-neighbour link in the unit d-cube. J. Appl. Probab. 26 67-80.
11. DEUSCHEL, J.-D. and PISZTORA, A. (1996). Surface order large deviations for high-density percolation. Probab. Theory Related Fields 104 467-482.
12. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
13. HADI, A. S. and SIMONOFF, J. S. (1993). Procedures in the identification of multiple outliers in linear models. J. Amer. Statist. Assoc. 88 1264-1272.
14. HALL, P. (1985). Distribution of size, structure and number of vacant regions in a high-intensity mosaic. Z. Wahrsch. Verw. Gebiete 70 237-265.
15. HARTIGAN, J. A. (1975). Clustering Algorithms. Wiley, New York.
16. HARTIGAN, J. A. (1981). Consistency of single linkage for high-density clusters. J. Amer. Statist. Assoc. 76 388-394.
17. HENZE, N. (1982). The limit distribution of the maxima of 'weighted' rth-nearest-neighbour distances. J. Appl. Probab. 19 344-354.
18. JAILLET, P. (1993). Cube versus torus models and the Euclidean minimal spanning tree constant. Ann. Appl. Probab. 3 582-592.
19. JAILLET, P. (1995). On properties of geometric random problems in the plane. Annals of Operations Research 61 1-20.
20. JANSON, S. (1986). Random coverings in several dimensions. Acta Math. 156 83-118.
21. RESTEN, H. and LEE, S. (1996). The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Probab. 6 495-527.
22. KLARNER, D. A. (1967). Cell growth problems. Canad. J. Math. 19 851-863.
23. PENROSE, M. D. (1991). On a continuum percolation model. Adv. in Appl. Probab. 23 536-556.
24. PENROSE, M. D. (1996). Extremes for the minimal spanning tree on normally distributed points. Preprint.
25. RESNICK, S. I. (1987). Extreme Values, Regular Variation, and Point Processes. Springer, New York.
26. ROHLF, F. J. (1975). Generalization of the gap test for the detection of multivariate outliers. Biometrics 31 93-101.
27. SILVERMAN, B. and BROWN, T. (1978). Short distances, flat triangles and Poisson limits. J. Appl. Probab. 15 815-825.
28. STEELE, J. M. (1993). Probability and problems in Euclidean combinatorial optimization. Statist. Sci. 8 48-56.
29. STEELE, J. M., SHEPP, L. A. and EDDY, W. F. (1987). On the number of leaves of a Euclidean minimal spanning tree. J. Appl. Probab. 24 809-826.
30. STEELE, J. M. and TIERNEY, L. (1986). Boundary domination and the distribution of the largest nearest-neighbour link in higher dimensions. J. Appl. Probab. 23 524-528.