Soft Geometric Block Model (SGBM)

• SGBM is a latent-space random graph model where each vertex carries both a community label and a geometric position, with edge probabilities defined by soft within- and between-community kernels.
• It extends the classic geometric block model by using continuous kernels instead of hard thresholds, enabling nuanced community recovery in dense and sparse regimes.
• Spectral clustering in SGBM leverages a (k-1)-dimensional informative eigenspace and motif analysis to achieve reliable community detection under varying edge densities.

The soft geometric block model (SGBM) is a latent-space random graph model in which each vertex carries both a community label and a geometric position, and edges are generated as conditionally independent Bernoulli variables whose probabilities depend jointly on geometry and community relation. In the formulation studied explicitly under the name SGBM, the latent space is the $d$-dimensional flat torus $\mathbf T^d$, the positions $X_1,\dots,X_n$ are i.i.d. uniform, and the edge rule is governed by a within-community kernel $F_{in}$ and a between-community kernel $F_{out}$; the hard geometric block model (GBM) is recovered when these kernels become indicators of geometric proximity (Allem et al., 27 Jul 2025).

1. Formal definition and modeling variants

In the homogeneous-community SGBM studied for multi-community recovery, there are $n$ vertices, a fixed number $k\ge 2$ of communities, equal community sizes $n/k$, latent labels $\sigma_i\in[k]$, and latent positions $X_i\in \mathbf T^d$. Conditional on $\mathbf T^d$0, edges are independent and satisfy

$\mathbf T^d$1

with

$\mathbf T^d$2

The associated mean edge densities are

$\mathbf T^d$3

and the main dense-regime results assume $\mathbf T^d$4 (Allem et al., 27 Jul 2025).

A closely related but distinct soft-kernel formulation appears in exact-recovery work on the geometric SBM. There, vertices lie in a $\mathbf T^d$5-dimensional torus obtained from a cube of volume $\mathbf T^d$6, locations are sampled from a Poisson point process of intensity $\mathbf T^d$7, and conditioned on positions and labels, edges are independent with probabilities $\mathbf T^d$8 or $\mathbf T^d$9 evaluated at rescaled distance. The model allows arbitrary distance-dependent edge functions inside a finite visibility radius $X_1,\dots,X_n$0, with

$X_1,\dots,X_n$1

This is soft within the visibility radius, but still imposes compact support, so it is not a fully long-range SGBM (Gaudio et al., 28 Dec 2025).

The literature also contains a graphon-based near-match rather than a strictly distance-based SGBM. The stochastic block smooth graphon model assigns each node a block label $X_1,\dots,X_n$2 and a continuous latent coordinate $X_1,\dots,X_n$3, then uses

$X_1,\dots,X_n$4

This combines discrete blocks with continuous latent coordinates, but $X_1,\dots,X_n$5 is an arbitrary smooth bivariate function rather than a function of distance alone (Sischka et al., 2022).

2. Relation to GBM, SBM, and block-smooth graphon models

The conceptual precursor of SGBM is the geometric block model introduced as a geometric analogue of the stochastic block model. In the GBM, vertices have latent positions on a sphere or circle, and an edge exists if and only if a block-dependent similarity threshold is exceeded. In the one-dimensional circular representation,

$X_1,\dots,X_n$6

so conditional on latent positions and labels, the edge probability is in $X_1,\dots,X_n$7. The natural soft generalization replaces the indicator by a decreasing link function such as

$X_1,\dots,X_n$8

which is precisely the distinction emphasized in later work (Galhotra et al., 2017).

Model	Latent structure	Edge rule
GBM	community label + geometric position	hard threshold
SGBM	community label + geometric position	Bernoulli with $X_1,\dots,X_n$9
SBSGM	block label + continuous coordinate	Bernoulli with $F_{in}$0
Compactly supported soft-kernel GSBM	label + position, finite visibility radius	Bernoulli with $F_{in}$1

