title: A multi-time-scale analysis of chemical reaction networks: II. Stochastic systems.
abstract: We consider stochastic descriptions of chemical reaction networks in which there are both fast and slow reactions, and for which the time scales are widely separated. We develop a computational algorithm that produces the generator of the full chemical master equation for arbitrary systems, and show how to obtain a reduced equation that governs the evolution on the slow time scale. This is done by applying a state space decomposition to the full equation that leads to the reduced dynamics in terms of certain projections and the invariant distributions of the fast system. The rates or propensities of the reduced system are shown to be the rates of the slow reactions conditioned on the expectations of fast steps. We also show that the generator of the reduced system is a Markov generator, and we present an efficient stochastic simulation algorithm for the slow time scale dynamics. We illustrate the numerical accuracy of the approximation by simulating several examples. Graph-theoretic techniques are used throughout to describe the structure of the reaction network and the state-space transitions accessible under the dynamics.
authors.affiliation: School of Mathematics, University of Minnesota, Minneapolis, MN, 55455, USA. xkan@umn.edu.
authors.forename: Xingye
authors.initials: X
authors.lastname: Kan
authors.affiliation: Ulsan National Institute of Science and Technology, Ulsan Metropolitan City, 698-798, South Korea.
authors.forename: Chang Hyeong
authors.initials: CH
authors.lastname: Lee
authors.affiliation: School of Mathematics, University of Minnesota, Minneapolis, MN, 55455, USA.
authors.forename: Hans G
authors.initials: HG
authors.lastname: Othmer
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008956:Models, Chemical; D013269:Stochastic Processes
keywords: Graph theory; Reaction networks; Singular perturbation; Stochastic dynamics