Growth rates of Euclidean minimal spanning trees with power weighted edges

From MaRDI portal
Publication:1109408


DOI10.1214/aop/1176991596zbMath0655.60023WikidataQ56454188 ScholiaQ56454188MaRDI QIDQ1109408

J. Michael Steele

Publication date: 1988

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176991596


05C05: Trees

60F15: Strong limit theorems

60C05: Combinatorial probability


Related Items

On a random directed spanning tree, On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\), An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability, Euclidean semi-matchings of random samples, Asymptotics for Euclidean minimal spanning trees on random points, Rate of convergence for the Euclidean minimum spanning tree limit law, Asymptotics for transportation cost in high dimensions, Probabilistic models in cluster analysis, The central limit theorem for Euclidean minimal spanning trees. I, Rate of convergence of power-weighted Euclidean minimal spanning trees, Asymptotic of power-weighted Euclidean functionals, Asymptotics for weighted minimal spanning trees on random points, The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees, The central limit theorem for weighted minimal spanning trees on random points, Continuum percolation and Euclidean minimal spanning trees in high dimensions, Principal curves of oriented points: theoretical and computational improvements, On properties of geometric random problems in the plane, Asymptotics for Euclidean functionals with power-weighted edges, Random restricted matching and lower bounds for combinatorial optimization, Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges., The radial spanning tree of a Poisson point process, Rates of convergence of means of Euclidean functionals, Ergodic theorems for some classical problems in combinatorial optimization