Relative to the classical SBM, the decisive structural difference is that geometry induces dependence and transitivity. In the SBM, edges are conditionally independent given labels. In the GBM, and plausibly in SGBM as well, if $F_{in}$2 is close to $F_{in}$3 and $F_{in}$4 is close to $F_{in}$5, then $F_{in}$6 is more likely to be close to $F_{in}$7; motif counts therefore carry direct geometric information (Galhotra et al., 2017). The graphon-based SBSGM is softer than SBM in a different sense: it allows continuous within-block heterogeneity, but it does not require connection probability to be a function of $F_{in}$8 or any other metric distance. A common conflation is therefore between soft geometric models and soft block-smooth graphon models; the latter are close in spirit, but they are not necessarily metric-based (Sischka et al., 2022).

3. Spectral theory and community recovery in the dense regime

The main explicit SGBM recovery theory currently available concerns the dense regime with fixed $F_{in}$9. The central deterministic object is the block-constant matrix

$F_{out}$0

denoted $F_{out}$1. Its informative eigenvalue is

$F_{out}$2

and this eigenvalue has multiplicity $F_{out}$3. Consequently, the community signal is encoded not in a single eigenvector but in a $F_{out}$4-dimensional eigenspace (Allem et al., 27 Jul 2025).

The resulting spectral clustering algorithm is correspondingly nonstandard. Rather than taking the top $F_{out}$5 eigenvectors of the adjacency matrix $F_{out}$6, it selects the $F_{out}$7 eigenvectors associated with the $F_{out}$8 eigenvalues of $F_{out}$9 closest to $n$0, embeds the vertices into $n$1 using the corresponding rows, and then applies $n$2-means. The asymptotic justification comes from a limiting spectral analysis in which the empirical spectrum of $n$3 converges to a measure supported on two Fourier-defined branches,

$n$4

the second branch having multiplicity $n$5. At $n$6, the second branch yields exactly $n$7, which explains the target location $n$8 in the spectrum (Allem et al., 27 Jul 2025).

Under the technical conditions

$n$9

and

$k\ge 2$0

there are asymptotically almost surely exactly $k\ge 2$1 eigenvalues near $k\ge 2$2, while every other eigenvalue stays at distance at least $k\ge 2$3. The corresponding $k\ge 2$4-means estimator is weakly consistent with

$k\ge 2$5

and a simple local refinement—relabeling each node by the majority label among its neighbors—upgrades the result to strong consistency, yielding exact recovery asymptotically almost surely (Allem et al., 27 Jul 2025).

A major technical point is that the informative eigenvalue is not simple when $k\ge 2$6. The analysis therefore uses a non-standard Davis–Kahan argument to control eigenspace perturbations rather than individual eigenvector perturbations. This is one of the distinctive methodological contributions of the dense-regime SGBM theory (Allem et al., 27 Jul 2025).

4. Exact recovery with soft kernels in logarithmic-degree regimes

Exact-recovery results in sparse regimes currently come from models that are soft in the kernel but not fully general in range. In the compactly supported soft-kernel GSBM, the decisive quantity is

$k\ge 2$7

The paper proves that exact recovery is achievable by a polynomial-time algorithm when $k\ge 2$8 for $k\ge 2$9, and when both $n/k$0 and $n/k$1 for $n/k$2. Conversely, exact recovery is impossible when $n/k$3, and also impossible in one dimension when $n/k$4 (Gaudio et al., 28 Dec 2025).

This threshold is a distance-averaged Chernoff–Hellinger divergence. The same work explicitly presents the model as a substantial move toward a soft geometric block model, but still with one hard geometric feature: compact support of the kernels. A plausible implication is that the integrated divergence $n/k$5 is the natural exact-recovery functional for broader soft geometric models as well, although that general statement is not proved there (Gaudio et al., 28 Dec 2025).

The hard-radius step-function limit had already been solved in a related model with known positions, Poisson points in $n/k$6, and conditional edge probabilities $n/k$7 or $n/k$8 inside radius $n/k$9. There the exact threshold is

$\sigma_i\in[k]$0

