Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold

Victor Falgas-Ravry

Let S_{n,k} denote the random geometric graph obtained by placing points inside a square of area n according to a Poisson point process of intensity 1 and joining each such point t…