The law of the iterated logarithm for the total length of the nearest neighbor graph

Younghoon Kim, Sungchul Lee, Zhengyan Lin

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Let script P signn 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 script P signn.

Original languageEnglish
Pages (from-to)245-260
Number of pages16
JournalJournal of Theoretical Probability
Volume17
Issue number1
DOIs
Publication statusPublished - 2004 Jan

Bibliographical note

Funding Information:
The work of S.L. was supported by the BK21 project of the Department of Mathematics, Yonsei University, the interdisciplinary research program of KOSEF 1999-2-103-001-5 and Com2MaC in POSTECH. The work of Z.L. was supported by NSFC (10131040), SRFDP (2002335090), and KRF (D00008).

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'The law of the iterated logarithm for the total length of the nearest neighbor graph'. Together they form a unique fingerprint.

Cite this