Percolation and Connectivity in AB Random Geometric Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2009

Percolation and Connectivity in AB Random Geometric Graphs

D. Yogeshwaran
  • Fonction : Auteur
  • PersonId : 849793

Résumé

Given two independent Poisson point processes Phi(1),Phi(2) in Rd the AB Poisson Boolean model is the graph with points of Phi(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred 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 > 1$ 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 cn 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 neighbour distance and almost sure asymptotic bounds for the connectivity threshold.
Fichier principal
Vignette du fichier
AB-RGG-revision1_final.pdf (256.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00372331 , version 1 (01-04-2009)
inria-00372331 , version 2 (02-04-2009)
inria-00372331 , version 3 (23-01-2010)

Identifiants

  • HAL Id : inria-00372331 , version 3
  • ARXIV : 0904.0223

Citer

Srikanth K. Iyer, D. Yogeshwaran. Percolation and Connectivity in AB Random Geometric Graphs. [Research Report] 2009. ⟨inria-00372331v3⟩
112 Consultations
312 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More