Rooted edges of a minimal directed spanning tree on random points

Advances in Applied Probability

Volumn 38, Issue 1, 2006, Pages 1-30

  Bai, Z D ^a,b   Lee, Sungchul ^c   Penrose, Mathew D ^d  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c Yonsei University   (South Korea)

^d University of Bath   (United Kingdom)

Author keywords

Central limit theorem; Minimal spanning tree; Multivariate extreme

Indexed keywords

ASYMPTOTIC STABILITY; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; SET THEORY;

CENTRAL LIMIT THEOREM; MINIMAL SPANNING TREE; MULTIVARIATE EXTREME; RANDOM POINTS;

TREES (MATHEMATICS);

EID: 33646119184     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1143936137     Document Type: Article

References (18)

1. Bai, Z.-D., Chao, C.-C., Hwang, H.-K. and Liang, W.-Q. (1998). On the variance of the number of maxima in random vectors and its applications. Ann. Appl. Prob. 8, 886-895.
2. Bai, Z.-D., Devroye, L., Hwang, H.-K. and Tsai, T.-H. (2005). Maxima in hypercubes. Random Structures Algorithms 27, 290-309.
3. Bai, Z.-D. et al. (2001). Limit theorems for the number of maxima in random samples from planar regions. Electron. J. Prob. 6, 41pp.
4. Barbour, A. D. and Xia, A. (2001). The number of two-dimensional maxima. Adv. Appl. Prob. 33, 727-750.
5. Baryshnikov, Y. (2000). Supporting points processes and some of their applications. Prob. Theory Relat. Fields 117, 163-182.
6. Bhatt, A. and Roy, R. (2004). On a random directed spanning tree. Adv. Appl. Prob. 36, 19-42.
7. Bräker, H. and Hsing, T. (1998). On the area and perimeter of a random convex hull in a bounded convex set. Prob. Theory Relat. Fields 111, 517-550.
8. Groeneboom, P. (1988). Limit theorems for convex hulls. Prob. Theory Relat. Fields 79, 329-368.
9. Hall, P. (1992). The Bootstrap and Edgeworth Expansion. Springer, New York.
10. Hsing, T. (1994). On the asymptotic distribution of the area outside a random convex hull in a disk. Ann. Appl. Prob. 4, 478-493.
11. Janson, S., Łuczak, T. and Ruciński, A. (2000). Random Graphs. John Wiley, New York.
12. Kesten, H. and Lee, S. (1996). The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Prob. 6, 495-527.
13. Penrose, M. D. (2003). Random Geometric Graphs (Oxford Studies Prob. 6). Oxford University Press.
14. Penrose, M. D. and Wade, A. (2004). Random minimal directed spanning trees and Dickman-type distributions. Adv. Appl. Prob. 36, 691-714.
15. Penrose, M. D. and Yukich, J. E. (2001). Central limit theorems for some graphs in computational geometry. Ann. Appl. Prob. 11, 1005-1041.
16. Penrose, M. D. and Yukich, J. E. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Prob. 13, 277-303.
17. Steele, J. M. (1997). Probability Theory and Combinatorial Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA.
18. Yukich, J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems (Lecture Notes Math. 1675). Springer, Berlin.