The minimum vertex degree of a graph on uniform points in [0, 1]d

Advances in Applied Probability

Volumn 29, Issue 3, 1997, Pages 582-594

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

^a UNITED TECHNOLOGIES RESEARCH CENTER   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Largest nearest neighbor link; Minimum vertex degree; Random graph

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; RANDOM PROCESSES; SET THEORY;

INDEPENDENT RANDOM POINTS; LARGEST NEAREST NEIGHBOR LINK; MINIMUM VERTEX GRAPH DEGREE;

PROBABILITY;

EID: 0031220659     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800028251     Document Type: Article

References (7)

1. d. In preparation.
2. d. Adv. Appl. Prob. 29, 567-581.
3. BOLLOBÁS, B. (1979) Graph Theory: an Introductory Course. Springer, Berlin.
4. DETTE, H. AND HENZE, N. (1989) The limit distribution of the largest nearest-neighbor link in the unit d-cube. J. Appl. Prob. 26, 67-80.
5. DUDLEY, R. M. (1978) Central limit theorems for empirical measures. Ann. Prob. 6, 899-929.
6. PALMER, E. M. (1985) Graphical Evolution. Wiley, New York.
7. STEELE, J. M. AND TIERNEY, L. (1986) Boundary domination and the distribution of the largest nearest-neighbor link. J. Appl. Prob. 23, 524-528.