The Invariance Principle for the Total Length of the Nearest-Neighbor Graph期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

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

Authors:	Younghoon?Kim Sungchul?Lee Zhengyan?Lin Email author" target="_blank">Wensheng?Wang Email author

Institution:	(1) Department of Mathematics, Yonsei University, Seoul, 120-749, Korea;(2) Department of Mathematics, Zhejing University, Hangzhou, 310028, China;(3) Department of Statistics, East China Normal University, Shanghai, 200062, China

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
本文献已被 SpringerLink 等数据库收录！