2019
DOI: 10.1007/978-3-030-31304-3_3
|View full text |Cite
|
Sign up to set email alerts
|

Control Variates for Stochastic Simulation of Chemical Reaction Networks

Abstract: Stochastic simulation is a widely used method for estimating quantities in models of chemical reaction networks where uncertainty plays a crucial role. However, reducing the statistical uncertainty of the corresponding estimators requires the generation of a large number of simulation runs, which is computationally expensive. To reduce the number of necessary runs, we propose a variance reduction technique based on control variates. We exploit constraints on the statistical moments of the stochastic process to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 35 publications
0
12
0
Order By: Relevance
“…Most methods for the estimation of rare event probabilities rely on importance sampling [26,14]. For other queries, alternative variance reduction techniques such as control variates are available [5]. Apart from sampling-based approaches, dynamic finite-state projections have been employed by Mikeev et al [34], but are lacking automated truncation schemes.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…Most methods for the estimation of rare event probabilities rely on importance sampling [26,14]. For other queries, alternative variance reduction techniques such as control variates are available [5]. Apart from sampling-based approaches, dynamic finite-state projections have been employed by Mikeev et al [34], but are lacking automated truncation schemes.…”
Section: Related Workmentioning
confidence: 99%
“…We call each γ(•, t) a bridging distribution. From the Kolmogorov equations (5) and (7) we can obtain both the forward probabilities π(•, t) and the backward probabilities β(•, t) for t < T . We can easily extend this procedure to deal with hitting times constrained by a finite time-horizon by making the goal state x g absorbing.…”
Section: Bridging Distributionmentioning
confidence: 99%
See 2 more Smart Citations
“…The dynamics of these processes is therefore well described by stochastic Markov processes in continuous time with discrete state space [15,22,42]. While few-component or linear-kinetics systems [16] allow for exact analysis, in more complex system one often uses approximative methods [12], such as moment closure [4], linear-noise approximation [3,9], hybrid formulations [25,26,33], and multi-scale techniques [38,39].…”
Section: Introductionmentioning
confidence: 99%