Asymptotics for weighted minimal spanning trees on random points

For all p[greater-or-equal, slanted]1 let Mp(X1,...,Xn) denote the length of the minimal spanning tree through random variables X1,...,Xn, where the cost of an edge (Xi, Xj) is given by Xi-Xjp. If the Xi, i[greater-or-equal, slanted]1, are i.i.d. with values in [0,1]d, d[greater-or-equal, slanted]2, and have a density f which is bounded away from zero and which has support [0,1]d, then for all p[greater-or-equal, slanted]1, including p in the critical range p[greater-or-equal, slanted]d, we haveHere C(p,d) denotes a positive constant depending only on p and d and c.c. denotes complete convergence. Extensions to related optimization problems are indicated and rates of convergence are also found.

[1]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[2]  J. Yukich,et al.  Asymptotics for Euclidean functionals with power-weighted edges , 1996 .

[3]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[4]  Asymptotics of power-weighted Euclidean functionals , 1999 .

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

[6]  V. Milman,et al.  Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .

[7]  Mathew D. Penrose.  The random minimal spanning tree in high dimensions , 1996 .

[8]  Sungchul Lee,et al.  The central limit theorem for Euclidean minimal spanning trees I I , 1997 .

[9]  Wansoo T. Rhee.  A Matching Problem and Subadditive Euclidean Functionals , 1993 .

[10]  Kenneth S. Alexander,et al.  The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees , 1996 .

[11]  G. Pisier.  ASYMPTOTIC THEORY OF FINITE DIMENSIONAL NORMED SPACES (Lecture Notes in Mathematics 1200) , 1987 .

[12]  Sungchul Lee,et al.  The central limit theorem for Euclidean minimal spanning trees II , 1999, Advances in Applied Probability.

[13]  J. Yukich.  Asymptotics for the Euclidean TSP with power weighted edges , 1995 .

[14]  M. Talagrand.  A new look at independence , 1996 .

[15]  K. Alexander.  Rates of Convergence of Means for Distance-Minimizing Subadditive Euclidean Functionals , 1994 .

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

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

[18]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[19]  J. Michael Steele,et al.  Asymptotics for Euclidean minimal spanning trees on random points , 1992 .