The central limit theorem for weighted minimal spanning trees on random points
The paper considers \(X_n\), \(n\in{\mathcal N}\), i.i.d. real random vectors uniformly distributed on \([0,1]^d\), \(d\geq 2\). The random points \(\{X_1,\dots,X_n\}\) can be connected by a spanning tree and the question is on the minimal length of that tree. The paper is recalling the results on the law of large numbers and contributes with the central limit theorem for the length of the minimal spanning tree.
scientific article; zbMATH DE number 940690