The invariance principle for the total length of the nearest-neighbor graph

Younghoon Kim, Sungchul Lee, Zhengyan Lin, Wensheng Wang

Research output: Contribution to journalArticle

Abstract

Let P be the Poisson point process with intensity 1 in R d and let Pn be P∩[-n/2,n/2]d. We obtain a strong invariance principle for the total length of the nearest-neighbor graph on Pn.

Original languageEnglish
Pages (from-to)649-664
Number of pages16
JournalJournal of Theoretical Probability
Volume18
Issue number3
DOIs
Publication statusPublished - 2005 Jul 1

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'The invariance principle for the total length of the nearest-neighbor graph'. Together they form a unique fingerprint.

  • Cite this