The Invariance Principle for the Total Length of the Nearest-Neighbor Graph

Younghoon Kim, Sungchul Lee, Zhengyan Lin and Wensheng Wang ()
Additional contact information
Younghoon Kim: Yonsei University
Sungchul Lee: Yonsei University
Zhengyan Lin: Zhejing University
Wensheng Wang: East China Normal University

Journal of Theoretical Probability, 2005, vol. 18, issue 3, 649-664

Abstract: Let $${\cal P}$$ be the Poisson point process with intensity 1 in R d and let $${\cal P}_n$$ be $${\cal P} \cap [-n/2,n/2]^d$$ . We obtain a strong invariance principle for the total length of the nearest-neighbor graph on $${\cal P}_n$$ .

Keywords: Invariance principle; geometric probability; nearest-neighbor graph (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10959-005-7253-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:18:y:2005:i:3:d:10.1007_s10959-005-7253-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1007/s10959-005-7253-8

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().