The invariance principle for the total length of the nearest-neighbor graph (Q2576795): Difference between revisions

The authors show a strong invariance principle for the total length of the nearest-neighbour graph on \({\mathcal P}\cap[-n/2,n/2]^d\), where \(d\in\{2,3,\dots\}\) and \({\mathcal P}\) denotes a Poisson point process on \({\mathbb R}^d\) with intensity \(1\).