The central limit theorem for Euclidean minimal spanning trees I I
The central limit theorem for Euclidean minimal spanning trees I I
Let ${X_i: i \geq 1}$ be i.i.d. with uniform distribution $[- 1/2, 1/2]^d, d \geq 2$, and let $T_n$ be a minimal spanning tree on ${X_1, \dots, X_n}$. For each strictly positive integer $\alpha$, let $N({X_1, \dots, X_n}; \alpha)$ be the number of vertices of degree $\alpha$ in $T_n$. Then, …