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

Younghoon Kim, Sung chul Lee, Zhengyan Lin

Research output: Contribution to journalArticle

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 1

Fingerprint

Nearest Neighbor Graph
Poisson Point Process
Law of the Iterated Logarithm
Graph
Nearest neighbor
Point process

All Science Journal Classification (ASJC) codes

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

Cite this

@article{2ceb4328c4454b77b1e3e1c8035ee411,
title = "The law of the iterated logarithm for the total length of the nearest neighbor graph",
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.",
author = "Younghoon Kim and Lee, {Sung chul} and Zhengyan Lin",
year = "2004",
month = "1",
day = "1",
doi = "10.1023/B:JOTP.0000020483.81884.a2",
language = "English",
volume = "17",
pages = "245--260",
journal = "Journal of Theoretical Probability",
issn = "0894-9840",
publisher = "Springer New York",
number = "1",

}

The law of the iterated logarithm for the total length of the nearest neighbor graph. / Kim, Younghoon; Lee, Sung chul; Lin, Zhengyan.

In: Journal of Theoretical Probability, Vol. 17, No. 1, 01.01.2004, p. 245-260.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kim, Younghoon

AU - Lee, Sung chul

AU - Lin, Zhengyan

PY - 2004/1/1

Y1 - 2004/1/1

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

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

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

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

U2 - 10.1023/B:JOTP.0000020483.81884.a2

DO - 10.1023/B:JOTP.0000020483.81884.a2

M3 - Article

VL - 17

SP - 245

EP - 260

JO - Journal of Theoretical Probability

JF - Journal of Theoretical Probability

SN - 0894-9840

IS - 1

ER -