Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1, 2020 | Published + Submitted
Journal Article Open

Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions

Abstract

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.

Additional Information

© 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). Received 6 November 2018, Revised 12 June 2019, Accepted 8 August 2019, Available online 29 August 2019. 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. Cappelletti has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme grant agreement No. 743269 (CyberGenetics project). This material is based upon work supported by the National Science Foundation Graduate Research Fellowship Program under Grant No. DGE-1745301. 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. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Attached Files

Published - 1-s2.0-S030439751930502X-main.pdf

Submitted - 1810.02854.pdf

Files

1-s2.0-S030439751930502X-main.pdf
Files (2.1 MB)
Name Size Download all
md5:3704c30b9f985bcd6361a9c982149bb0
1.1 MB Preview Download
md5:f5710b64f0ce7b04d38b9c8da46117b5
1.1 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 20, 2023