Advances in Applied Probability

Connectivity of random k-nearest-neighbour graphs

Paul Balister, Béla Bollobás, Amites Sarkar, and Mark Walters

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometric graph Gn,k by joining each point of P to its kk(n) nearest neighbours. Recently, Xue and Kumar proved that if k ≤ 0.074logn then the probability that Gn,k is connected tends to 0 as n → ∞ while, if k ≥ 5.1774logn, then the probability that Gn,k is connected tends to 1 as n → ∞. They conjectured that the threshold for connectivity is k = (1 + o(1))logn. In this paper we improve these lower and upper bounds to 0.3043logn and 0.5139logn, respectively, disproving this conjecture. We also establish lower and upper bounds of 0.7209logn and 0.9967logn for the directed version of this problem. A related question concerns coverage. With Gn,k as above, we surround each vertex by the smallest (closed) disc containing its k nearest neighbours. We prove that if k ≤ 0.7209logn then the probability that these discs cover Sn tends to 0 as n → ∞ while, if k ≥ 0.9967logn, then the probability that the discs cover Sn tends to 1 as n → ∞.

Article information

Source
Adv. in Appl. Probab. Volume 37, Number 1 (2005), 1-24.

Dates
First available in Project Euclid: 13 April 2005

Permanent link to this document
http://projecteuclid.org/euclid.aap/1113402397

Digital Object Identifier
doi:10.1239/aap/1113402397

Zentralblatt MATH identifier
02164615

Mathematical Reviews number (MathSciNet)
MR2135151

Subjects
Primary: 05C80: Random graphs [See also 60B20]
Secondary: 82B43: Percolation [See also 60K35]

Keywords
Random geometric graph connectivity Poisson process

Citation

Balister, Paul; Bollobás, Béla; Sarkar, Amites; Walters, Mark. Connectivity of random k -nearest-neighbour graphs. Advances in Applied Probability 37 (2005), no. 1, 1--24. doi:10.1239/aap/1113402397. http://projecteuclid.org/euclid.aap/1113402397.


Export citation

References

  • Balister, P., Bollobás, B. and Walters, M. (2004). Continuum percolation with steps in the square or the disc. To appear in Random Structures Algorithms.
  • Bollobás, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
  • Bollobás, B. and Leader, I. (1991). Edge-isoperimetric inequalities in the grid. Combinatorica 11, 299--314.
  • Gilbert, E. N. (1961). Random plane networks. J. Soc. Industrial Appl. Math. 9, 533--543.
  • Gonzáles-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.
  • Hajek, B. (1983). Adaptive transmission strategies and routing in mobile radio networks. Proc. Conf. Inf. Sci. Systems 1983, 373--378.
  • Hou, T. and Li, V. (1986). Transmission range control in multihop packet radio networks. IEEE Trans. Commun. 34, 38--44.
  • Kleinrock, L. and Silvester, J. A. (1978). Optimum transmission radii for packet radio networks or why six is a magic number. In Proc. IEEE Nat. Telecommun. Conf. (Birmingham, AL, December 1978), pp. 4.3.1--4.3.5.
  • Mathar, R. and Mattfeldt, R. (1995). Analyzing routing strategy NFP in multihop packet radio network on a line. IEEE Trans. Commun. 43, 977--988.
  • Maudlin, R. D. (ed.) (1979). The Scottish Book. Birkhäuser, Boston, MA.
  • Meester, R. and Roy, R. (1996). Continuum Percolation. Cambridge University Press.
  • Ni, J. and Chandler, S. A. G. (1994). Connectivity properties of a random radio network. In Proc. IEE Commun. 141, 289--296.
  • Penrose, M. D. (1997). The longest edge of the random minimal spanning tree. Ann. Appl. Prob. 7, 340--361.
  • Penrose, M. D. (2003). Random Geometric Graphs. Oxford University Press.
  • Quintanilla, J., Torquato, J. and Ziff, R. M. (2000). Efficient measurement of the percolation threshold for fully penetrable discs. J. Phys. A 33, 399--407.
  • Silvester, J. A. (1980). On the spatial capacity of packet radio networks, Res. Rep. UCLA-ENG-8021, Department of Computer Science, University of California, Los Angeles.
  • Takagi, H. and Kleinrock, L. (1984). Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32, 246--257.
  • Xue, F. and Kumar, P. R. (2004). The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10, 169--181.