Nonuniform random geometric graphs with location-dependent radii (Q691113)

In this present paper the authors study asymptotic properties related to connectivity of random geometric graphs where the underlying distribution of the vertices may not be uniform. They assume that this distribution follows a Poisson point process with intensity function \(nf\), where \(n\in\mathbb{N}\) and \(f\) is a probability density function on \(\mathbb{R}^d\). A vertex located at \(x\) connects via directed edges to other vertices that are within cut-off distance \(r_n(x)\). The departure from usual random geometric graph models is presented by the specification of the cut-off function \(r_n(x)\) as a solution of the equation \[ \int_{B(x,r_n(x))} f(y)dy=c(\log{n})/n, n\in\mathbb{N}, \] where \(x\) is a point belonging to the support of \(f\), \(B(x,r_n(x))\) is the open ball of radius \(r_n\) centered at \(x\) and \(c>0\) is fixed constant. The authors describe their main results as follows. From the authors' abstract: ``We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large \(n\) and (ii) the maximum and the minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.''