Variance Reduction with Array-RQMC for Tau-Leaping Simulation of Stochastic Biological and Chemical Reaction Networks.

  title={Variance Reduction with Array-RQMC for Tau-Leaping Simulation of Stochastic Biological and Chemical Reaction Networks.},
  author={Florian Puchhammer and Amal Ben Abdellah and Pierre L'Ecuyer},
  journal={Bulletin of mathematical biology},
  volume={83 8},
We explore the use of Array-RQMC, a randomized quasi-Monte Carlo method designed for the simulation of Markov chains, to reduce the variance when simulating stochastic biological or chemical reaction networks with [Formula: see text]-leaping. The task is to estimate the expectation of a function of molecule copy numbers at a given future time T by the sample average over n sample paths, and the goal is to reduce the variance of this sample-average estimator. We find that when the method is… Expand
1 Citations

Figures and Tables from this paper

Multifidelity multilevel Monte Carlo to accelerate approximate Bayesian parameter inference for partially observed stochastic processes
A new method based on recent advances in multilevel and multifidelity methods for parameter inference using partially observed Markov processes for likelihood-free Bayesian inference is developed, and improvements of more than two orders of magnitude over standard rejection sampling techniques are demonstrated. Expand


On Array-RQMC for Markov Chains: Mapping Alternatives and Convergence Rates
We study the convergence behavior of a randomized quasi-Monte Carlo (RQMC) method for the simulation of discrete-time Markov chains, known as array-RQMC. The goal is to estimate the expectation of a… Expand
Quasi-Monte Carlo Methods Applied to Tau-Leaping in Stochastic Biological Systems
This paper investigates the combination of (randomised) quasi-Monte Carlo methods with an efficient sample path simulation procedure, namely Ο„-leaping, and shows that this combination is often more effective than traditional Monte Carlo simulation in terms of the decay of statistical errors. Expand
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
A randomized quasi-Monte Carlo method for the simulation of Markov chains up to a random (and possibly unbounded) stopping time that proves bounds on the convergence rate of the worst-case error and of the variance for special situations where the state space of the chain is a subset of the real numbers. Expand
Multilevel Monte Carlo for Continuous Time Markov Chains, with Applications in Biochemical Kinetics
We show how to extend a recently proposed multi-level Monte Carlo approach to the continuous time Markov chain setting, thereby greatly lowering the computational complexity needed to compute… Expand
Array-RQMC for Option Pricing Under Stochastic Volatility Models
It is shown that Array-RQMC can also work very well for these models, even if it requires RQMC points in larger dimension, and it is examined in particular the variance-gamma, Heston, and Ornstein-Uhlenbeck stochastic volatility models. Expand
Rare events, splitting, and quasi-Monte Carlo
RQMC can be used jointly with splitting and/or IS to construct better estimators than those obtained by either of these methods alone, in a setting where the goal is to estimate the probability of reaching B before reaching (or returning to) A when starting A from a distinguished state not in B. Expand
The splitting method is one of the primary approaches to make important rare events happen more frequently in a simulation and yet recover an unbiased estimator of the target performance measure, in… Expand
Randomized quasi-Monte Carlo: An introduction for practitioners
We survey basic ideas and results on randomized quasi-Monte Carlo (RQMC) methods, discuss their practical aspects, and give numerical illustrations. RQMC can improve accuracy compared with standard… Expand
Sorting methods and convergence rates for Array-RQMC: Some empirical comparisons
This work reviews the Array-RQMC method, its variants, sorting strategies, and convergence results, and shows empirical results that suggest much better convergence rates than those that are proved. Expand
Continuous Time Markov Chain Models for Chemical Reaction Networks
This chapter develops much of the mathematical machinery needed to describe the stochastic models of reaction networks and shows how to derive the deterministic law of mass action from the Markov chain model. Expand