Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold
From MaRDI portal
(Redirected from Publication:388975)
Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold
Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold
Abstract: 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 to the k=k(n) points of the process nearest to it. In this paper we show that if Pr(S_{n,k} connected) > n^{-gamma_1} then the probability that S_{n,k} contains a pair of `small' components `close' to each other is o(n^{-c_1}) (in a precise sense of `small' and 'close'), for some absolute constants gamma_1>0 and c_1 >0. This answers a question of Walters. (A similar result was independently obtained by Balister.) As an application of our result, we show that the distribution of the connected components of S_{n,k} below the connectivity threshold is asymptotically Poisson.
Recommendations
Cited in
(7)- Highly connected random geometric graphs
- Sharpness in the \(k\)-nearest-neighbours random geometric graph model
- Small components in \(k\)-nearest neighbour graphs
- A critical constant for the k nearest-neighbour model
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- The size of components in continuum nearest-neighbor graphs
- On the one dimensional Poisson random geometric graph
This page was built for publication: Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388975)
