Stochastic analysis of biochemical reaction networks with absolute concentration robustness

Foundations of static and dynamic absolute concentration robustness

Absolute Concentration Robustness (ACR) was introduced by Shinar and Feinberg (Science 327:1389-1391, 2010) as robustness of equilibrium species concentration in a mass action dynamical system. Their aim was to devise a mathematical condition that will ensure robustness in the function of the biological system being modeled. The robustness of function rests on what we refer to as empirical robustness-the concentration of a species remains unvarying, when measured in the long run, across arbitrary initial conditions. Even simple examples show that the ACR notion introduced in Shinar and Feinberg (Science 327:1389-1391, 2010) (here referred to as static ACR) is neither necessary nor sufficient for empirical robustness. To make a stronger connection with empirical robustness, we define dynamic ACR, a property related to long-term, global dynamics, rather than only to equilibrium behavior. We discuss general dynamical systems with dynamic ACR properties as well as parametrized families of dynamical systems related to reaction networks. We find necessary and sufficient conditions for dynamic ACR in complex balanced reaction networks, a class of networks that is central to the theory of reaction networks.

Impact of noise on the regulation of intracellular transport of intermediate filaments

Noise affects all biological processes from molecules to cells, organisms and populations. Although the effect of noise on these processes is highly variable, evidence is accumulating which shows natural stochastic fluctuations (noise) can facilitate biological functions. Herein, we investigate the effect of noise on the transport of intermediate filaments in cells by comparing the stochastic and deterministic formalizations of the bidirectional transport of intermediate filaments, long elastic polymers transported along microtubules by antagonistic motor proteins Dallon et al., 2019; Portet et al., 2019. By numerically exploring discrepancies in timescales and attractors between both formalizations, we characterize the impact of stochastic fluctuations on the individual and ensemble transport. Biologically, we find that noise promotes the collective movement of intermediate filaments and increases the efficiency of its regulation by the biochemical properties of motor-cargo interactions. While stochastic fluctuations reduce the impact of the initial distributions of motor proteins in cells, the number of binding sites and the affinity of motor-cargo interactions are the key parameters controlling transport efficiency and efficacy.

The inverse correlation between robustness and sensitivity to autoregulation in two-component systems

Two-component systems (TCS) are signal transduction systems in bacteria and many other organisms that relay the sensory signal to genetic components. TCS consist of two proteins: a histidine kinase and a response regulator that the histidine kinase activates. This seemingly simple machinery can generate complex regulatory dynamics that enables the level of gene expression that matches the input signal: many TCS response regulators act on their own genes as transcription factors, resulting in a positive autoregulation mechanism. This regulation, in return, modulates the transcription factor activity as a function of the input signal. Positive autoregulation does not necessarily result in positive feedback. Sensitivity to autoregulation is quantified as the output level amplification resulting from the positive autoregulation mechanism. Another structural property of these systems is formally characterized as "robustness": in a robust TCS, the output of the system is solely a function of the input signal. Thus, a robust TCS remains insensitive to fluctuations in the concentrations of its protein components and, this way, maintains the precision in the output transcription factor activity in response to input stimulus. In this paper, we show with a formal model that TCS operate on a spectrum of inverse correlation between robustness and sensitivity to autoregulation. Our model predicts that the modulation by positive autoregulation is a function of loss in TCS robustness, for example, by spontaneous dephosphorylation of the histidine kinase. Consequently, the loss in robustness provides a proportional modulation by positive autoregulation to widen the response range with a scaled amplification of the output. At the other end of the spectrum, in the presence of a strictly robust TCS machinery, amplification of the transcription factor activity by autoregulation is diminished. We show that our results are in agreement with published experimental results. Our results suggest that these TCS evolve to converge at a trade-off between robustness and positive autoregulation.

Derivation of stationary distributions of biochemical reaction networks via structure transformation

Long-term behaviors of biochemical reaction networks (BRNs) are described by steady states in deterministic models and stationary distributions in stochastic models. Unlike deterministic steady states, stationary distributions capturing inherent fluctuations of reactions are extremely difficult to derive analytically due to the curse of dimensionality. Here, we develop a method to derive analytic stationary distributions from deterministic steady states by transforming BRNs to have a special dynamic property, called complex balancing. Specifically, we merge nodes and edges of BRNs to match in- and out-flows of each node. This allows us to derive the stationary distributions of a large class of BRNs, including autophosphorylation networks of EGFR, PAK1, and Aurora B kinase and a genetic toggle switch. This reveals the unique properties of their stochastic dynamics such as robustness, sensitivity, and multi-modality. Importantly, we provide a user-friendly computational package, CASTANET, that automatically derives symbolic expressions of the stationary distributions of BRNs to understand their long-term stochasticity.

