Searcharxiv⌕ Search

arXiv · 2611.19032

A Multigrid Finite State Projection Algorithm For The Solution Of The Reaction-Diffusion Master Equation

Abstract

We develop a multigrid method for the finite state projection of the reaction-diffusion master equation (RDME). The RDME evolves the joint probabilities of molecular count configurations across well-mixed voxels coupled by local reactions and diffusive jumps. When fast diffusion or large reaction rates make this evolution stiff over long time horizons, implicit time stepping requires solving a large shifted linear system at every step. Grouping neighboring voxels and summing their molecular counts produces a hierarchy of coarser state spaces terminating at a one-voxel chemical master equation. Restriction sums residual entries with the same coarse counts, while multinomial prolongation preserves the RDME generator form on every level with explicit coarse reaction and diffusion rates. For reversible diffusion, the error omitted by coarsening is bounded by the graph Dirichlet energy of jumps inside the aggregates, with a constant independent of population. Numerical tests with standard multigrid cycles and point or block Gauss-Seidel smoothing reach 7.16 million states and resolve rare probabilities of order $10^{-7}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aditya Dendukuri, Linda Petzold. 2026-11-17. A Multigrid Finite State Projection Algorithm For The Solution Of The Reaction-Diffusion Master Equation. https://searcharxiv.com/abs/2611.19032

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive Finite State Projection with Quantile-Based Pruning for Solving the Chemical Master Equation

We present an adaptive Finite State Projection (FSP) method for efficiently solving the Chemical Master Equation (CME) with rigorous error control. Our approach integrates time-stepping with dynamic state-space truncation, balancing accuracy and computational cost. Krylov subspace methods approximate the matrix exponential, while quantile-based pruning controls state-space growth by removing low-probability states. Theoretical error bounds ensure that the truncation error remains bounded by the pruned mass at each step, which is user-controlled, and does not propagate forward in time. Numerical experiments on biochemical systems, including the Lotka-Volterra and Michaelis-Menten and bi-stable toggle switch models.

cs.CE↗

SoK: Market Microstructure for Decentralized Prediction Markets (DePMs)

Decentralized prediction markets (DePMs) allow open participation in event-based wagering without fully relying on centralized intermediaries. We review the history of DePMs which date back to 2011 and includes hundreds of proposals. Perhaps surprising, modern DePMs like Polymarket deviate materially from earlier designs like Truthcoin and Augur v1. We use our review to present a modular workflow comprising eight stages: underlying infrastructure, market topic, share structure and pricing, market initialization, trading, market resolution, settlement, and archiving. For each module, we enumerate the design variants, analyzing trade-offs around decentralization, expressiveness, and manipulation resistance. We also identify open problems for researchers interested in this ecosystem.

cs.CE↗

Embedding or bridging? AI4Science teams differ more in knowledge recombination than in problem novelty

AI for Science (AI4Science) is reshaping scientific research, yet how the organization of AI-related and domain-scientific work relates to different dimensions of research performance remains poorly understood. We analyze 489,409 AI4Science articles published between 1990 and 2025, identifying seven affiliation-based organizational configurations comprising three forms of embedding and four forms of cross-unit bridging. Focusing on 2006-2025, we examine two dimensions of research performance: knowledge creation, characterized by scientific problem novelty and knowledge-recombination breadth, and research impact, assessed through journal placement and citation impact. We find that organizational configurations differ only modestly in problem novelty but substantially in knowledge-recombination breadth. Cross-unit bridging is consistently associated with broader knowledge recombination, particularly in AI-oriented bridging, without a corresponding advantage in problem novelty. However, greater recombination breadth does not necessarily align with stronger research impact. Science-oriented and Multi-orientation bridging exhibit the most consistent positive associations with JCI Q1 journal placement and citation impact, although neither shows a statistically significant adjusted advantage in publication in the Elite-4 journals (Nature, Science, Cell, and PNAS). These research-impact differences remain largely intact after accounting for problem novelty and recombination breadth. Our findings reveal that organizational configurations are associated with distinct patterns of knowledge creation and research impact, rather than a single hierarchy of research performance. The results highlight the importance of considering organizational arrangements in relation to specific scientific objectives, rather than assuming that any one configuration is universally superior.

cs.CE↗