Connecting the Random Connection Model

MaRDI QIDQ6266548zbMATH OpenFDO

Authors Srikanth K. Iyer

Publication date 19 October 2015

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Trees (05C05) Geometric probability and stochastic geometry (60D05) Combinatorial optimization (90C27)

Abstract: Consider the random graph $G({mathcalP}_n,r)$ whose vertex set ${mathcalP}_n$ is a Poisson point process of intensity $n$ on $(-frac12,frac12{]}^d$, $dgeq2$. Any two vertices $X_i,X_{j}in{mathcalP}_n$ are connected by an edge with probability $gleft(fracd(X_i,X_j)right)$, independently of all other edges, and independent of the other points of ${mathcalP}_n$. $d$ is the toroidal metric, $r>0$ and $g:[0,infty)o[0,1]$ is non-increasing and $alpha=in{t}_{mathbb{R}^d}g(|x|)dx<infty$. Under suitable conditions on $g$, almost surely, the critical parameter $d_n$ for which $G({mathcalP}_n,cdot)$ does not have any isolated nodes satisfies $li{m}_{noinfty}fracalphan{d}_n^{d}logn=1$. Let $$, and $heta$ be the volume of the unit ball in $mathbb{R}^d$. Then for all $$, $Gleft({mathcalP}_n,left(fracgammalognalphanight{)}^{frac1d}ight)$ is connected with probability approaching one as $noinfty$. 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 behaviour of the length of the edges and the degree distribution in the {it connectivity regime}.

This page was built for publication: Connecting the Random Connection Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6266548)