A spatial point process is a probabilistic framework that generates random configurations of points within a spatial domain, where each point represents an event—such as a single cell or an individual mRNA transcript. Unlike complete spatial randomness, these models capture clustering, inhibition, or aggregation patterns driven by underlying biological mechanisms, making them essential for testing hypotheses about tissue organization.
Glossary
Spatial Point Process

What is Spatial Point Process?
A spatial point process is a stochastic model governing the random distribution of points in a defined space, used to analyze the arrangement of cells or mRNA molecules in spatial transcriptomics data.
In spatial transcriptomics, point process models like Poisson cluster processes or Gibbs hard-core processes quantify whether observed cellular distributions deviate from random expectation. They provide rigorous statistical inference for spatially variable genes and ligand-receptor co-localization, enabling researchers to distinguish true biological structure from stochastic noise in spatial neighborhood graphs.
Key Features of Spatial Point Processes
Spatial point processes provide the rigorous statistical foundation for modeling the random distribution of discrete entities—such as individual cells or mRNA molecules—across a tissue landscape. These models distinguish true biological clustering from random chance.
Complete Spatial Randomness (CSR)
The fundamental null hypothesis in spatial point pattern analysis. Under CSR, points are distributed independently and uniformly across the study region, following a homogeneous Poisson process. The intensity λ (expected number of points per unit area) is constant. Rejection of CSR indicates the presence of biological structure—either clustering (aggregation) or regularity (inhibition). CSR is tested using quadrat counts, nearest-neighbor distances, and the empirical Ripley's K function.
Intensity Function Estimation
The first-order property describing the expected density of points at any location. In spatial transcriptomics, intensity maps reveal tissue regions with high cell-type or transcript abundance. Kernel density estimation smooths discrete point locations into a continuous surface, with bandwidth selection controlling the scale of detected features. Log-Gaussian Cox processes model the intensity as a latent random field, capturing overdispersion and spatial heterogeneity in molecular distributions.
Pair Correlation & Ripley's K
Second-order summary statistics that characterize spatial dependence between points. Ripley's K function counts the expected number of additional points within distance r of a typical point, normalized by overall intensity. Its derivative, the pair correlation function g(r), reveals clustering at specific length scales. In tissue analysis, a peak in g(r) at 20-50μm may indicate paracrine signaling between neighboring cells, while a flat profile supports spatial independence.
Marked Point Processes
An extension where each point carries a mark—a categorical or continuous attribute such as cell type, gene expression level, or transcript identity. Marked models test whether marks are spatially correlated beyond chance. Mark connection functions quantify the probability that two points separated by distance r share a specific mark. This enables formal testing of cell-type co-localization and ligand-receptor spatial coupling in tumor microenvironments.
Inhomogeneous & Replicated Patterns
Real tissues exhibit spatially varying intensity due to anatomical structures. Inhomogeneous point process models separate true inter-point interaction from background density gradients. Replicated point patterns—multiple tissue sections or regions of interest—are analyzed using hierarchical models with shared parameters, enabling population-level inference about spatial organization while accounting for biological and technical variability across samples.
Gibbs & Interaction Models
Explicit parametric models for point interactions. Strauss processes penalize point pairs within a critical distance, modeling cellular exclusion or territoriality. Geyer saturation processes allow clustering without the degeneracy issues of simpler attraction models. These models are fit via maximum pseudolikelihood or Bayesian MCMC, yielding interpretable parameters—interaction strength γ and range R—that quantify the nature and scale of spatial organization in tissue architecture.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Frequently Asked Questions
Explore the statistical foundations of spatial point processes and their critical role in analyzing the distribution of cells and molecules in spatial transcriptomics data.
A spatial point process is a stochastic model that generates random configurations of points in a 2D or 3D space, such as the locations of individual cells or mRNA molecules in a tissue section. Unlike a simple random sample, these processes can encode complex spatial dependencies. The fundamental mechanism involves defining an intensity function λ(x), which describes the expected number of points per unit area at location x. For a homogeneous Poisson process, this intensity is constant, representing Complete Spatial Randomness (CSR). More complex processes, like inhomogeneous Poisson processes, allow the intensity to vary with spatial covariates, while cluster processes (e.g., Neyman-Scott) and inhibition processes (e.g., Strauss hard-core) introduce dependence between points, creating aggregated or regular patterns, respectively. These models are fitted to observed point patterns to test hypotheses about the biological mechanisms driving cellular organization.
Related Terms
Core statistical frameworks and computational methods that form the analytical foundation for spatial point process modeling in transcriptomics.
Poisson Point Process
The simplest spatial point process model, where points are distributed independently and uniformly across a study region. It serves as the null model of complete spatial randomness (CSR) against which observed patterns are tested.
Key properties:
- The number of points in any subregion follows a Poisson distribution
- Point locations are independent of each other
- Intensity λ is constant across space (homogeneous)
In practice, biological point patterns rarely follow CSR. Deviations from the Poisson model provide evidence for cell-cell interactions, tissue architecture, or disease-associated spatial reorganization.
Spatial Neighborhood Graph
A data structure where each cell or spot is represented as a node, and edges connect neighboring locations based on spatial proximity. Construction methods include:
- k-nearest neighbors (k-NN): Connect each point to its k closest neighbors
- Distance threshold: Connect all point pairs within radius r
- Delaunay triangulation: Connect points forming a mesh of non-overlapping triangles
These graphs enable graph neural networks and spatial domain detection algorithms to propagate information across tissue topology, capturing local microenvironment relationships that point process intensities alone cannot describe.
Spatial Permutation Test
A non-parametric statistical method for assessing the significance of observed spatial patterns by generating a null distribution through random shuffling of spatial labels.
Procedure:
- Compute an observed spatial statistic (e.g., Moran's I, Ripley's K)
- Randomly permute the spatial coordinates or cell-type labels n times
- Recalculate the statistic for each permutation
- Compare the observed value against the empirical null distribution
This approach avoids parametric assumptions about the underlying spatial process and is widely used to identify spatially variable genes and test for cell-type co-localization in tissue sections.
Spatial Deconvolution
A computational process that estimates the cell-type proportions within each spatial transcriptomics spot by separating the mixed gene expression signal into its constituent parts.
Approaches include:
- Regression-based methods: Use reference single-cell signatures to fit proportions
- Probabilistic models: Apply Bayesian frameworks with spatial priors
- Deep learning: Train neural networks to map mixture profiles to cell-type compositions
Spatial deconvolution transforms coarse spot-level data into cell-type-resolved maps, enabling point process analysis of specific cell populations even when single-cell resolution is not experimentally achievable.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us