--- title: One-Dimensional Random Geometric Graphs url: https://www.emergentmind.com/topics/one-dimensional-random-geometric-graphs type: topic --- # One-Dimensional Random Geometric Graphs One-dimensional random geometric graphs are spatial random graphs obtained by placing vertices at random on a line segment or on a circle and connecting pairs whose separation satisfies a prescribed proximity rule. In the hard-threshold model, an edge is present exactly when the distance between two points is at most a radius \(r\); in soft variants, the edge is present with a distance-dependent probability \(H\). Because one dimension converts global connectivity into a problem about ordered gaps while preserving pronounced boundary effects on the interval, the model admits sharp threshold laws, exact formulas for component counts, explicit combinatorial encodings, and analytically tractable rare-event and spectral phenomena [0809.0918] [1008.5140] [2007.06301] [2107.13495]. ## 1. Canonical models and geometric setting The standard binomial one-dimensional hard random geometric graph begins with \(n\) i.i.d. node locations \(X_1,\dots,X_n\sim \mathrm{Uniform}[0,1]\). Two metric choices are classical. On the unit interval, \[ d(x,y)=|x-y|, \] while on the unit circle, \[ d(x,y)=\min\{|x-y|,\,1-|x-y|\}. \] Fixing a range \(r>0\), one joins \(ir\}. \] This interval/circle dichotomy is structurally central, since the circle removes boundary nodes whereas the interval does not [0809.0918]. A second canonical formulation replaces the fixed sample size by a Poisson point process. On \([0,L]\), with intensity \(\lambda>0\), edges are drawn between points \(X_i,X_j\) exactly when \(|X_i-X_j|r\). This gap representation makes one-dimensional component structure particularly explicit [1008.5140]. Soft one-dimensional random geometric graphs keep the spatial input but randomize adjacency conditionally on distance. On \([0,L]\), in either a binomial or Poisson placement, distinct nodes at \(x,y\) are connected independently with probability \(H(|x-y|)\), or on the torus with probability \(H(\rho^L(x,y)/R_L)\), where \(\rho^L\) is circular distance and \(R_L\) is a scale parameter. The hard-threshold graph is recovered by taking \(H(r)=\mathbf{1}_{r\le r_c}\), while examples such as \(H(r)=\exp(-(r/r_c)^\eta)\) interpolate to genuinely soft regimes [2007.06301]. ## 2. Isolated vertices, ordered gaps, and threshold phenomena For the hard model, the absence of isolated vertices has the same first-order threshold on the unit interval and on the unit circle. Writing \[ \ell(r):=\min(1,2r), \] a critical scaling is \[ \ell(r_n)=\frac{\log n+\alpha_n}{n}, \] equivalently \[ r_n=\frac{\log n+\alpha_n}{2n}. \] Then \[ \lim_{n\to\infty}\Pr\{I_n(r_n)=0\} =\begin{cases} 0,&\alpha_n\to-\infty,\\ 1,&\alpha_n\to+\infty. \end{cases} \] At this scale, \(E[I_n]=n(1-\ell(r_n))^{n-1}\), and the interval boundary effect is only \(O(1/n)\)-small, so the same zero-one law holds for \(G^{(L)}\) and \(G^{(C)}\) [0809.0918]. Connectivity on the unit interval is governed by a different obstruction: an ordered gap larger than the connection radius. If \(0\le X_{(1)}\le\cdots\le X_{(n)}\le 1\) and the spacings are \(G_0=X_{(1)}\), \(G_i=X_{(i+1)}-X_{(i)}\), and \(G_n=1-X_{(n)}\), then the graph is connected if and only if \(\max_i G_i\le r\). This yields the exact finite-\(n\) formula \[ \Pr\{\text{connected}\} =\sum_{j=0}^{n+1}(-1)^j\binom{n+1}{j}(1-jr)^n, \] and under the scaling \[ r_n=\frac{\log n+x}{n}, \] one has \[ \Pr\{\text{connected}\}\to \exp(-e^{-x}). \] Thus the connectivity threshold is \[ r_n^*=\frac{\log n}{n}, \] up to \(o(n^{-1})\) corrections [2105.07731]. The interval model therefore exhibits a genuine separation between the radius needed to eliminate isolated vertices and the radius needed for full connectivity. The threshold for no isolated nodes is \[ r_n^{\mathrm{iso}}=\frac{\log n}{2n}, \] whereas the threshold for connectivity is \[ r_n^*=\frac{\log n}{n}. \] For any fixed \(c\in(1/2,1)\), choosing \(r_n=c(\log n)/n\) produces a graph with no isolated nodes with high probability but which is disconnected with high probability. This is the “curious gap” of the one-dimensional interval model, and it contrasts with the asymptotic coincidence of these thresholds in many other random graph models, including higher-dimensional geometric random graphs and Erdős–Rényi graphs [1502.00404]. ## 3. Intersections and multiple adjacency constraints One-dimensional geometry also appears as a component of more complex adjacency rules. A basic model with multiple constraints is the intersection \[ \mathbb{G}(n;r_n,p_n)=G(n;r_n)\cap G(n;p_n), \] where \(G(n;p_n)\) is an independent Erdős–Rényi graph and \(i\sim j\) if and only if both \[ d(X_i,X_j)\le r_n \quad\text{and}\quad B_{ij}(p_n)=1 \] hold. The graph therefore retains the spatial locality of the geometric model but imposes an additional independent Bernoulli gate on each candidate edge [0809.0918]. On the unit circle, the isolated-node threshold remains clean. If \[ p_n\,\ell(r_n)=\frac{\log n+\alpha_n}{n}, \] then \[ \lim_{n\to\infty}\Pr\{I_n(r_n,p_n)=0\} =\begin{cases} 0,&\alpha_n\to-\infty,\\ 1,&\alpha_n\to+\infty, \end{cases} \] so the unique critical scaling is \[ p_n\,\ell(r_n)\sim \frac{\log n}{n}. \] The expected number of isolated vertices takes the form \[ E[I_n]=n\bigl(1-p_n\ell(r_n)\bigr)^{n-1}, \] and first- and second-moment arguments match exactly as in the pure geometric case [0809.0918]. On the unit interval, by contrast, the zero-law and one-law are separated. The zero-law still holds under \[ p_n\,\ell(r_n)=\frac{\log n+\alpha_n}{n}, \qquad \alpha_n\to-\infty, \] but the one-law requires the stronger scaling \[ p_n\,\ell(r_n) =\frac{2(\log n-\log\log n)+\alpha_n'}{n}, \qquad \alpha_n'\to+\infty. \] The source of this gap is an endpoint contribution in \[ E[I_n] =n\,E\bigl[(1-p_n a(X_1;r_n))^{n-1}\bigr], \] which yields an extra term of the form \[ \frac{2}{n\,p_n}\Bigl(1-\tfrac12 p_n\ell(r_n)\Bigr)^n. \] Suppressing that boundary term forces \(p_n\ell(r_n)\gg 2\log n/n\). The discrepancy is therefore a boundary-effect artifact of the first-moment method on the interval, not a change in the second-moment mechanism [0809.0918]. ## 4. Exact component laws in Poisson one-dimensional graphs In the Poisson hard-threshold model on \([0,L]\), connected components can be described as a renewal process. If \(A_i\) and \(E_i\) are the start and end of cluster \(i\), then the cluster length \(B_i=E_i-A_i\) and the inter-cluster gap \(D_i=A_{i+1}-E_i\) satisfy: - the gaps \(D_i\) are IID \(\mathrm{Exp}(\lambda)\), - the busy-period lengths \(B_i\) are IID, - and \(\{B_i,D_i\}\) are mutually independent. The model has a queueing interpretation as an \(M/D/1/1\) queue with preemption, where arrivals form a Poisson process, service times are deterministic of length \(r\), and each new arrival preempts the customer in service. Under this correspondence, each busy period is exactly one graph cluster [1008.5140]. A direct conditioning argument gives the Laplace transform of a busy period \(B\): \[ E[e^{-sB}] = \frac{\lambda+s}{\lambda+s e^{(\lambda+s)\varepsilon}}, \qquad \varepsilon=r. \] If \(\Delta A=B+D\) is the waiting time between consecutive cluster starts, then \[ E[e^{-s\Delta A}] = E[e^{-sB}]\,E[e^{-sD}] = \frac{\lambda}{\lambda+s e^{(\lambda+s)\varepsilon}}. \] This leads to an explicit Laplace transform for the number \(\beta_0(L)\) of complete clusters with start in \([0,L]\), and after inversion one obtains the exact probability mass function \[ P\{\beta_0(L)=n\} = \frac{1}{n!} \sum_{i=0}^{\lfloor L/\varepsilon\rfloor-n} (-1)^i\,i!\, \bigl[(L-(n+i)\varepsilon)\lambda e^{-\lambda\varepsilon}\bigr]^{n+i}. \] The formula is a closed-form law for the number of connected components in the one-dimensional Poisson random geometric graph [1008.5140]. Several limiting regimes are explicit. As \(r\to 0\), every gap exceeds \(r\) almost surely and \(\beta_0(L)\) degenerates to the total point count \(N_L\), recovering the Poisson law \(P(N_L=n)=e^{-\lambda L}(\lambda L)^n/n!\). The same analysis yields factorial moments through Stirling-number expansions. The one-dimensional Poisson case is described as the unique setting in which one obtains an explicit closed-form pmf for the number of connected components; in dimensions \(d\ge 2\), very few exact results are known [1008.5140]. ## 5. Combinatorial structure, path enumeration, and entropy The ensemble of unlabeled one-dimensional hard geometric graphs admits a precise combinatorial description. For \(n\) i.u.d. points on \([0,1]\) and connection range \(r\), let \(S_{n,r}\) denote the set of unlabeled graph structures. Reordering the vertex labels by increasing position produces an ordered graph \(\hat G_{n,r}\); two connected ordered graphs are isomorphic only if one is a left-right reversal of the other. Every ordered graph decomposes uniquely into \(k\) maximal-clique blocks of sizes \(p_1+\cdots+p_k=n\), with \(k\le \lceil 1/r\rceil\). The generating function for ordered graphs coincides with that of Dyck paths of semilength \(n\) and height at most \(h=\lceil 1/r\rceil\), giving \[ A_n(h) = \frac{2^{2n+2}}{h+2} \sum_{i=1}^{\lfloor (h+1)/2\rfloor} \sin^2\!\Bigl(\frac{\pi i}{h+2}\Bigr) \cos^{2n}\!\Bigl(\frac{\pi i}{h+2}\Bigr). \] For fixed \(r\), \[ |S_{n,r}|=\Theta(a(r)^{2n}), \qquad a(r)=2\cos\!\Bigl(\frac{\pi}{\lceil 1/r\rceil+2}\Bigr), \] and therefore \[ H_{\mathrm{str}} \le 2n\log_2 a(r)+O(1). \] A universal encoding based on the left and right endpoints of maximal cliques uses exactly \(2n\) bits and recovers the ordered graph uniquely [2107.13495]. The normalized structural entropy has distinct asymptotic regimes. If \(r_n=O(1/n)\) and \(x=nr_n=O(1)\), then the upper bound is given by a function \(h_U(x)\) involving Kummer’s confluent hypergeometric function, and \(h_U(x)\to 2\) as \(x\to\infty\) with \(x=o(n)\). If \(r_n\gg 1/n\) but \(r_n\to 0\), then \[ \log_2 e < H_{\mathrm{str}}/n < 2. \] If \(r_n=r\in(0,1)\) is fixed, then \[ (1-r)\log_2 e < H_{\mathrm{str}}/n < 2(1-r). \] This places one-dimensional random geometric graphs among the spatial graph families for which combinatorial support growth and entropy can be controlled uniformly in \(n\) and \(r\) [2107.13495]. A complementary exact combinatorial problem concerns the number \(\sigma_k\) of \(k\)-hop paths between two distinguished endpoints. In the hard-threshold model on \([0,1]\), with endpoints fixed at \(0\) and \(1\), the intermediate vertices must lie in a sequence of “lenses” \[ L_j=B(0,jr)\cap B(1,(k-j)r),\qquad j=1,\dots,k-1. \] Conditioned on the number of points in each lens, the count of \(k\)-hop paths is in bijection with the volume under a directed lattice path in a \((k-1)\)-dimensional hyperrectangular lattice, or equivalently with a restricted integer partition. The paper gives a probability generating function and an exact pmf as sums over lattice paths. Low-order cases are explicit: for \(k=2\), \(\sigma_2\) is Poisson with mean \(\lambda(2r-1)\), and for \(k=3\) the conditional p.g.f. is a normalized \(q\)-binomial coefficient. This places one-dimensional RGG path enumeration in direct contact with lattice-path combinatorics [2105.07731]. ## 6. Soft random geometric graphs on the line and torus In the soft model, isolated nodes again organize the main threshold theory, but the asymptotics differ qualitatively from the hard interval case. On the torus of length \(L\), with Poisson intensity \(1\) and connection kernel \(H\), the number \(I\) of isolated nodes satisfies \[ E[I] = L\exp\!\Bigl(-2\int_0^{L/2}H(r)\,dr\Bigr). \] Under the rescaling \[ H^L(r)=H(r/R_L), \qquad R_L=\gamma\ln L, \] with \(R_L/L\to 0\), \[ E[I]\sim L e^{-2R_L\|H\|_1} \] and hence \[ \lim_{L\to\infty}P(I=0) = \begin{cases} 0,&2\gamma\|H\|_1<1,\\ 1,&2\gamma\|H\|_1>1. \end{cases} \] The threshold depends only on the first moment \[ \|H\|_1=\int_0^\infty H(r)\,dr. \] Under the same scaling, \(\mathrm{Var}(I)=O(L)\), and when \(E[I]\to\infty\) the coefficient of variation tends to zero [2007.06301]. A key distinction from the hard interval graph is that uncrossed gaps are asymptotically negligible. If \(H\) is monotone and has unbounded support, then for any fixed \(\gamma>0\), \[ E[\#\text{ uncrossed gaps}]=O(L^{1-\kappa})\qquad \forall\,\kappa>0, \] so \[ P(\text{uncrossed gap occurs})=o(1). \] Consequently the connectivity probability obeys the same sharp transition as the no-isolated-node event: \[ P(\text{connected})\to \begin{cases} 0,&2\gamma\|H\|_1<1,\\ 1,&2\gamma\|H\|_1>1. \end{cases} \] The hard model on the interval behaves oppositely: there, uncrossed gaps are the dominant obstruction to connectivity [2007.06301]. A more refined Poisson approximation is available on the torus of circumference \(L\). With \[ R_L=\frac{\ln(\tau L)}{2\|H\|_1}, \] the number \(N_{\rm iso}\) of isolated vertices converges in total variation to \(\mathrm{Poisson}(1/\tau)\): \[ d_{TV}\!\bigl(N_{\rm iso},\mathrm{Poisson}(1/\tau)\bigr)\to 0, \qquad P\{N_{\rm iso}=0\}\to e^{-1/\tau}. \] Since connectivity implies the absence of isolated nodes, \[ P\{\mathcal G_{h^L}\text{ is connected}\}\le e^{-1/\tau} \] asymptotically. The result is proved under assumptions that \(H\) is bounded and measurable, \(\|H\|_1<\infty\), and \(\|H\|_2^2<\|H\|_1\) [2202.08044]. ## 7. Rare events, simulation, and spectral behavior One-dimensional geometry also enables explicit rare-event calculations for edge counts. On a Poisson point process \(X\) in \([0,w]\) with intensity \(\lambda\), taking \(r=1\), let \[ E:=|G(X\cap[0,w])| \] denote the number of edges. For the rare event \(E=0\), conditioning on the left-most point \(X_1\) yields \[ \Pr\{E=0\mid \mathcal F_1\} = \exp\bigl(-\min\{1,(w-X_1)_+\}\bigr)\, \mathbf 1\!\{G(X^{(1)}\cap[1,w-X_1])=\emptyset\}, \] and iterated conditioning on the recursively defined points \(X_i^*\) gives \[ \Pr\{E=0\mid \mathcal F_*\} = \exp\!\bigl(-((I_*-1)_+ + \min\{1,w-X_*\})\bigr). \] Analogous formulas are derived for \(E\le 1\) and for the number of missing edges \(M_w\) [2007.05965]. These identities lead to conditional Monte Carlo estimators obtained by replacing the indicator \(\mathbf 1\{E\le k\}\) by its conditional expectation given a boundary \(\sigma\)-algebra. By the law of total variance, \[ \mathrm{Var}(E[Y\mid\mathcal F])\le \mathrm{Var}(Y), \] with strict inequality unless \(Y\) is \(\mathcal F\)-measurable. In the reported simulations for \(k=0\), the variance-reduction factor grows from \(\approx 20\) at \(w=5\) to almost \(10^3\) at \(w=10\). The same work interprets exceptionally small edge counts as a global repulsion effect and exceptionally large edge counts as concentrated in a single cell, aligning the one-dimensional problem with heavy-tailed large-deviation heuristics [2007.05965]. Recent work has also examined eigenmode localization in one-dimensional random geometric graphs with periodic boundary conditions. For \(N\) uniform points on \([0,1)\), with edges when \(d(x_i,x_j)\le r\), the expected degree is \[ \langle k\rangle \simeq 2Nr \] for \(r\ll 1\), and one often writes \(z=Nr\) so that \(\langle k\rangle\approx 2z\). For the adjacency matrix, a large fraction of eigenvalues sits at \(\lambda=1\), associated with localized “Type-I orbits.” For the Laplacian, the density of states has a low-energy power law \[ \rho_L(\lambda)\sim \lambda^{-1/2} \qquad (0<\lambda\ll 2z,\ z\ge 2), \] and integer eigenvalues arise from localized orbit modes. The participation ratio \[ PR(\psi)=\frac{1}{\sum_i |\psi_i|^4} \] separates localized from delocalized modes: for Laplacian eigenvectors, \(PR\sim \lambda^{-1}\) as \(\lambda\to 0\) until saturation near \(2N/3\), whereas adjacency-matrix modes show a nonmonotonic dependence on \(\lambda\) and no true mobility edge in the \(N\to\infty\) one-dimensional limit. These results connect one-dimensional RGG spectra to ordered lattices with \(2z\) neighbors and to one-dimensional tight-binding models with disorder [2508.18936]. Source: https://www.emergentmind.com/topics/one-dimensional-random-geometric-graphs