Embracing Noise in Chemical Reaction Networks

We provide a short review of stochastic modeling in chemical reaction networks for mathematical and quantitative biologists. We use as case studies two publications appearing in this issue of the Bulletin, on the modeling of quasi-steady-state approximations and cell polarity. Reasons for the relevance of stochastic modeling are described along with some common differences between stochastic and deterministic models.

A hidden integral structure endows absolute concentration robust systems with resilience to dynamical concentration disturbances

Biochemical systems that express certain chemical species of interest at the same level at any positive steady state are called 'absolute concentration robust' (ACR). These species behave in a stable, predictable way, in the sense that their expression is robust with respect to sudden changes in the species concentration, provided that the system reaches a (potentially new) positive steady state. Such a property has been proven to be of importance in certain gene regulatory networks and signaling systems. In the present paper, we mathematically prove that a well-known class of ACR systems studied by Shinar and Feinberg in 2010 hides an internal integral structure. This structure confers these systems with a higher degree of robustness than was previously known. In particular, disturbances much more general than sudden changes in the species concentrations can be rejected, and robust perfect adaptation is achieved. Significantly, we show that these properties are maintained when the system is interconnected with other chemical reaction networks. This key feature enables the design of insulator devices that are able to buffer the loading effect from downstream systems-a crucial requirement for modular circuit design in synthetic biology. We further note that while the best performance of the insulators are achieved when these act at a faster timescale than the upstream module (as typically required), it is not necessary for them to act on a faster timescale than the downstream module in our construction.

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.

Trade-offs between effectiveness and cost in bifunctional enzyme circuit with concentration robustness

A fundamental trade-off in biological systems is whether they consume resources to perform biological functions or save resources. Bacteria need to reliably and rapidly respond to input signals by using limited cellular resources. However, excessive resource consumption will become a burden for bacteria growth. To investigate the relationship between functional effectiveness and resource cost, we study the ubiquitous bifunctional enzyme circuit, which is robust to fluctuations in protein concentration and responds quickly to signal changes. We show that trade-off relationships exist between functional effectiveness and protein cost. Expressing more proteins of the circuit increases concentration robustness and response speed but affects bacterial growth. In particular, our study reveals a general relationship between free-energy dissipation rate, response speed, and concentration robustness. The dissipation of free energy plays an important role in the concentration robustness and response speed. High robustness can only be achieved with a large amount of free-energy consumption and protein cost. In addition, the noise of the output increases with increasing protein cost, while the noise of the response time decreases with increasing protein cost. We also calculate the trade-off relationships in the EnvZ-OmpR system and the nitrogen assimilation system, which both have the bifunctional enzyme. Similar results indicate that these relationships are mainly derived from the specific feature of the bifunctional enzyme circuits and are not relevant to the details of the models. According to the trade-off relationships, bacteria take a compromise solution that reliably performs biological functions at a reasonable cost.

Comparison of Deterministic and Stochastic Regime in a Model for Cdc42 Oscillations in Fission Yeast

