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

Younghoon Kim, Sung chul 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

Fingerprint

Strong Invariance Principle
Nearest Neighbor Graph
Poisson Point Process
Invariance Principle
Point process
Invariance
Nearest neighbor
Graph

All Science Journal Classification (ASJC) codes

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

Cite this

Kim, Younghoon ; Lee, Sung chul ; Lin, Zhengyan ; Wang, Wensheng. / The invariance principle for the total length of the nearest-neighbor graph. In: Journal of Theoretical Probability. 2005 ; Vol. 18, No. 3. pp. 649-664.
@article{cfe4da66b8e8438c84fa9ae69c584418,
title = "The invariance principle for the total length of the nearest-neighbor graph",
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.",
author = "Younghoon Kim and Lee, {Sung chul} and Zhengyan Lin and Wensheng Wang",
year = "2005",
month = "7",
day = "1",
doi = "10.1007/s10959-005-7253-8",
language = "English",
volume = "18",
pages = "649--664",
journal = "Journal of Theoretical Probability",
issn = "0894-9840",
publisher = "Springer New York",
number = "3",

}

The invariance principle for the total length of the nearest-neighbor graph. / Kim, Younghoon; Lee, Sung chul; Lin, Zhengyan; Wang, Wensheng.

In: Journal of Theoretical Probability, Vol. 18, No. 3, 01.07.2005, p. 649-664.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kim, Younghoon

AU - Lee, Sung chul

AU - Lin, Zhengyan

AU - Wang, Wensheng

PY - 2005/7/1

Y1 - 2005/7/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=25144480438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25144480438&partnerID=8YFLogxK

U2 - 10.1007/s10959-005-7253-8

DO - 10.1007/s10959-005-7253-8

M3 - Article

VL - 18

SP - 649

EP - 664

JO - Journal of Theoretical Probability

JF - Journal of Theoretical Probability

SN - 0894-9840

IS - 3

ER -