Skip to main content Accessibility help
×
Home

Percolation and Connectivity in AB Random Geometric Graphs

  • Srikanth K. Iyer (a1) and D. Yogeshwaran (a2)

Abstract

Given two independent Poisson point processes Φ(1), Φ(2) in , the AB Poisson Boolean model is the graph with the points of Φ(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Φ(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ≥ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and τn in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Percolation and Connectivity in AB Random Geometric Graphs
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Percolation and Connectivity in AB Random Geometric Graphs
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Percolation and Connectivity in AB Random Geometric Graphs
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Mathematics, Indian Institute of Science, Bangalore 560012, India. Email address: skiyer@math.iisc.ernet.in
∗∗ Current address: Faculty of Electrical Engineering, Technion, Israel Institute of Technology, Haifa, 32000, Israel.

Footnotes

Hide All

Research supported in part by UGC SAP-IV and DRDO, grant no. DRDO/PAM/SKI/593.

Supported in part by a grant from EADS, France, Israel Science foundation (grant no. 853/10), and AFOSR (grant no. FA8655-11-1-3039).

Footnotes

References

Hide All
Appel, M. J. and Wierman, J. C. (1987). On the absence of infinite AB percolation clusters in bipartite graphs. J. Phys. A 20, 25272531.
Benjamini, I. and Kesten, H. (1995). Percolation of arbitrary words in 0,1 mN . Ann. Prob. 23, 10241060.
Dousse, O. et al. (2006). Percolation in the signal to interference ratio graph. J. Appl. Prob. 43, 552562.
Franceschetti, M., Dousse, O., Tse, D. N. C. and Thiran, P. (2007). Closing the gap in the capacity of wireless networks via percolation theory. IEEE Trans. Inf. Theory 53, 10091018.
Gilbert, E. N. (1961). Random plane networks. J. Soc. Indust. Appl. Math. 9, 533543.
Goldstein, L. and Penrose, M. D. (2010). Normal approximation for coverage models over binomial point processes. Ann. Appl. Prob. 20, 696721.
Grimmett, G. (1999). Percolation. Springer, Berlin.
Gupta, P. and Kumar, P. R. (2000). The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 388404.
Haenggi, M. (2008). The secrecy graph and some of its properties. In Proc. IEEE Internat. Symp. Inf. Theory (Toronto, 2008).
Hall, P. (1988). Introduction to the Theory of Coverage Processes. John Wiley, New York.
Halley, J. W. (1980). AB percolation on triangular lattice. In Ordering in Two Dimensions, ed. Sinha, S., North-Holland, Amsterdam, pp. 369371.
Halley, J. W. (1983). Polychromatic percolation. In Percolation Structures and Processes, eds Deutscher, G., Zallen, R. and Adler, J., Israel Physical Society, pp. 323351.
Kesten, H., Sidoravicius, V. and Zhang, Y. (1998). Almost all words are seen at critical site percolation on the triangular lattice. Electron. J. Prob. 4, 75pp.
Kesten, H., Sidoravicius, V. and Zhang, Y. (2001). Percolation of arbitrary words on the close-packed graph of Z2 . Electron. J. Prob. 6, 27pp.
Meester, R. and Roy, R. (1996). Continuum Percolation. Cambridge University Press.
Moran, P. A. P. (1973). The random volume of interpenetrating spheres in space. J. Appl. Prob. 10, 483490.
Penrose, M. (2003). Random Geometric Graphs. Oxford University Press.
Pinto, P. C. and Win, M. Z. (2010). Percolation and connectivity in the intrinsically secure communications graph. Preprint. Available at http://arxiv.org/abs/1008.4161v1.
Scheinerman, E. R. and Wierman, J. C. (1987). Infinite AB clusters exist. J. Phys. A 20, 13051307.
Sevšek, F., Debierre, J.-M. and Turban, L. (1983). Antipercolation on Bethe and triangular lattices. J. Phys. A 16, 801810.
Tanemura, H. (1996). Critical behaviour for a continuum percolation model. In Probability Theory and Mathematical Statistics (Tokyo, 1995), eds Watanabe, S. et al., World Scientific, River Edge, NJ, pp. 485495.
Tse, D. and Vishwanath, P. (2005). Fundamentals of Wireless Communication. Cambridge University Press.
Wierman, J. C. and Appel, M. J. (1987). Infinite AB percolation clusters exist on the triangular lattice. J. Phys. A 20, 25332537.
Wu, X.-Y. and Popov, S. Y. (2003). On AB bond percolation on the square lattice and AB site percolation on its line graph. J. Statist. Phys. 110, 443449.

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed