A strong law for the longest edge of the minimal spanning tree

Annals of Probability

Volumn 27, Issue 1, 1999, Pages 246-260

  Penrose, Mathew D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Connectedness; Extreme values; Geometric probability; Minimal spanning tree

Indexed keywords

EID: 0033243141     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/aop/1022677261     Document Type: Article

References (10)

1. d. Preprint, Univ. Iowa.
2. d. Adv. in Appl. Probab. 29 582-594.
3. DUGUNDJI, J. (1966). Topology. Allyn and Bacon, Boston.
4. GRIMMETT, G. (1989). Percolation. Springer, New York.
5. KLARNER, D. A. (1967). Cell growth problems. Canad. J. Math. 19 851-863.
6. PENROSE, M. D. (1998). Extremes for the minimal spanning tree on normally distributed points. Adv. in Appl. Probab. 30 628-639.
7. PENROSE, M. D. (1997). The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7 340-361.
8. PENROSE, M. D. (1997). On k-connectivity for a geometric random graph. Preprint.
9. PENROSE, M. D. (1997). A strong law for the largest nearest-neighbour link between random points. J. London Math. Soc. To appear.
10. TABAKIS, E. (1996). On the longest edge of the minimal spanning tree. In From Data to Knowledge (W. Gaul and D. Pfeifer, eds.) 222-230. Springer, New York.