On the total length of the random minimal directed spanning tree

In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set of points in the unit square, all edges must respect the ‘coordinatewise’ partial order and there must be a directed path from each vertex to a minimal element. We study the asymptotic behaviour of the total length of this graph with power-weighted edges. The limiting distribution is given by the sum of a normal component away from the boundary plus a contribution introduced by the boundary effects, which can be characterized by a fixed-point equation, and is reminiscent of limits arising in the probabilistic analysis of certain algorithms. As the exponent of the power weighting increases, the distribution undergoes a phase transition from the normal contribution being dominant to the boundary effects being dominant. In the critical case in which the weight is simple Euclidean length, both effects contribute significantly to the limit law.

[1]  Mathew D. Penrose,et al.  Random minimal directed spanning trees and Dickman-type distributions , 2004, Advances in Applied Probability.

[2]  J. Yukich,et al.  Central limit theorems for some graphs in computational geometry , 2001 .

[3]  D. McLeish.  Dependent Central Limit Theorems and Invariance Principles , 1974 .

[4]  O. Barndorfi-nielsen,et al.  On the distribution of the number of admissible points in a vector , 1966 .

[5]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[6]  U. Rösler.  A fixed point theorem for distributions , 1992 .

[7]  Mathew D. Penrose,et al.  Limit theory for the random on-line nearest-neighbor graph , 2008, Random Struct. Algorithms.

[8]  J. Yukich.  Probability theory of classical Euclidean optimization problems , 1998 .

[9]  Hsien-Kuei Hwang,et al.  Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic , 1998, Algorithmica.

[10]  Asymptotic Laws for Nonconservative Self-similar Fragmentations , 2004, math/0402227.

[11]  Béla Bollobás,et al.  Degree Distribution of the FKP Network Model , 2003, ICALP.

[12]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[13]  J. Yukich,et al.  Large deviation principles for Euclidean functionals and other nearly additive processes , 2001 .

[14]  M. Penrose,et al.  Rooted edges of a minimal directed spanning tree on random points , 2006, Advances in Applied Probability.

[15]  J. Yukich,et al.  Weak laws of large numbers in geometric probability , 2003 .

[16]  J. Steele.  Probability theory and combinatorial optimization , 1987 .

[17]  Harry Kesten,et al.  The central limit theorem for weighted minimal spanning trees on random points , 1996 .

[18]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .

[19]  Mathew D. Penrose,et al.  Normal Approximation in Geometric Probability , 2004 .

[20]  Uwe Rr Osler.  The Contraction Method for Recursive Algorithms , 1999 .

[21]  R. E. Miles.  On the homogeneous planar Poisson point process , 1970 .

[22]  M. Penrose,et al.  Multivariate spatial central limit theorems with applications to percolation and spatial graphs , 2004 .

[23]  R. Roy,et al.  On a random directed spanning tree , 2004, Advances in Applied Probability.

[24]  A. Rinaldo,et al.  Fractal River Basins: Chance and Self-Organization , 1997 .