Oscillations occur in a wide variety of essential cellular processes, such as cell cycle progression, circadian clocks and calcium signaling in response to stimuli. It remains unclear how intrinsic stochasticity can influence these oscillatory systems. Here, we focus on oscillations of Cdc42 GTPase in fission yeast. We extend our previous deterministic model by Xu and Jilkine to construct a stochastic model, focusing on the fast diffusion case. We use SSA (Gillespie's algorithm) to numerically explore the low copy number regime in this model, and use analytical techniques to study the long-time behavior of the stochastic model and compare it to the equilibria of its deterministic counterpart. Numerical solutions suggest noisy limit cycles exist in the parameter regime in which the deterministic system converges to a stable limit cycle, and quasi-cycles exist in the parameter regime where the deterministic model has a damped oscillation. Near an infinite period bifurcation point, the deterministic model has a sustained oscillation, while stochastic trajectories start with an oscillatory mode and tend to approach deterministic steady states. In the low copy number regime, metastable transitions from oscillatory to steady behavior occur in the stochastic model. Our work contributes to the understanding of how stochastic chemical kinetics can affect a finite-dimensional dynamical system, and destabilize a deterministic steady state leading to oscillations.

An algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networks

Steady state is an essential concept in reaction networks. Its stability reflects fundamental characteristics of several biological phenomena such as cellular signal transduction and gene expression. Because biochemical reactions occur at the cellular level, they are affected by unavoidable fluctuations. Although several methods have been proposed to detect and analyze the stability of steady states for deterministic models, these methods cannot be applied to stochastic reaction networks. In this paper, we propose an algorithm based on algebraic computations to calculate parameter regions for constrained steady-state distribution of stochastic reaction networks, in which the means and variances satisfy some given inequality constraints. To evaluate our proposed method, we perform computer simulations for three typical chemical reactions and demonstrate that the results obtained with our method are consistent with the simulation results.

Network Translation and Steady-State Properties of Chemical Reaction Systems

Network translation has recently been used to establish steady-state properties of mass action systems by corresponding the given system to a generalized one which is either dynamically or steady-state equivalent. In this work, we further use network translation to identify network structures which give rise to the well-studied property of absolute concentration robustness in the corresponding mass action systems. In addition to establishing the capacity for absolute concentration robustness, we show that network translation can often provide a method for deriving the steady-state value of the robust species. We furthermore present a MILP algorithm for the identification of translated chemical reaction networks that improves on previous approaches, allowing for easier application of the theory.

Solving moment hierarchies for chemical reaction networks

The study of chemical reaction networks (CRN's) is a very active field. Earlier well-known results (Feinberg 1987 Chem. Enc. Sci. 42 2229, Anderson et al 2010 Bull. Math. Biol. 72 1947) identify a topological quantity called deficiency, for any CRN, which, when exactly equal to zero, leads to a unique factorized steady-state for these networks. No results exist however for the steady states of non-zero-deficiency networks. In this paper, we show how to write the full moment-hierarchy for any non-zero-deficiency CRN obeying mass-action kinetics, in terms of equations for the factorial moments. Using these, we can recursively predict values for lower moments from higher moments, reversing the procedure usually used to solve moment hierarchies. We show, for nontrivial examples, that in this manner we can predict any moment of interest, for CRN's with non-zero deficiency and non-factorizable steady states.

Transient absolute robustness in stochastic biochemical networks

Absolute robustness allows biochemical networks to sustain a consistent steady-state output in the face of protein concentration variability from cell to cell. This property is structural and can be determined from the topology of the network alone regardless of rate parameters. An important question regarding these systems is the effect of discrete biochemical noise in the dynamical behaviour. In this paper, a variable freezing technique is developed to show that under mild hypotheses the corresponding stochastic system has a transiently robust behaviour. Specifically, after finite time the distribution of the output approximates a Poisson distribution, centred around the deterministic mean. The approximation becomes increasingly accurate, and it holds for increasingly long finite times, as the total protein concentrations grow to infinity. In particular, the stochastic system retains a transient, absolutely robust behaviour corresponding to the deterministic case. This result contrasts with the long-term dynamics of the stochastic system, which eventually must undergo an extinction event that eliminates robustness and is completely different from the deterministic dynamics. The transiently robust behaviour may be sufficient to carry out many forms of robust signal transduction and cellular decision-making in cellular organisms.

A computational approach to extinction events in chemical reaction networks with discrete state spaces

Recent work of Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature. We also run the program on 458 models from the European Bioinformatics Institute's BioModels Database and report our results.

Conditions for extinction events in chemical reaction networks with discrete state spaces

We study chemical reaction networks with discrete state spaces and present sufficient conditions on the structure of the network that guarantee the system exhibits an extinction event. The conditions we derive involve creating a modified chemical reaction network called a domination-expanded reaction network and then checking properties of this network. Unlike previous results, our analysis allows algorithmic implementation via systems of equalities and inequalities and suggests sequences of reactions which may lead to extinction events. We apply the results to several networks including an EnvZ-OmpR signaling pathway in Escherichia coli.

Lyapunov Functions, Stationary Distributions, and Non-equilibrium Potential for Reaction Networks

We consider the relationship between stationary distributions for stochastic models of reaction systems and Lyapunov functions for their deterministic counterparts. Specifically, we derive the well-known Lyapunov function of reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced systems. We extend this result to general birth-death models and demonstrate via example that similar scaling limits can yield Lyapunov functions even for models that are not complex or detailed balanced, and may even have multiple equilibria.