Slack Reactants: A State-Space Truncation Framework to Estimate Quantitative Behavior of the Chemical Master Equation
arXiv:2005.05503 · doi:10.1063/5.0013457
Abstract
State space truncation methods are widely used to approximate solutions of the chemical master equation. While most methods of this kind focus on truncating the state space directly, in this work we propose modifying the underlying chemical reaction network by introducing \emph{slack reactants} that indirectly truncate the state space. More specifically, slack reactants introduce an expanded chemical reaction network and impose a truncation scheme based on user defined properties, such as mass-conservation. This network structure allows us to prove inheritance of special properties of the original model, such as irreducibility and complex balancing. We use the network structure imposed by slack reactants to prove the convergence of the stationary distribution and first arrival times. We then provide examples comparing our method with the stationary finite state projection and finite buffer methods. Our slack reactant system appears to be more robust than some competing methods with respect to calculating first arrival times.
29 pages, 5 Figures
References in corpus (12)
- Antithetic Integral Feedback ensures robust perfect adaptation in noisy biomolecular networks
- A finite state projection algorithm for the stationary solution of the chemical master equation
- First Passage Problems in Biology
- Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
- Accurate Chemical Master Equation Solution Using Multi-Finite Buffers
- First passage times in homogeneous nucleation and self-assembly
- The Computation of the Mean First Passage Times for Markov Chains
- Rare-Event Sampling of Epigenetic Landscapes and Phenotype Transitions
- Dynamical Properties of Discrete Reaction Networks
- Rigorous bounds on the stationary distributions of the chemical master equation via mathematical programming
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- Approximations of countably-infinite linear programs over bounded measure spaces