## Access

You are not currently logged in.

Access JSTOR through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

# Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges

J. Michael Steele
The Annals of Probability
Vol. 16, No. 4 (Oct., 1988), pp. 1767-1787
Stable URL: http://www.jstor.org/stable/2243991
Page Count: 21

#### Select the topics that are inaccurate.

Cancel
Preview not available

## Abstract

Let $X_i, 1 \leq i < \infty$, denote independent random variables with values in Rd, d ≥ 2, and let Mn denote the cost of a minimal spanning tree of a complete graph with vertex set {X1, X2, ..., Xn}, where the cost of an edge (Xi, Xj) is given by ψ(|Xi - Xj|). Here |Xi - Xj| denotes the Euclidean distance between Xi and Xj and ψ is a monotone function. For bounded random variables and $0 < \alpha < d$, it is proved that as n→∞ one has Mn ∼ c(α, d)n(d - α)/d ∫Rd f(x)(d-α)/d dx with probability 1, provided ψ(x) ∼ xα as x→ 0. Here f(x) is the density of the absolutely continuous part of the distribution of the {Xi}.

• 1767
• 1768
• 1769
• 1770
• 1771
• 1772
• 1773
• 1774
• 1775
• 1776
• 1777
• 1778
• 1779
• 1780
• 1781
• 1782
• 1783
• 1784
• 1785
• 1786
• 1787