Programming discrete distributions with chemical reaction networks

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 N m, with m ≥ 1. Moreover, any distribution with countable infinite support can be approxima...

Full description

Bibliographic Details
Main Authors: Cardelli, L, Kwiatkowska, M, Laurenti, L
Format: Conference item
Published: Springer, Cham 2016
_version_ 1797103674279854080
author Cardelli, L
Kwiatkowska, M
Laurenti, L
author_facet Cardelli, L
Kwiatkowska, M
Laurenti, L
author_sort Cardelli, L
collection OXFORD
description 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 N m, with m ≥ 1. Moreover, any distribution with countable infinite support can be approximated with arbitrarily small error under the L 1 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.
first_indexed 2024-03-07T06:23:27Z
format Conference item
id oxford-uuid:f371e90a-1f14-4bdf-8fd4-7271fe173d21
institution University of Oxford
last_indexed 2024-03-07T06:23:27Z
publishDate 2016
publisher Springer, Cham
record_format dspace
spelling oxford-uuid:f371e90a-1f14-4bdf-8fd4-7271fe173d212022-03-27T12:12:18ZProgramming discrete distributions with chemical reaction networksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:f371e90a-1f14-4bdf-8fd4-7271fe173d21Symplectic Elements at OxfordSpringer, Cham2016Cardelli, LKwiatkowska, MLaurenti, LWe 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 N m, with m ≥ 1. Moreover, any distribution with countable infinite support can be approximated with arbitrarily small error under the L 1 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.
spellingShingle Cardelli, L
Kwiatkowska, M
Laurenti, L
Programming discrete distributions with chemical reaction networks
title Programming discrete distributions with chemical reaction networks
title_full Programming discrete distributions with chemical reaction networks
title_fullStr Programming discrete distributions with chemical reaction networks
title_full_unstemmed Programming discrete distributions with chemical reaction networks
title_short Programming discrete distributions with chemical reaction networks
title_sort programming discrete distributions with chemical reaction networks
work_keys_str_mv AT cardellil programmingdiscretedistributionswithchemicalreactionnetworks
AT kwiatkowskam programmingdiscretedistributionswithchemicalreactionnetworks
AT laurentil programmingdiscretedistributionswithchemicalreactionnetworks