The size of components in continuum nearest-neighbor graphs

I. Kozakova, R.W.J. Meester, S. Nanda

Research output: Contribution to JournalArticleAcademicpeer-review

180 Downloads (Pure)

Abstract

We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ℝ
Original languageEnglish
Pages (from-to)528-538
Number of pages11
JournalAnnals of probability
Volume34
Issue number2
DOIs
Publication statusPublished - 2006

Bibliographical note

MR2223950

Fingerprint

Dive into the research topics of 'The size of components in continuum nearest-neighbor graphs'. Together they form a unique fingerprint.

Cite this