On the total length of the random minimal directed spanning tree

Advances in Applied Probability

Volumn 38, Issue 2, 2006, Pages 336-372

  Penrose, Mathew D ^a   Wade, Andrew R ^a  

^a University of Bath   (United Kingdom)

Author keywords

Fixed point equation; Fragmentation process; Nearest neighbour graph; Phase transition; Spanning tree; Weak convergence

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; PHASE TRANSITIONS; PROBABILITY; TREES (MATHEMATICS);

FIXED-POINT EQUATION; FRAGMENTATION PROCESS; NEAREST-NEIGHBOUR GRAPH; SPANNING TREE; WEAK CONVERGENCE;

RANDOM PROCESSES;

EID: 33745946243     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1151337075     Document Type: Article

References (23)

1. Bai, Z.-D., Lee, S. and Penrose, M. D. (2006). Rooted edges in a minimal directed spanning tree. Adv. Appl. Prob. 38, 1-30.
2. Barndorff-Nielsen O. and Sobel, M. (1966). On the distribution of the number of admissible points in a vector random sample. Theory Prob. Appl. 11, 249-269.
3. Bertoin, J. and Gnedin, A. (2004). A symptotic laws for nonconservative selfsimilar fragmentations. Electron. J. Prob. 9, 575-593.
4. Berger, N. et al. (2003). Degree distribution of the FKP model. In Automata, Languages and Programming (Proc. 30th Internat. Colloquium, ICALP 2003, Eindhoven; Lecture Notes Comp. Sci. 2719), eds J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger, Springer, Berlin, pp. 725-738.
5. Bhatt, A. G. and Roy, R. (2004). On a random directed spanning tree. Adv. Appl. Prob. 36, 19-42.
6. Hoare, C. A. R. (1961). Algorithm 64: Quicksort. Commun. Assoc. Comput. Mach. 4, 321.
7. Hwang, H.-K. (1998). Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic. Algorithmica 22, 529-546.
8. Kesten, H. and Lee, S. (1996). The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Prob. 6, 495-527.
9. Kingman, J. F. C. (1993). Poisson Processes (Oxford Stud. Prob. 3). Clarendon Press, Oxford.
10. Neininger, R. and Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Prob. 14, 378-418.
11. Penrose, M. (2003). Random Geometric Graphs (Oxford Stud. Prob. 5). Oxford University Press.
12. Penrose, M. D. (2005). Multivariate spatial central limit theorems with applications to percolation and spatial graphs. Ann. Prob. 33, 1945-1991.
13. Penrose, M. D. and Wade, A. R. (2004). On the total length of the random minimal directed spanning tree. Preprint. Available at http://arxiv.org/ abs/math.PR/0409201.
14. Penrose, M. D. and Wade, A. R. (2004). Random minimal directed spanning trees and Dickman-type distributions. Adv. Appl. Prob. 36, 691-714.
15. Penrose, M. D. and Wade, A. R. (2006). Limit theory for the random on-line nearest-neighbour graph. Preprint. Available at http://arxiv.org/ abs/math.PR/0603561.
16. Penrose, M. D. and Yukich, J. E. (2001). Central limit theorems for some graphs in computational geometry. Ann. Appl. Prob. 11, 1005-1041.
17. Penrose, M. D. and Yukich, J. E. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Prob. 13, 277-303.
18. Rodriguez-Iturbe, I. and Rinaldo, A. (1997). Fractal River Basins: Chance and Self-Organization. Cambridge University Press.
19. Rösler, U. (1992). A fixed point theorem for distributions. Stoch. Process. Appl. 42, 195-214.
20. Rösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29, 3-33.
21. Seppäläinen, T. and Yukich, J. E. (2001). Large deviation principles for Euclidean functionals and other nearly additive processes. Prob. Theory Relat. Fields 120, 309-345.
22. Steele, J. M. (1997). Probability Theory and Combinatorial Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA.
23. Yukich J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems (Lecture Notes Math. 1675). Springer, Berlin.