Asymptotic theory for the multidimensional random on-line nearest-neighbour graph

Tools

Wade, Andrew R. (2009) Asymptotic theory for the multidimensional random on-line nearest-neighbour graph. Stochastic Processes and their Applications, 119 (6). pp. 1889-1911. ISSN 0304-4149 (https://doi.org/10.1016/j.spa.2008.09.006)

[thumbnail of strathprints013393]
Preview
 Text. Filename: strathprints013393.pdf
Accepted Author Manuscript
Download (233kB)| Preview

Abstract

The on-line nearest-neighbour graph on a sequence of n uniform random points in (0,1)d joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this graph, with weight exponent αset membership, variant(0,d/2], we prove O(max{n1−(2α/d),logn}) upper bounds on the variance. On the other hand, we give an n→∞ large-sample convergence result for the total power-weighted edge-length when α>d/2. We prove corresponding results when the underlying point set is a Poisson process of intensity n.

CORE (COnnecting REpositories)