The connectivity of a graph on uniform points on [0, 1]d

Statistics and Probability Letters

Volumn 60, Issue 4, 2002, Pages 351-357

  Appel, Martin J B ^a   Russo, Ralph P ^b  

^a Capital Markets Operations   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Connectivity; Connectivity distance; Geometric probability; Largest nearest neighbor link; Random graph; Random minimal spanning tree

Indexed keywords

EID: 0037114396     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-7152(02)00233-X     Document Type: Article

References (10)

1. d. Adv. Appl. Probab. 29 (3), 567-581.
2. d. Adv. Appl. Probab. 29 (3), 582-594.
3. Bollobás, B., 1979. Graph Theory: An Introductory Course. Springer, Berlin.
4. Dette, H., Henze, N., 1989. The limit distribution of the largest nearest-neighbor link in the unit d-cube. J. Appl. Probab. 26, 67-80.
5. Devroye, L., 1982. A log log law for maximal uniform spacings. Ann. Probab. 10, 863-868.
6. Palmer, E.M., 1985. Graphical Evolution. Wiley, New York.
7. Penrose, M.D., 1997. The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7 (2), 340-361.
8. Penrose, M.D., 1999a. On k-connectivity for a geometric random graph. Random Struct. Algorithms 15 (2), 145-164.
9. Penrose, M.D., 1999b. A strong law for the longest edge of the minimal spanning tree. Ann. Probab. 27, 246-260.
10. Steele, J.M., Tierney, L., 1986. Boundary domination and the distribution of the largest nearest-neighbor link. J. Appl. Probab. 23, 524-528.