Skip to content
Open access

Simulation and inference methods for non-Markovian stochastic reaction networks

Aug 2026 · PLoS Computational Biology · Vol 22, pp. e1014687 · 0 citations · 88 references
Medicine

TL;DR

This work develops efficient stochastic simulation algorithms for well-mixed non-Markovian stochastic reaction networks with stochastic delays that depend on system state and time and introduces a coupling scheme to generate exact non-Markovian sample paths that are positively correlated to an approximate non-Markovian τ-leaping sample path.

Abstract

Stochastic models of reaction networks are widely used to capture intrinsic noise in complex systems in the life sciences. Typical formulations of these models are based on Markov processes for which there is extensive research on efficient simulation and inference. However, there are complex processes in biology, such as gene transcription and translation, that introduce history dependent dynamics requiring non-Markovian processes to accurately capture the stochastic dynamics of the system. This greater realism comes with additional computational challenges for simulation and parameter inference. We develop efficient stochastic simulation algorithms for well-mixed non-Markovian stochastic reaction networks with stochastic delays that depend on system state and time. Our methods generalize the next reaction method and τ-leaping method to support arbitrary inter-event time distributions while preserving computational scalability. We also introduce a coupling scheme to generate exact non-Markovian sample paths that are positively correlated to an approximate non-Markovian τ-leaping sample path. This enables substantial computational gains for simulation and Bayesian inference through multilevel Monte Carlo and multifidelity schemes. We demonstrate the effectiveness of our approach using several non-Markovian examples, showing substantial gains in both simulation accuracy and inference efficiency. These results extend the practical applicability of non-Markovian models in systems biology and beyond.

Read PDF

Similar papers

Open access Sep 2026

Gillespie-based simulation and inference for non-Markovian stochastic reaction networks

Abstract Discrete stochastic processes are widespread across physics, chemistry, ecology, and beyond. In computational biology and epidemiology, however, most simulators still assume Markovian kinetics with memoryless dynamics, despite growing evidence for history-dependent effects in gene regulation, RNA transcription...

A. Pélissier, Miroslav Phan, N. Beerenwinkel et al. · 0 citations
Preprint Aug 2026

Data-driven Effective Modeling of Stochastic Chemical Reaction Networks

The Stochastic Simulation Algorithm (SSA), widely considered an exact algorithm for stochastic chemical reaction networks, suffers from high computational cost. In this work, we propose a data-driven effective model that operates on a user-defined coarse time step independent of the underlying microscopic reaction-even...

Yuan Chen, Weize Mao, Dong-Bin Xiu · 0 citations
Preprint Aug 2026

Rare-event sampling for stochastic dynamics in network systems using cluster updates

A novel technique called conditional-path Monte Carlo (CPMC), inspired by loop algorithms from equilibrium condensed-matter physics, which generates a Markov chain of trajectories that all strictly respect the targeted macroscopic boundary conditions like the occurrence of a massive network failure.

Jiazheng Sun, James Moody, Thomas Barthel · 1 citation
Preprint Aug 2026

A general-purpose sensitivity method for multiple simultaneous parameter perturbations in stochastic reaction networks

This work introduces the multi-path stacked coupling (MSC), a space-time Poisson construction that jointly generates any finite collection of parameterized paths and achieves the smallest root mean square error among the methods considered over the tested computational budgets.

David F. Anderson, Jingyi Ma · 0 citations
Preprint Aug 2026

Conditional-path Monte Carlo for rare stochastic dynamics on networks: Details and derivations

This paper provides the rigorous mathematical foundations and algorithmic details underlying the CPMC framework, and details a dynamic programming scheme to exactly implement complex boundary conditions - including patient-zero and macroscopic outbreak-size constraints - enabling the rejection-free generation of valid...

Thomas Barthel, Jiazheng Sun, Jhao-Hong Peng · 1 citation
#machine learning Preprint Aug 2026

Propensity Straight-Through Gradients for Discrete Stochastic Systems

This work exploits the affine state update to obtain the exact one-step conditional-mean sensitivity by differentiating normalized reaction propensities, and defines the propensity straight-through (PST) estimator, a temperature- and Gumbel-free path to scalable gradient-based learning through exact stochastic trajecto...

Jose M. G. Vilar, Leonor Saiz · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.