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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms Jg. 32; H. 2; S. 125 - 156
Hauptverfasser:	Penrose, Mathew D., Wade, Andrew R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2008
Schlagworte:	divide-and-conquer fixed-point equation nearest-neighbor graph spatial network evolution weak convergence
ISSN:	1042-9832, 1098-2418
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!