2017
DOI: 10.1137/16m1099443
|View full text |Cite
|
Sign up to set email alerts
|

Reduction for Stochastic Biochemical Reaction Networks with Multiscale Conservations

Abstract: Biochemical reaction networks frequently consist of species evolving on multiple timescales. Stochastic simulations of such networks are often computationally challenging and therefore various methods have been developed to obtain sensible stochastic approximations on the timescale of interest. One of the rigorous and popular approaches is the multiscale approximation method for continuous time Markov processes. In this approach, by scaling species abundances and reaction rates, a family of processes parameter… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 21 publications
(18 citation statements)
references
References 57 publications
(208 reference statements)
0
18
0
Order By: Relevance
“…A singular perturbation-theory-based method has also recently been used to obtain a reduced stochastic description (22). There are also several formal results that have been mathematically proven for reaction systems in various scenarios (23)(24)(25)(26).…”
Section: Introductionmentioning
confidence: 99%
“…A singular perturbation-theory-based method has also recently been used to obtain a reduced stochastic description (22). There are also several formal results that have been mathematically proven for reaction systems in various scenarios (23)(24)(25)(26).…”
Section: Introductionmentioning
confidence: 99%
“…For instance, Grima et al [40], Chow et al [41], as well as some others [42,43] have applied this idea to construct approximate, stochastic Michaelis-Menten enzyme kinetic networks and even the gene regulatory networks [44]. As some of the authors of this article argued in their recent work ( [19]), such approximate stochastic models using intensities derived from the deterministic limits may in some sense be better approximations of the underlying stochastic networks than the deterministic QSSAs. Our derivations presented here could be used to further justify this statement, at least for networks satisfying certain scaling conditions [45,46,47], including those presented in Table 1.…”
Section: Discussionmentioning
confidence: 98%
“…We show that these QSSAs are a consequence of the law of large numbers for the stochastic reaction network under different scaling regimes. A similar approach has been recently taken in [19] with respect to a particular type of QSSA (tQSSA, see below in Section 2). However, our current derivation is different in that it entirely avoids a spatial averaging argument used in [19].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…We also investigated the accuracy of the stochastic simulations performed with both models. Specifically, we compared the stochastic simulations using the Gillespie algorithm based on the propensity functions from either the original full model (described in Table S1), the sQ model (Table S2), or the tQ model (Table S3) for 9 different conditions [31][32][33][34][35][36] : E T is either lower than, similar to, or higher than K M , and S T is also either lower than, similar to, or higher than K M (Fig. 1).…”
Section: /13mentioning
confidence: 99%