The invariance principle for the total length of the nearest-neighbor graph
From MaRDI portal
Publication:2576795
DOI10.1007/s10959-005-7253-8zbMath1098.60035OpenAlexW2013002523MaRDI QIDQ2576795
Sungchul Lee, Young-Hoon Kim, Wen Sheng Wang, Zheng Yan Lin
Publication date: 14 December 2005
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10959-005-7253-8
Functional limit theorems; invariance principles (60F17) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Cites Work
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- On central limit theorems in geometrical probability
- Limit theorems and rates of convergence for Euclidean functionals
- The central limit theorem for Euclidean minimal spanning trees. I
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- The central limit theorem for weighted minimal spanning trees on random points
- The law of the iterated logarithm for the total length of the nearest neighbor graph
- The central limit theorem for Euclidean minimal spanning trees II