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

In the on‐line nearest‐neighbor graph (ONG), each point after the first in a sequence of points in ℝd is joined by an edge to its nearest neighbor amongst those points that precede it in the sequence. We study the large‐sample asymptotic behavior of the total power‐weighted length of the ONG on unif...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 32; no. 2; pp. 125 - 156
Main Authors:	Penrose, Mathew D., Wade, Andrew R.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2008
Subjects:	divide-and-conquer fixed-point equation nearest-neighbor graph spatial network evolution weak convergence
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!