On the consistent and scalable detection of spatial patterns
Jiayu Su, Jun Hou Fung, Haoyu Wang, Dian Yang, David A. Knowles, Raul Rabadan
TL;DR
The study addresses the inconsistent and computationally bottlenecked landscape of spatial-pattern detection in spatial omics. It unifies major approaches into a single quadratic-form framework $Q_n = \mathbf{z}^\top \mathbf{K} \mathbf{z}$ and analyzes when such tests are consistent, showing that they are capable only of detecting mean shifts unless the kernel is strictly definite. By adopting a CAR-based kernel $\mathbf{K} = (\mathbf{I} - \rho \tilde{\mathbf{W}})^{-1}$, the authors ensure a positive spectrum and universal consistency, while introducing scalable implementations (sparse solvers with Hutchinson trace estimation and FFT-based kernels) to handle millions of locations. They extend the framework to the bivariate case for co-expression and demonstrate, through simulations and real data (Visium HD and tumor lineage datasets), that Moran's I suffers from spectral cancellation and Moran-based methods can miss true patterns that CAR-based Q-tests detect. The work provides a principled, scalable foundation for reliable spatial pattern detection with broad applicability in spatial omics and single-cell lineage tracing.
Abstract
Detecting spatial patterns is fundamental to scientific discovery, yet current methods lack statistical consensus and face computational barriers when applied to large-scale spatial omics datasets. We unify major approaches through a single quadratic form and derive general consistency conditions. We reveal that several widely used methods, including Moran's I, are inconsistent, and propose scalable corrections. The resulting test enables robust pattern detection across millions of spatial locations and single-cell lineage-tracing datasets.
