The random connection model: Connectivity, edge lengths, and degree distributions

• Published in: Random structures & algorithms Vol. 52; no. 2; pp. 283 - 300
• Main Author: Iyer, Srikanth K.
• Format: Journal Article
• Language: English
• Published: Hoboken Wiley Subscription Services, Inc 01.03.2018
• Subjects: connectivity; degree distribution; Graph theory; isolated nodes; random connection model; random geometric graphs
• ISSN: 1042-9832; 1098-2418
• DOI: 10.1002/rsa.20741

Consider the random graph G(Pn,r) whose vertex set Pn is a Poisson point process of intensity n on (−12,12]d, d ≥ 2. Any two vertices Xi,Xj∈Pn are connected by an edge with probability g(d(Xi,Xj)r), independently of all other edges, and independent of the other points of Pn. d is the toroidal metric, r > 0 and g:[0,∞)→[0,1] is non‐increasing and α=∫ℝdg(|x|)dx<∞. Under suitable conditions on g, almost surely, the critical parameter Mn for which G(Pn,·) does not have any isolated nodes satisfies lim⁡n→∞αnMndlog⁡n=1. Let β=inf⁡{x>0:xg(αxθ)>1}, and θ be the volume of the unit ball in ℝd. Then for all γ>β, G(Pn,(γlog⁡nαn)1d) is connected with probability approaching one as n→∞. The bound can be seen to be tight for the usual random geometric graph obtained by setting g=1[0,1]. We also prove some useful results on the asymptotic behavior of the length of the edges and the degree distribution in the connectivity regime. The results in this paper work for connection functions g that are not necessarily compactly supported but satisfy g(r)=o(r−c).