Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

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

Wade, A.R. (2009) Asymptotic theory for the multidimensional random on-line nearest-neighbour graph. Stochastic Processes and their Applications, 119. pp. 1889-1911. ISSN 0304-4149

[img]
Preview
PDF (strathprints013393.pdf)
strathprints013393.pdf

Download (338kB) | 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.