Asymptotics for weighted minimal spanning trees on random points
✍ Scribed by J.E. Yukich
- Book ID
- 108433051
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 131 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0304-4149
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in ޒ d . Tightness of the distribution, as ␦ ª 0, is establi
The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal Ž . y 1 N ϱ y3 total weight. Then the weight of T is asymptotic to N 2 Ý i as N ª ϱ. Asymp-is1 totics are also given for the local stru
Penrose has given asymptotic results for the distribution of the longest edge of the minimal spanning tree and nearest neighbour graph for sets of multivariate uniformly or normally distributed points. We investigate the applicability of these results to samples of up to 100 points, in up to 10 dime