论文信息 - Rate of convergence for the Euclidean minimum spanning tree limit law

Rate of convergence for the Euclidean minimum spanning tree limit law

Let N"n be the number of points of a Poisson point process of intensity n times the Lebesgue measure over [0,1]^2, and let L"M"S"T(N"n) be the length of the optimal spanning tree connecting these N"n points. It is well-known that there is a constant 0 " "~ EL"M"S"T(N"n)/@/n = @b"M"S"T. In this paper we give the exa rate of convergence for this limiting behavior.

Patrick Jaillet

[1] K. Alexander. A Note on Some Rates of Convergence in First-Passage Percolation , 1993 .

[2] Patrick Jaillet. Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems , 1992, Math. Oper. Res..

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

[4] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

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

[6] F. Roberts. Random minimal trees , 1968 .

[7] Wansoo T. Rhee,et al. A sharp deviation inequality for the stochastic traveling salesman problem , 1989 .

[8] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .