# Coupling from the Past for the Stochastic Simulation of Chemical Reaction Networks

Source: [Coupling from the Past for the Stochastic Simulation of Chemical Reaction Networks](<https://www.sota2.com/research/paper/68fa5f121e209131ce9e74b2>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:07:52.793Z

Authors: J. N. Mueller, J. N. Corcoran

Published: 2021-05-11T20:20:02.000Z

## Abstract

Chemical reaction networks (CRNs) are fundamental computational models used to study the behavior of chemical reactions in well-mixed solutions. They have been used extensively to model a broad range of biological systems, and are primarily used when the more traditional model of deterministic continuous mass action kinetics is invalid due to small molecular counts. We present a perfect sampling algorithm to draw error-free samples from the stationary distributions of stochastic models for coupled, linear chemical reaction networks. The state spaces of such networks are given by all permissible combinations of molecular counts for each chemical species, and thereby grow exponentially with the numbers of species in the network. To avoid simulations involving large numbers of states, we propose a subset of chemical species such that coupling of paths started from these states guarantee coupling of paths started from all states in the state space and we show for the well-known Reversible Michaelis-Menten model that the subset does in fact guarantee perfect draws from the stationary distribution of interest. We compare solutions computed in two ways with this algorithm to those found analytically using the chemical master equation and we compare the distribution of coupling times for the two simulation approaches.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2105.05334>)

[PDF](<https://arxiv.org/pdf/2105.05334.pdf>)
