Advances in Applied Probability
- Adv. in Appl. Probab.
- Volume 44, Number 1 (2012), 21-41.
Percolation and connectivity in AB random geometric graphs
Given two independent Poisson point processes Φ(1), Φ(2) in Rd, 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.
Adv. in Appl. Probab., Volume 44, Number 1 (2012), 21-41.
First available in Project Euclid: 8 March 2012
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Iyer, Srikanth K.; Yogeshwaran, D. Percolation and connectivity in AB random geometric graphs. Adv. in Appl. Probab. 44 (2012), no. 1, 21--41. doi:10.1239/aap/1331216643. https://projecteuclid.org/euclid.aap/1331216643