The Law of the Iterated Logarithm for the Total Length of the Nearest Neighbor Graph

Younghoon Kim (), Sungchul Lee () and Zhengyan Lin ()
Additional contact information
Younghoon Kim: Yonsei University
Sungchul Lee: Yonsei University
Zhengyan Lin: Zhejiang University

Journal of Theoretical Probability, 2004, vol. 17, issue 1, 245-260

Abstract: Abstract Let $$P_n$$ be the Poisson point process with intensity 1 in [−n,n] d . We prove the law of the iterated logarithm for the total length of the nearest neighbor graph on $$P_n$$ .

Keywords: Law of iterated logarithm; geometric probability; nearest neighbor graph (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOTP.0000020483.81884.a2 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:17:y:2004:i:1:d:10.1023_b:jotp.0000020483.81884.a2

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

DOI: 10.1023/B:JOTP.0000020483.81884.a2

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