Sharpness in the k-nearest-neighbours random geometric graph model

Abstract

Let Sn,k denote the random graph obtained by placing points in a square box of area n according to a Poisson process of intensity 1 and joining each point to its k nearest neighbours. Balister, Bollobás, Sarkar and Walters (2005) conjectured that, for every 0 < ε < 1 and all sufficiently large n, there exists C = C(ε) such that, whenever the probability that Sn,k is connected is at least ε, then the probability that Sn,k+C is connected is at least 1 - ε. In this paper we prove this conjecture. As a corollary, we prove that there exists a constant C' such that, whenever k(n) is a sequence of integers such that the probability Sn,k(n) is connected tends to 1 as n → ∞, then, for any integer sequence s(n) with s(n) = o(logn), the probability Sn,k(n)+⌊C'slog logn is s-connected (i.e. remains connected after the deletion of any s - 1 vertices) tends to 1 as n → ∞. This proves another conjecture given in Balister, Bollobás, Sarkar and Walters (2009).

Article information

Source
Adv. in Appl. Probab., Volume 44, Number 3 (2012), 617-634.

Dates
First available in Project Euclid: 6 September 2012

https://projecteuclid.org/euclid.aap/1346955257

Digital Object Identifier
doi:10.1239/aap/1346955257

Mathematical Reviews number (MathSciNet)
MR3024602

Zentralblatt MATH identifier
1278.60142

Citation

Falgas-Ravry, Victor; Walters, Mark. Sharpness in the k -nearest-neighbours random geometric graph model. Adv. in Appl. Probab. 44 (2012), no. 3, 617--634. doi:10.1239/aap/1346955257. https://projecteuclid.org/euclid.aap/1346955257

References

• Balister, P., Bollobás, B., Sarkar, A. and Walters, M. (2005). Connectivity of random $k$-nearest-neighbour graphs. Adv. Appl. Prob. 37, 1–24.
• Balister, P., Bollobás, B., Sarkar, A. and Walters, M. (2009). A critical constant for the $k$-nearest-neighbour model. Adv. Appl. Prob. 41, 1–12.
• Balister, P., Bollobás, B., Sarkar, A. and Walters, M. (2009). Highly connected random geometric graphs. Discrete Appl. Math. 157, 309–320.
• Gilbert, E. N. (1961). Random plane networks. J. Soc. Indust. Appl. Math. 9, 533–543.
• González-Barrios, J. M. and Quiroz, A. J. (2003). A clustering procedure based on the comparison between the $k$ nearest neighbors graph and the minimal spanning tree. Statist. Prob. Lett. 62, 23–34.
• Penrose, M. D. (1997). The longest edge of the random minimal spanning tree. Ann. Appl. Prob. 7, 340–361.
• Penrose, M. D. (1999). On $k$-connectivity for a geometric random graph. Random Structures Algorithms 15, 145–164.
• Penrose, M. (2003). Random Geometric Graphs (Oxford Stud. Prob. 5). Oxford University Press.
• Walters, M. (2012). Small components in k-nearest neighbour graphs. Discrete Appl. Math. 160, 2037–2047.
• Xue, F. and Kumar, P. R. (2004). The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10, 169–181.