Asymptotics for weighted minimal spanning trees on random points (Q1613584): Difference between revisions

A random sample \(X_1,X_2,\dots ,X_n\) of i.i.d. r.v. with values in \([0,1]^d\) and spanning trees with vertex set \(\{X_1,X_2,\dots ,X_n\}\) are considered. The length of a tree is measured by the sum of the Euclidean lengths of its edges in power \(p\geq 1\). Under the assumption that the random sample possesses continuous distribution with density bounded away from zero, the author proves asymptotic for the length of the minimal spanning trees. The asymptotic is shown in complete convergence for all \(d\geq 2\) and all \(p\geq 1\).