First-Order Laws for Random Geometric Graphs on the Torus

Abstract

Let $G_D(n;r)$ be the random geometric graph generated by $n$ independent uniform points on the $D$-dimensional torus, with adjacency defined by torus $L^{\infty }$-distance at most $r$. We study first-order zero-one and convergence laws at fixed radius and in sparse regimes. At fixed radius, we determine the asymptotics of the expected number of adjacent twin pairs in every dimension. In dimension two, more generally, for each origin-symmetric convex connection body $K\subset (-1/2,1/2{)}^2$, the twin count converges to a Poisson variable with mean $\mathrm{area}(K^{\circ })/16$; hence the zero-one law fails for all fixed $0<r<1/2$ in the $L^{\infty }$ and Euclidean models. At each critical component threshold $n^k{r}_n^{D(k-1)}\to a\in (0,\infty )$, the numbers of components of the feasible connected $k$-vertex types converge jointly to independent Poisson variables, yielding the complete first-order convergence law. Between consecutive thresholds a zero-one law holds. For $D\ge 3$, we also construct a definable common-neighborhood configuration of probability order $1/n$.

30 pages