We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ℝd. The connectivity function is shown to decay superexponentially, and we identify the exact exponent. From this we also obtain the decay rate of the maximal number of points of a path through the origin. We define the generation number of a point in a component and establish its asymptotic distribution as the dimension d tends to infinity.
Publié le : 2006-03-14
Classification:
Continuum percolation,
Poisson process,
size of components,
nearest-neighbor connections,
random graphs,
60K35,
60G55,
60D05
@article{1147179981,
author = {Kozakova, Iva and Meester, Ronald and Nanda, Seema},
title = {The size of components in continuum nearest-neighbor graphs},
journal = {Ann. Probab.},
volume = {34},
number = {1},
year = {2006},
pages = { 528-538},
language = {en},
url = {http://dml.mathdoc.fr/item/1147179981}
}
Kozakova, Iva; Meester, Ronald; Nanda, Seema. The size of components in continuum nearest-neighbor graphs. Ann. Probab., Tome 34 (2006) no. 1, pp. 528-538. http://gdmltest.u-ga.fr/item/1147179981/