Programming discrete distributions with chemical reaction networks

From MaRDI portal
Publication:2835702

DOI10.1007/978-3-319-43994-5_3zbMATH Open1451.68108arXiv1601.02578OpenAlexW2962775345WikidataQ56981832 ScholiaQ56981832MaRDI QIDQ2835702FDOQ2835702


Authors: Luca Cardelli, Marta Kwiatkowska, Luca Laurenti Edit this on Wikidata


Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: We explore the range of probabilistic behaviours that can be engineered with Chemical Reaction Networks (CRNs). We show that at steady state CRNs are able to "program" any distribution with finite support in mathbbNm, with mgeq1. Moreover, any distribution with countable infinite support can be approximated with arbitrarily small error under the L1 norm. We also give optimized schemes for special distributions, including the uniform distribution. Finally, we formulate a calculus to compute on distributions that is complete for finite support distributions, and can be compiled to a restricted class of CRNs that at steady state realize those distributions.


Full work available at URL: https://arxiv.org/abs/1601.02578




Recommendations



Cites Work


Cited In (15)





This page was built for publication: Programming discrete distributions with chemical reaction networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835702)