Skip to content
Preprint

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

Aug 2026 · 0 citations · 33 references
Mathematics Computer Science Biology

TL;DR

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.

Abstract

Stochastic reaction networks are continuous-time Markov chain models for interacting populations, with applications in biochemistry, epidemiology, ecology, and related areas. We study finite-difference sensitivity estimation when a single estimator requires several nearby parameterized paths. Existing variance-reducing couplings are typically pairwise, so that repeated use is either inefficient or requires application-specific choices in multi-path settings. We introduce the multi-path stacked coupling (MSC), a space-time Poisson construction that jointly generates any finite collection of parameterized paths. Each pairwise marginal of MSC has the same law as the corresponding split coupling pair, allowing existing variance bounds to transfer directly; in finite-state settings, we also obtain first-order expansions for the mean and second moment of finite-difference numerators. We apply MSC in three settings of practical importance: estimating many first derivatives simultaneously, estimating a single first derivative using a wider finite-difference stencil, and estimating higher-order derivatives. Numerical experiments on a processive phosphorylation network demonstrate strong performance in each of the three application areas considered, consistent with the theoretical advantages of MSC: across all three applications, MSC achieves the smallest root mean square error (RMSE) among the methods considered over the tested computational budgets.

View source

Similar papers

Open access Aug 2026

Simulation and inference methods for non-Markovian stochastic reaction networks

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...

Thomas P. Steele, D. J. Warne · 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
Preprint Sep 2026

Numerical approximations of population size distributions for multi-type branching processes

Two numerical approximations of population size distributions for multi-type branching processes on directed graphs on directed graphs with arbitrary initialization are introduced and provided computational building blocks for future likelihood-based inference in cancer evolution and other expanding populations.

Xiang-Ge Luo, J. Kuipers, N. Beerenwinkel · 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

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