2012
DOI: 10.1137/120871894
|View full text |Cite
|
Sign up to set email alerts
|

Error Bound for Piecewise Deterministic Processes Modeling Stochastic Reaction Systems

Abstract: Biological processes involving the random interaction of d species with integer particle numbers are often modeled by a Markov jump process on N d 0 . Realizations of this process can, in principle, be generated with the classical stochastic simulation algorithm proposed in [19], but for very reactive systems this method is usually inefficient. Hybrid models based on piecewise deterministic processes offer an attractive alternative which can decrease the simulation time considerably in applications where speci… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
35
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(36 citation statements)
references
References 39 publications
1
35
0
Order By: Relevance
“…In some cases, this is possible, however. For example, error bounds for some hybrid methods have been derived [213,214,208]. In [215] the convergence of different types of hybrid methods to the exact system have been studied, and in [184] criteria have been developed for the convergence of a CME to discrete-deterministic hybrid approximations.…”
Section: Hybrid Methodsmentioning
confidence: 99%
“…In some cases, this is possible, however. For example, error bounds for some hybrid methods have been derived [213,214,208]. In [215] the convergence of different types of hybrid methods to the exact system have been studied, and in [184] criteria have been developed for the convergence of a CME to discrete-deterministic hybrid approximations.…”
Section: Hybrid Methodsmentioning
confidence: 99%
“…Thus the total number of possible reactions C ∈ ℕ at time t is C = 3S(t) . Following the formulation given in [26, 27], let X ( t ) = (( X i ( t )) i ∈ S ( t ) ) T be the state vector at time t of all clones. X(t) is a random variable in that consists of the random variables X i ( t ) ∈ ℕ 0 = ℕ ⋃{0} of the frequencies x i (t) of clones i = 1,…, S max , where S max is chosen to always be larger than S(t) for all t .…”
Section: Methodsmentioning
confidence: 99%
“…X(t) is a random variable in that consists of the random variables X i ( t ) ∈ ℕ 0 = ℕ ⋃{0} of the frequencies x i (t) of clones i = 1,…, S max , where S max is chosen to always be larger than S(t) for all t . The state vector X(t) evolves through a Markov jump process that depends only on the current state , and its evolution is given by where V c and α c respectively denote the stoichiometric vector and propensity function of reaction c [26, 27]. Equation (2) states that the population X(t) at time t is equal to the initial population y 0 plus the sum of the changes induced by all reactions.…”
Section: Methodsmentioning
confidence: 99%
“…In the first category, tentative analysis of specific examples are found in [4], while [17,19] are of more general character and based on averaging techniques, and conditional expectations, respectively. A related analysis in the sense of meansquare convergence for operator splitting techniques is found in [11].…”
Section: Introductionmentioning
confidence: 99%