ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Percolation and connectivity in AB random geometric graphs

Iyer, Srikanth K and Yogeshwaran, D (2012) Percolation and connectivity in AB random geometric graphs. In: ADVANCES IN APPLIED PROBABILITY, 44 (1). pp. 21-41.

[img]
Preview
PDF
percolation_and_connectivity_in_ab_random_geometric_graphs.pdf - ["content_typename_completed" not defined]

Download (306Kb) | Preview
Official URL: http://projecteuclid.org/DPubS?verb=Display&versio...

Abstract

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((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 Phi((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 fora 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 tau 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.

Item Type: Journal Article
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Date Deposited: 30 Jul 2012 12:18
Last Modified: 30 Jul 2012 12:18
URI: http://eprints.iisc.ernet.in/id/eprint/44527

Actions (login required)

View Item View Item