Limit theory for the random on-line nearest-neighbour graph

Details Limit theory for the random on-line nearest-neighbour graph Limit theory for the random on-line nearest-neighbour graph

2006-03-23

arxiv.org/abs/math/0603561v1

Random Structures and Algorithms, Vol. 32 (2008), no. 2, p. 125-156

Mathematics

Probability

28 pages, 3 figures

Scientific paper

10.1002/rsa.20185

In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic behaviour of the total power-weighted length of the ONG on uniform random points in (0,1)^d. In particular, for d=1 and weight exponent \alpha>1/2, the limiting distribution of the centred total weight is characterized by a distributional fixed-point equation. As an ancillary result, we give exact expressions for the expectation and variance of the standard nearest-neighbour (directed) graph on uniform random points in the unit interval.

Affiliated with

Also associated with

No associations

Rating

Limit theory for the random on-line nearest-neighbour graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limit theory for the random on-line nearest-neighbour graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limit theory for the random on-line nearest-neighbour graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305930