skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, December 13 until 2:00 AM ET on Saturday, December 14 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Absolutely robust controllers for chemical reaction networks
In this work, we design a type of controller that consists of adding a specific set of reactions to an existing mass-action chemical reaction network in order to control a target species. This set of reactions is effective for both deterministic and stochastic networks, in the latter case controlling the mean as well as the variance of the target species. We employ a type of network property called absolute concentration robustness (ACR). We provide applications to the control of a multisite phosphorylation model as well as a receptor–ligand signalling system. For this framework, we use the so-called deficiency zero theorem from chemical reaction network theory as well as multiscaling model reduction methods. We show that the target species has approximately Poisson distribution with the desired mean. We further show that ACR controllers can bring robust perfect adaptation to a target species and are complementary to a recently introduced antithetic feedback controller used for stochastic chemical reactions.  more » « less
Award ID(s):
1763272
PAR ID:
10223024
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of The Royal Society Interface
Volume:
17
Issue:
166
ISSN:
1742-5689
Page Range / eLocation ID:
20200031
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ( , European Journal of Applied Mathematics)
    null (Ed.)
    Chemical reaction networks describe interactions between biochemical species. Once an underlying reaction network is given for a biochemical system, the system dynamics can be modelled with various mathematical frameworks such as continuous-time Markov processes. In this manuscript, the identifiability of the underlying network structure with a given stochastic system dynamics is studied. It is shown that some data types related to the associated stochastic dynamics can uniquely identify the underlying network structure as well as the system parameters. The accuracy of the presented network inference is investigated when given dynamical data are obtained via stochastic simulations. 
    more » « less
  2. ; ( , ACM SIGMETRICS Performance Evaluation Review)
    null (Ed.)
    We consider a general class of finite-horizon online decision-making problems, where in each period a controller is presented a stochastic arrival and must choose an action from a set of permissible actions, and the final objective depends only on the aggregate type-action counts. Such a framework encapsulates many online stochastic variants of common optimization problems including bin packing, generalized assignment, and network revenue management. In such settings, we study a natural model-predictive control algorithm that in each period, acts greedily based on an updated certainty-equivalent optimization problem. We introduce a simple, yet general, condition under which this algorithm obtains uniform additive loss (independent of the horizon) compared to an optimal solution with full knowledge of arrivals. Our condition is fulfilled by the above-mentioned problems, as well as more general settings involving piece-wise linear objectives and offline index policies, including an airline overbooking problem. 
    more » « less
  3. ; ( , Proceedings of the National Academy of Sciences)
    This paper is about a class of stochastic reaction networks. Of interest are the dynamics of interconversion among a finite number of substances through reactions that consume some of the substances and produce others. The models we consider are continuous-time Markov jump processes, intended as idealizations of a broad class of biological networks. Reaction rates depend linearly on “enzymes,” which are among the substances produced, and a reaction can occur only in the presence of sufficient upstream material. We present rigorous results for this class of stochastic dynamical systems, the mean-field behaviors of which are described by ordinary differential equations (ODEs). Under the assumption of exponential network growth, we identify certain ODE solutions as being potentially traceable and give conditions on network trajectories which, when rescaled, can with high probability be approximated by these ODE solutions. This leads to a complete characterization of the ω -limit sets of such network solutions (as points or random tori). Dimension reduction is noted depending on the number of enzymes. The second half of this paper is focused on depletion dynamics, i.e., dynamics subsequent to the “phase transition” that occurs when one of the substances becomes unavailable. The picture can be complex, for the depleted substance can be produced intermittently through other network reactions. Treating the model as a slow–fast system, we offer a mean-field description, a first step to understanding what we believe is one of the most natural bifurcations for reaction networks. 
    more » « less
  4. ; ; ; ( , Proceedings of the 37th International Conference on Machine Learning)
    III, Hal Daumé ; Singh, Aarti (Ed.)
    Embedding computation in molecular contexts incompatible with traditional electronics is expected to have wide ranging impact in synthetic biology, medicine, nanofabrication and other fields. A key remaining challenge lies in developing programming paradigms for molecular computation that are well-aligned with the underlying chemical hardware and do not attempt to shoehorn ill-fitting electronics paradigms. We discover a surprisingly tight connection between a popular class of neural networks (binary-weight ReLU aka BinaryConnect) and a class of coupled chemical reactions that are absolutely robust to reaction rates. The robustness of rate-independent chemical computation makes it a promising target for bioengineering implementation. We show how a BinaryConnect neural network trained in silico using well-founded deep learning optimization techniques, can be compiled to an equivalent chemical reaction network, providing a novel molecular programming paradigm. We illustrate such translation on the paradigmatic IRIS and MNIST datasets. Toward intended applications of chemical computation, we further use our method to generate a chemical reaction network that can discriminate between different virus types based on gene expression levels. Our work sets the stage for rich knowledge transfer between neural network and molecular programming communities. 
    more » « less
  5. ; ; ( , The Journal of Chemical Physics)
    Physical kinetic roughening processes are well-known to exhibit universal scaling of observables that fluctuate in space and time. Are there analogous dynamic scaling laws that are unique to the chemical reaction mechanisms available synthetically and occurring naturally? Here, we formulate an approach to the dynamic scaling of stochastic fluctuations in thermodynamic observables at and away from equilibrium. Both analytical expressions and numerical simulations confirm our dynamic scaling ansatz with associated scaling exponents, function, and law. A survey of common chemical mechanisms reveals classes that organize according to the molecularity of the reactions involved, the nature of the reaction vessel and external reservoirs, (non)equilibrium conditions, and the extent of autocatalysis in the reaction network. Varying experimental parameters, such as temperature, can cause coupled reactions capable of chemical feedback to transition between these classes. While path observables, such as the dynamical activity, have scaling exponents that are time-independent, the variance in the entropy production and flow can have time-dependent scaling exponents and self-averaging properties as a result of temporal correlations that emerge during thermodynamically irreversible processes. Altogether, these results establish dynamic universality classes in the nonequilibrium fluctuations of thermodynamic observables for well-mixed chemical reactions. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email