A Caltech Library Service

Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions

Cappelletti, Daniele and Ortiz-Muñoz, Andrés and Anderson, David F. and Winfree, Erik (2018) Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions. . (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We show that discrete distributions on the d-dimensional non-negative integer lattice can be approximated arbitrarily well via the marginals of stationary distributions for various classes of stochastic chemical reaction networks. We begin by providing a class of detailed balanced networks and prove that they can approximate any discrete distribution to any desired accuracy. However, these detailed balanced constructions rely on the ability to initialize a system precisely, and are therefore susceptible to perturbations in the initial conditions. We therefore provide another construction based on the ability to approximate point mass distributions and prove that this construction is capable of approximating arbitrary discrete distributions for any choice of initial condition. In particular, the developed models are ergodic, so their limit distributions are robust to a finite number of perturbations over time in the counts of molecules.

Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription Paper
Winfree, Erik0000-0002-5899-7523
Additional Information:The current structure of the project was conceived when the four authors participated in the BIRS 5-day Workshop “Mathematical Analysis of Biological Interaction Networks." Parts of the proofs for the present work were then completed while two of the authors were taking part in the AIM SQuaRE workshop “Dynamical properties of deterministic and stochastic models of reaction networks." We thank the Banff International Research Station and the American Institute of Mathematics for making this possible. Anderson gratefully acknowledges support via the Army Research Office through grant W911NF-18-1-0324. Winfree gratefully acknowledges support via the National Science Foundation “Expedition in Computing" grant CCF-1317694. This material is based upon work supported by the National Science Foundation Graduate Research Fellowship Program under Grant No. DGE1745301. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
Funding AgencyGrant Number
Army Research Office (ARO)W911NF-18-1-0324
NSF Graduate Research FellowshipDGE-1745301
Record Number:CaltechAUTHORS:20190619-141711510
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:96572
Deposited By: Tony Diaz
Deposited On:19 Jun 2019 21:27
Last Modified:19 Jun 2019 21:27

Repository Staff Only: item control page