# Conditional Monte Carlo for Reaction Networks

**Authors:** David F. Anderson, Kurt W. Ehlert

arXiv: 1906.05353 · 2022-01-05

## TL;DR

This paper introduces a conditional Monte Carlo estimator for reaction network models that improves probability estimation accuracy in high-dimensional, stochastic systems with small species counts, while maintaining simplicity.

## Contribution

The authors develop a novel conditional Monte Carlo estimator with parameter optimization and provide theoretical guarantees including a central limit theorem.

## Key findings

- Enhanced estimator accuracy over classical Monte Carlo methods.
- Efficient parameter approximation for optimal performance.
- Theoretical validation via a central limit theorem.

## Abstract

Reaction networks are often used to model interacting species in fields such as biochemistry and ecology. When the counts of the species are sufficiently large, the dynamics of their concentrations are typically modeled via a system of differential equations. However, when the counts of some species are small, the dynamics of the counts are typically modeled stochastically via a discrete state, continuous time Markov chain.   A key quantity of interest for such models is the probability mass function of the process at some fixed time. Since paths of such models are relatively straightforward to simulate, we can estimate the probabilities by constructing an empirical distribution. However, the support of the distribution is often diffuse across a high-dimensional state space, where the dimension is equal to the number of species. Therefore generating an accurate empirical distribution can come with a large computational cost.   We present a new Monte Carlo estimator that fundamentally improves on the "classical" Monte Carlo estimator described above. It also preserves much of classical Monte Carlo's simplicity. The idea is basically one of conditional Monte Carlo. Our conditional Monte Carlo estimator has two parameters, and their choice critically affects the performance of the algorithm. Hence, a key contribution of the present work is that we demonstrate how to approximate optimal values for these parameters in an efficient manner. Moreover, we provide a central limit theorem for our estimator, which leads to approximate confidence intervals for its error.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1906.05353/full.md

## Figures

8 figures with captions in the complete paper: https://tomesphere.com/paper/1906.05353/full.md

## References

59 references — full list in the complete paper: https://tomesphere.com/paper/1906.05353/full.md

---
Source: https://tomesphere.com/paper/1906.05353