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

ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data

Abstract: Abstract.A method for detecting intrinsic slow variables in stochastic chemical reaction networks is developed and analyzed. It combines anisotropic diffusion maps (ADMs) with approximations based on the chemical Langevin equation (CLE). The resulting approach, called ADM-CLE, has the potential of being more efficient than the ADM method for a large class of chemical reaction systems, because it replaces the computationally most expensive step of ADM (running local short bursts of simulations) by using an appr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 46 publications
(71 reference statements)
0
1
0
Order By: Relevance
“…One can use either short bursts of the Gillespie SSA on a range of points on the slow state space to approximate the effective drift and diffusion of the slow variable [12] or the constrained multiscale algorithm (CMA) [5], which utilizes a modified SSA that constrains the trajectories it computes to a particular point on the slow state space. These algorithms can be further extended to automatic detection of slow variables [10,26,6], but in this paper we assume that the division of state space into slow and fast variables is a priori known and fixed during the whole simulation.…”
Section: B145mentioning
confidence: 99%
“…One can use either short bursts of the Gillespie SSA on a range of points on the slow state space to approximate the effective drift and diffusion of the slow variable [12] or the constrained multiscale algorithm (CMA) [5], which utilizes a modified SSA that constrains the trajectories it computes to a particular point on the slow state space. These algorithms can be further extended to automatic detection of slow variables [10,26,6], but in this paper we assume that the division of state space into slow and fast variables is a priori known and fixed during the whole simulation.…”
Section: B145mentioning
confidence: 99%