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

Younghoon Kim; Sungchul Lee; Zhengyan Lin

doi:10.1023/B:JOTP.0000020483.81884.a2

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

Younghoon Kim, Sungchul Lee, Zhengyan Lin

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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

Original language	English
Pages (from-to)	245-260
Number of pages	16
Journal	Journal of Theoretical Probability
Volume	17
Issue number	1
DOIs	https://doi.org/10.1023/B:JOTP.0000020483.81884.a2
Publication status	Published - 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

Access to Document

10.1023/B:JOTP.0000020483.81884.a2

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 Sungchul Lee and Zhengyan Lin",

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).",

year = "2004",

month = jan,

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",

}

TY - JOUR

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

AU - Kim, Younghoon

AU - Lee, Sungchul

AU - Lin, Zhengyan

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

PY - 2004/1

Y1 - 2004/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

AN - SCOPUS:4043118398

SN - 0894-9840

VL - 17

SP - 245

EP - 260

JO - Journal of Theoretical Probability

JF - Journal of Theoretical Probability

IS - 1

ER -

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

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this