On k-connectivity for a geometric random graph

Random Structures and Algorithms

Volumn 15, Issue 2, 1999, Pages 145-164

  Penrose, Mathew D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Geometric probability; k connectivity; Random graph

Indexed keywords

EID: 0033471867     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G     Document Type: Article

References (16)

1. d, Adv Appl Probab 29 (1997), 567-581.
2. d, Technical report No. 275, Department of Statistics and Actuarial Science, University of Iowa (1996).
3. A.D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford University Press, Oxford, 1992.
4. B. Bollobás, Graph Theory, Springer, New York, 1979.
5. B. Bollobás, Random Graphs, Academic Press, London, 1985.
6. H. Dette and N. Henze, Some peculiar boundary phenomena for extremes of rth nearest neighbor links, Statist Probab Lett 10 (1990), 381-390.
7. J. Dugundji, Topology, Allyn and Bacon, Boston, 1966.
8. E. Godehardt, Graphs as Structural Models, second edition, Wieweg, Braunschweig, 1990.
9. J.A. Hartigan, Clustering Algorithms, Wiley, New York, 1975.
10. J.A. Hartigan, Consistency of single linkage for high-density clusters, J Amer Statist Soc 76 (1981), 388-394.
11. N. Henze, The limit distribution for maxima of "weighted" rth nearest neighbor distances, J Appl Probab 19 (1982), 344-354.
12. L. Holst, On multiple covering of a circle with random arcs, J Appl Probab 16 (1980), 284-290.
13. D.A. Klarner, Cell growth problems, Can J Math 19 (1967), 851-863.
14. R.F. Ling, A probability theory of clustering, J Amer Statist Assoc 68 (1973), 159-164.
15. M.D. Penrose, The longest edge of the random minimal spanning tree, Ann Appl Probab 7 (1997), 340-361.
16. M.A. Wong and T. Lane, A kth nearest neighbor clustering procedure, J Roy Statist Soc Ser B 45 (1983), 362-368.