for $\sigma_i\in[k]$1, with the additional requirement $\sigma_i\in[k]$2 in $\sigma_i\in[k]$3, and there is an $\sigma_i\in[k]$4 algorithm based on a coarse local labeling followed by a Poisson testing refinement (Gaudio et al., 2023). This identifies the hard-threshold limit that the compactly supported soft-kernel theory generalizes.

5. Motifs, transitivity, and active learning

The distinctive algorithmic appeal of geometric models lies in transitivity-driven motifs. In the original GBM, if $\sigma_i\in[k]$5 and $\sigma_i\in[k]$6 are in the same cluster and geographically close, then the number of common neighbors

$\sigma_i\in[k]$7

is typically larger than for a cross-cluster edge. The technical reason is that, after conditioning on the latent distance $\sigma_i\in[k]$8, the common-neighbor events become independent across third vertices, and the overlap of two geometric neighborhoods has explicit length in one dimension, such as $\sigma_i\in[k]$9, $X_i\in \mathbf T^d$0, or $X_i\in \mathbf T^d$1 (Galhotra et al., 2017).

This hard-threshold analysis does not transfer verbatim to SGBM, because overlap lengths become kernel integrals rather than interval lengths. Even so, the same papers argue that the triangle-counting rationale is conceptually portable to a soft variant: nearby same-community pairs should still create excess common neighbors whenever within-community kernels dominate between-community kernels (Galhotra et al., 2017). This is one reason that hard GBM is repeatedly treated as the foundational baseline for SGBM.

Active learning strengthens this picture. In the hard-threshold GBM, two algorithms combine motif-based edge pruning with adaptive node-label queries and achieve exact recovery using a vanishingly small fraction of queried labels in parameter regimes where the state-of-the-art unsupervised method fails. The query complexities proved are $X_i\in \mathbf T^d$2 for one algorithm and $X_i\in \mathbf T^d$3 for the second. These results are formal only for the hard model, but the two-phase architecture—motif denoising followed by targeted supervision—has been presented as a natural baseline for SGBM-style extensions (Chien et al., 2019).

6. Scope, limitations, and unresolved directions

The SGBM literature remains methodologically heterogeneous. The multi-community spectral theory is dense-regime theory with fixed $X_i\in \mathbf T^d$4, equal community sizes, and an algorithm that assumes $X_i\in \mathbf T^d$5, $X_i\in \mathbf T^d$6, and $X_i\in \mathbf T^d$7 are known; no parameter-estimation procedure is developed there (Allem et al., 27 Jul 2025). The sparse exact-recovery theory for soft kernels is presently available only under compact support, with additional assumptions that the kernels are bounded away from $X_i\in \mathbf T^d$8 and $X_i\in \mathbf T^d$9 on their support and that the crossing set $\mathbf T^d$00 is finite and quantitatively isolated (Gaudio et al., 28 Dec 2025).

A second persistent limitation is that much of the foundational theory concerns hard-threshold GBM rather than SGBM proper. The original triangle-counting theorems, the active-learning results, and several exact-recovery constructions all rely on deterministic visibility regions, exact neighborhood-overlap formulas, or known threshold parameters. Those arguments clarify what geometry contributes, but they do not by themselves solve the fully soft case (Galhotra et al., 2017).

A third issue is terminological. In the block-smooth graphon literature, softness refers to continuous within-block heterogeneity, not to overlapping memberships. Membership remains hard—each node belongs to one block—while the edge probability varies smoothly with latent coordinates. That model is therefore relevant to SGBM, but not identical to a distance-kernel geometric model (Sischka et al., 2022).

Taken together, the current literature supports a coherent but still incomplete picture. SGBM is most cleanly understood as the soft counterpart of the geometric block model: a community model with latent geometry, block-dependent connection laws, and edge dependence driven by spatial proximity. Dense-regime recovery is now available through eigenspace methods tailored to the informative spectral window (Allem et al., 27 Jul 2025); sparse exact recovery is understood for compactly supported soft kernels through an integrated Chernoff–Hellinger threshold (Gaudio et al., 28 Dec 2025); and the hard-threshold GBM continues to serve as the analytically tractable reference case for motifs, active learning, and transitivity-based community detection (Galhotra et al., 2017).