Power-engine-load form for
dynamic absolute concentration robustness
Abstract
In a reaction network, the concentration of a species with the property of dynamic absolute concentration robustness (dynamic ACR) converges to the same value independent of the overall initial values.
This property endows a biochemical network with output robustness and therefore is essential for its functioning in a highly variable environment.
It is important to identify structure of the dynamical system as well as constraints required for dynamic ACR.
We propose a power-engine-load form of dynamic ACR and obtain results regarding convergence to the ACR value based on this form.
Keywords: biochemical reaction network, absolute concentration robustness, power-engine-load form, dynamical systems, robust network output, chemostat.
AMS subject codes: 34C20, 37N25, 37N35, 92C42
1 Introduction
Dynamic absolute concentration robustness (dynamic ACR), introduced in [1], is a property of dynamical systems wherein one variable converges to a unique value independent of the initial values. This variable is the dynamic ACR variable and the unique value is its ACR value. Dynamic ACR is significant for applications to biochemistry. Biochemical systems need to perform robustly in a wide variety of conditions. Dynamic ACR provides a mechanism for such robustness. In signal response circuits, an essential design feature is that the response depends on the signal but not on the internal state of the signaling circuit. Different initial states (which model the internal state of the signaling circuit when the signal arrives) generically result in different final states, especially when some conservation laws hold. However, if one of the variables is invariant across all final states, such as is the case in dynamic ACR, then this variable can be taken to be the invariant signal response. The dependence of the signal strength is encoded in the reaction rate constants, and therefore signal response will depend on the signal strength via the rate constants. However, the signal response will not depend on the initial values, i.e. the internal state of the signaling circuit.
Formally, dynamic ACR is the property that all trajectories (with some minor restrictions on allowed initial values) converge to the hyperplane . It is desirable to identify sufficient conditions, either on the underlying reaction network or the dynamical system, that generate dynamic ACR. Necessary and sufficient conditions for dynamic ACR in complex balanced systems have been obtained in [1]. Moreover, a classification of small networks with dynamic ACR appears in [2].
Shinar and Feinberg [3] defined static absolute concentration robustness (static ACR) as the property that all positive steady states are located in the hyperplane . Furthermore, they gave sufficient network conditions for the reaction network to have static ACR in some species. Additionally, they gave many biochemically realistic networks and showed that these networks satisfy their network conditions and therefore have static ACR. Many of the biochemical networks appearing in their paper may have the property of dynamic ACR as well, although this remains an open question. It is difficult to characterize dynamic ACR because it requires understanding the limiting behavior for arbitrary initial values. We propose a power-engine-load form (see (3.1)) for the differential equation satisfied by the supposed dynamic ACR variable, which may help establish dynamic ACR in some situations as we show in this paper. In Theorem 3.8, we establish sufficient conditions for convergence to the ACR value, based on properties of the terms appearing in the power-engine-load form equation.
Dynamic ACR has been experimentally observed in bacterial two-component signaling systems such as the EnvZ-OmpR system and the IDHKP-IDH system [4, 5, 6, 7, 8, 9]. Absolute concentration robustness (both static and dynamic) is related to the concept called robust perfect adaptation [10, 11, 12] studied from a control theory perspective. For a biochemical perspective on perfect adaptation, see [13, 14]. Structural requirements for robust perfect adaptation in biomolecular networks are studied in [15]. While our goal in this paper is not to explore the connections between the two fields of dynamical systems and control theory, we mention the above papers here as a help to any readers interested in understanding the connection further.
This article is organized as follows. Section 2 gives the background on reaction networks, mass action kinetics, and dynamic absolute concentration robustness (ACR). Section 3 introduces a power-engine-load form for dynamic ACR, examples, and convergence results. The main result of this paper is Theorem 3.8. Section 4 studies the dynamics of several reaction networks where we apply power-engine-load form and illustrate the use of Theorem 3.8. In many cases, the reaction network is coupled with inflows. While each network requires special analysis, we ultimately apply Theorem 3.8 to show dynamic ACR for the network under study.
2 Reaction networks
An example of a reaction is , which is a schematic representation of the process where a molecule of species and a molecule of species react with one another and result in two molecules of a species . The abstract linear combination of species that appears on the left of the reaction arrow is called the reactant complex while is called the product complex of the reaction . We assume that for any reaction the product complex is different from the reactant complex. A reaction network is a nonempty, finite set of species and a nonempty, finite set of reactions such that every species appears in at least one complex. We will use mass action kinetics for the rate of reactions.
2.1 Mass action systems
In mass action kinetics, each reaction occurs at a rate proportional to the product of the concentrations of species appearing in the reactant complex. We conventionally use lower case letters to denote the species concentrations of the corresponding species , respectively. Under mass action kinetics, the reaction occurs at rate where is the reaction rate constant, conventionally placed near the reaction arrow, as follows: . Consider the reaction network . Application of mass action kinetics results in the following dynamical system, called mass action system, that describes the time-evolution of the species concentrations.
For further details on reaction networks and mass action systems, see for instance [16, 17]. We use standard notation and terminology of dynamical systems, such as steady states, stability, basin of attraction etc., see for instance [18, 19].
2.2 Dynamic absolute concentration robustness
Shinar and Feinberg defined (static) absolute concentration robustness (static ACR) as the property that all positive steady states are contained in a fixed hyperplane parallel to a coordinate hyperplane [3]. This means that for every positive steady state, one of the coordinates is invariant. Several network/structural conditions for static ACR have been identified [3, 20, 1, 2]. Static ACR is designed to model the property of a robust signal response despite variability in the internal state of the signaling circuit. However, the property accurately models output robustness only if there is convergence to a positive steady state for every initial value, and indeed, such convergence is not required in the definition of static ACR.
We defined dynamic absolute concentration robustness (dynamic ACR) as the property that all initial values lead to convergence to a fixed hyperplane parallel to a coordinate hyperplane [1] – a requirement somewhat more general than converging to a steady state in the hyperplane. We believe that this property better captures the idea of output robustness, when compared to static ACR, since it models long-term dynamics. Network conditions for dynamic ACR in small reaction networks were found in [2]. The condition found there is geometric in nature – for dynamic ACR in networks with two reactions and two species, the reactant polytope (line segment joining the two reactant complexes in their geometric embedding) must be parallel to a coordinate axis. We seek an extension of this condition in arbitrary networks. If the differential equation for the candidate ACR species has a certain special form (power-engine-load form), then it may have dynamic ACR provided that the power and load satisfy some additional conditions.
Dynamic ACR was defined for autonomous systems in [1]. We generalize to include non-autonomous systems. Throughout the paper, we assume that is a dynamical system defined by with for which is forward invariant.
Definition 2.1.
The kinetic subspace of is defined to be the linear span of the image of , denoted by . Two points are compatible if . The sets are compatible if there are and such that and are compatible. A compatibility class is a nonempty subset of such that if and only if .
Definition 2.2.
is a dynamic ACR system if there is an with and a positive such that for any with is compatible with , a unique solution to exists up to some maximal , and . Any such and is a dynamic ACR variable and its dynamic ACR value, respectively.
If the dynamical system does not have the possibility of a finite-time blow-up, then for any . In this paper, we focus on dynamic ACR in systems where a unique solution is assumed to exist for all positive time.
3 Power-engine-load form of dynamic ACR
In [2], we discuss the network conditions for static and dynamic ACR in reaction networks with two species and two reactions. One of the conditions is that the reactant polytope (i.e. in the Euclidean embedding of the reaction network, the line segment joining the two reactant complexes) is parallel to one of the coordinate axes. A natural generalization of this geometric condition is the one given below, called power-engine-load form for dynamic ACR.
Suppose that and for some , satisfies
(3.1) |
then under some reasonable conditions on “power” and “load” , the variable will have dynamic ACR with the value . An example of sufficient conditions is , , and . We state the precise result and prove other convergence results in Section 3.2.
3.1 Examples of power-engine-load form in mass action systems
Example 3.1.
The simplest example of a mass action system with power-engine-load form is the reaction network and its associated ODE
It is straightforward to show that has dynamic ACR with value . ∎
Example 3.2.
Biologically interesting cases require a reactant complex with more than one species (so that a ‘reaction’ can occur) and some positive mass conservation law involving all species. The following well-known network is the simplest that satisfies these requirements of species interaction and mass conservation:
(3.2) |
The positive mass conservation law is apparent from the mass action ODE system:
(3.3) |
The ODE for has power-engine-load form and it is known (see for instance [1]) that for any initial value that satisfies . ∎
Example 3.3.
In bacterial two-component signaling systems, the circuit mechanism for robust signal transduction from the cell environment to its interior involves a bifunctional component, a mechanism that is found in thousands of biological systems [8]. One such system is the E. coli IDHKP-IDH glyoxylate bypass regulation system whose core ACR module is
(3.4) |
It is known that (3.3) has static ACR in [3]. The mass action ODE equation for the concentration of can be written in power-engine-load form, using the fact that the static ACR value of is , as follows.
The load is not identically zero in this case. We will prove in future work that has dynamic ACR with ACR value . As shown in Theorem 3.8, a sufficient condition for dynamic ACR is that for any positive initial value and that . Checking that the two conditions are satisfied requires some additional ideas which will be developed in future work. ∎
We now discuss conditions on “power” and “load” that either ensure or prevent dynamic ACR.
3.2 Convergence results for power-engine-load form dynamic ACR
Theorem 3.4 (Zero load).
Consider the dynamical system with continuously differentiable and for which is forward invariant. Suppose there is an such that if and only if . The following hold for every solution of .
-
1.
has the same sign as for all .
-
2.
Suppose . Then has the same sign as for all .
-
3.
Suppose .
-
(a)
If then is strictly decreasing on and
-
(b)
If then is strictly increasing on .
-
(a)
-
4.
Suppose . Then if and only if
Proof.
If then and so for all . If there is a such that and have different signs then by continuity of , there must be a such that . But then for all , which is a contradiction.
If then by the previous part is defined for all time . Since for , the second result follows. Since for all , we can divide by and integrate to get
(3.5) |
By the previous result, the integrand has the same sign as for all positive time, and so result 3 follows. Finally, result 4 follows from taking on both sides. ∎
Example 3.5.
Consider the mass action system (3.3), . The variable has power-engine-load form with zero load and power for every . It is clear that if and only if . So assume that .
The mass action system with initial value can be solved explicitly after using the conservation relation , thus reducing to the one-dimensional system . We get
and .
For , it is well-known that if and only if . We now argue that if and only if and . Indeed, for any ,
Moreover
(3.6) |
implies that
because in the first case () the integrand does not go to zero, the integral is clearly divergent and in the latter case () the integrand is , so the integral is convergent.
This shows that if and only if either or . ∎
Corollary 3.6.
Example 3.7.
The condition (3.7) is sufficient but not necessary for . Consider the mass action system of the following reaction network:
(3.8) |
where the rate constants are the same for the reactions and ( degrades both and at the same rate). The mass action ODEs are
(3.9) |
It is simple to check that given an arbitrary positive initial value , the unique solution satisfies
and so for any which implies that by Theorem 3.4. However, , so Corollary 3.6 does not apply. ∎
When the load is nonzero, the power must overpower the load for convergence of to .
Theorem 3.8.
Consider the dynamical system with and for which is forward invariant. Suppose that for some we have
with in , and . Let be a solution of such that , and such that the limit exists, with . Then we have .
Proof.
Note that the equation can be rewritten as
(3.10) |
Then, if we denote and , we can reduce our problem to showing that if satisfies the equation
(3.11) |
and , then .
For any fixed we will now show that there exists some such that for all . For this, let us first choose some such that for all . Note that this implies that the interval is an invariant set of (3.10) for . Therefore, if , we can choose . Assume now that , and for example (the case where is analogous).
Let us assume that the inequality holds for all ; we will show that this leads to a contradiction. Indeed, for any such we have
which implies that
(3.12) |
for all ; but this, together with the hypothesis that , would imply that , which contradicts our assumption that for all we have .
Therefore we obtain the desired conclusion that will enter the interval in some finite time , and will remain inside it for all . ∎
4 Applications of power-engine-load form
We use the power-engine-load form and Theorem 3.8 to prove dynamic ACR in certain reaction networks taken with inflows. The underlying reaction networks have dynamic ACR when there are no inflows or outflows, i.e. when the system is closed. We show that even when certain inflows are included, the property of dynamic ACR persists. Moreover, the ACR value for the open system (with inflows) remains the same in many instances as the ACR value for the closed/isolated system. In Section 4.4, we also consider an application where both inflows and outflows are included, and again given the right conditions the dynamic ACR property persists. In Section 4.7, we consider a simple enzyme catalysis network with a bifunctional enzyme. We show once again that dynamic ACR persists under many different possible inflow conditions. Each individual network requires special analysis in combination with application of Theorem 3.8.
The reaction networks that we consider here have a conserved quantity when the system is closed. When inflows (but not outflows) are included, the total concentration grows in an unbounded manner. This behavior can be realized in a chemostat (for some finite time) but there are also biologically realistic situations where this occurs. For instance, specific ion channels on the surface of a cell might be open and selectively permeable which results in influx of channel-specific ions from outside the cell volume. Our analysis shows that there are invariant quantities even while influxes are ongoing, that is even when the overall system is not near any long-term equilibrium. One variable, the ACR variable, can consistently converge to a robust value even when the overall trajectory does not converge. Robust convergence of one variable when the overall system is far from equilibrium can even occur when inflows and outflows are both present, as shown in Section 4.4. In all these cases, Theorem 3.8 is used to show convergence.
4.1 Motifs of static and dynamic ACR
In [2], we identified the network motifs with two reactions and two species which have both static ACR and dynamic ACR when treated as isolated or closed systems. Each motif represents an entire infinite set of reaction networks. We consider three such motifs shown in Figure 1 and we select one network for each motif. It is shown in [2] that these three are the only motifs (up to interchange of species labels) which have two reactions, two species, and have both properties of static ACR and dynamic ACR.
In each network motif, the arrows represent reactions while the (dashed) line segment joining the two arrow tails is the so-called reactant polytope which plays an important role in the classification of ACR systems [2] – the reactant polytope is parallel to a coordinate axis in all ACR systems with two reactions and two species.
Each static and dynamic ACR motif (with two reactions and two species) has the following properties: the reactant polytope is parallel to a coordinate axis, the two reaction arrows are mutually parallel and they point towards each other. The three motifs are then characterized by the slope of the reaction vectors, which can be positive, zero, or negative. We will refer to the motifs accordingly as “positive/zero/negative slope motif”.
For each motif, we choose a particular network and show that when considered as an open system by allowing inflows, the ACR property is preserved in many cases. One representative of negative slope motif, see (3.2), is often studied as a simple example of a conservative system with static ACR. We show that not only does it have dynamic ACR, it has many other striking robustness properties.
4.2 Positive slope motif
Our first example is a network based on the motif . For this motif, we choose a particular reaction network whose true/non-flow reactions are , and we include the inflows with arbitrary time-dependent rates. So the reaction network is
whose mass action system is
(4.1) | ||||
where .
Theorem 4.1.
Consider the mass action system (4.1) with time-dependent inflow rates and , such that is bounded and
(4.2) |
then .
Proof.
Corollary 4.2.
Consider the mass action system (4.1) with constant inflows . Then .
4.3 Negative slope motif
A representative of the motif was used to illustrate static ACR by Shinar and Feinberg [3]. We show here that this network has even stronger robustness properties than previously known. In particular, even in face of inflows which send the total concentration to infinity, the species with ACR still converges to a finite value, and moreover, the finite value is the same as its ACR value when there are no inflows.
Consider the following open reaction network:
(4.3) | ||||
whose mass action system is
(4.4) | ||||
where .
If and are constant, then the ACR value survives. We give a more general result below, allowing and to be arbitrary functions of time. One implication of the result is that the ACR value survives for arbitrary functions, provided that does not increase too fast.
Theorem 4.3.
Consider the mass action system (4.4) with time-dependent inflow rates and , such that
(4.5) |
and
(4.6) |
then for any .
Proof.
We will first show that . Note that implies that and so .
Define the following invertible change of coordinates:
(4.7) | ||||
In coordinates, the dynamical system (4.4) is:
(4.8) | ||||
The first equation has the solution , which implies that grows monotonically to infinity. It then follows that for any there is a time such that for all we have whenever , because under such assumptions is large enough to imply that the positive term
is much larger than all the negative terms on the right-hand side of the equation for . Moreover, we obtain that if then the solution becomes larger than for all , which implies that , and therefore .
Remark 4.4.
Corollary 4.5.
Consider the mass action system (4.4) with time-dependent inflow rates and , such that is a polynomial of (that takes only positive values). This includes the case of constant inflows. Then for any .
Proof.
Example 4.6.
Consider the following reaction network for some positive integer
(4.10) | ||||
Note that is allowed and corresponds to constant inflow of . For , and so Corollary 4.5 implies that . ∎
Now we consider the case where the inflows are exponentially growing in time.
Example 4.7.
Consider the following reaction network
(4.11) | ||||
The could represent an exponentially growing virus which produces a toxin . The differential equation for is which has the solution (assuming that ) and so the concentrations of and evolve according to:
(4.12) | ||||
Now
which clearly goes to infinity and moreover . By Theorem 4.3, it then follows that
A similar result holds even when both and have exponentially growing inflows. For instance, for the system
(4.13) | ||||
we have that
∎
Remark 4.8.
It is possible to find an explicit solution for the case of arbitrary time-dependent inflow in , and no inflow in . We give such a solution here. One can see from the form of the solution, even though it is explicit, that the limiting value of given in Theorem 4.3 is not obtained easily. Moreover, we emphasize the additional shortcoming that the explicit solution is for the restricted situation of no inflow in .
Consider the following system:
(4.14) |
Let , so has the solution . We can use this to write an ODE in only:
(4.15) |
where .
Theorem 4.9.
Let be an arbitrary function of time and . For any initial value and ,
(4.16) |
has the solution
(4.17) |
for all time where
(4.18) |
and .
Proof.
The proof is a simple verification. From their definitions, and so
so the initial condition is satisfied. We note that and so
and therefore
which completes the verification. ∎
4.4 Negative slope motif with inflows and outflows
We can extend the results in the previous section even to the situation where one or both species are in outflow. We consider the case where both and are in outflow and at equal rates. Outflows with equal rates for all species is a reasonable (and standard) assumption for chemostats. We will allow the inflows to be arbitrary functions of time. Suppose we have the following reaction network:
whose mass action system is:
(4.19) | ||||


Theorem 4.10.
Proof.
We will first show that . Define the following invertible change of coordinates:
In coordinates, the dynamical system (4.19) is
The equation for can be solved explicitly using an integrating factor:
We now show that . By hypothesis, we have that . So for any , there is a such that for . So,
Since is arbitrary, .
Remark 4.11.
In Theorem 4.10, we assumed equal outflows of species and , , a standard assumption for a chemostat. Simulations show that even when this assumption is relaxed and the outflow rates are allowed to be different, the property of dynamic ACR in is preserved. We conjecture that the ACR value is obtained by replacing with , the outflow of species , in the expression for in Theorem 4.10.
Corollary 4.12.
Proof.
Note that
For any , both the numerator and the denominator go to infinity, so the result then follows from applying L’Hospital’s rule. ∎
Example 4.13.
Consider the reaction network (4.10) in Example 4.6 with (so that ), and additionally include outflows so the complete reaction network is
(4.20) | ||||
As earlier, for , . Choose rate constants and initial values so that for . So the concentrations for and follow:
In the notation of Theorem 4.10, and by Corollary 4.12
and so
See left panel of Figure 2 for a representative trajectory. ∎
4.5 A representative of the negative slope motif with stronger robustness properties
Another representative of the negative slope motif has even stronger robustness properties. Consider the following open reaction network:
(4.23) | ||||
whose mass action system is
(4.24) | ||||
where .
Theorem 4.15.
Consider the mass action system (4.24) with time-dependent inflow rates and , such that
(4.25) |
and
(4.26) |
Then for any .
Proof.
The proof is analogous to that of Theorem 4.3. We will first show that . Note that implies that and so . After changing to coordinates defined in (4.7), the dynamical system (4.4) is:
(4.27) | ||||
The first equation has the solution , which implies that grows monotonically to infinity. It then follows that for any there is a time such that for all we have whenever , because under such assumptions is large enough to imply that the positive term
is much larger than all the negative terms on the right-hand side of the equation for . Moreover, we obtain that if then the solution becomes larger than for all , which implies that , and therefore .
Theorem 4.16.
Consider the mass action system (4.24) with time-dependent inflow rates and , such that
(4.29) |
We have that for any if one of the following holds:
-
1.
is bounded,
-
2.
and .
Proof.
Remark 4.17.
When , the limit of cannot be positive. Indeed suppose that , then after some finite time , we have that for some positive constant ,
and the differential equation has a finite time blow up.
Remark 4.18.
Example 4.19.
Consider the following reaction network for some positive integer
(4.30) | ||||
We assumed that the rate constants for some of the equations are for simplicity. The variable satisfies the differential equation , which has an exponentially growing solution, , assuming initially . Then satisfies the differential equation
which has the solution:
assuming that . The ODE system satisfied by the species and is:
(4.31) | ||||
Let , then clearly and
Then, by Theorem 4.16, . ∎
4.6 Zero slope motif
We consider the motif and the following open reaction network:
(4.32) | ||||
whose mass action system is
(4.33) | ||||
where .
Theorem 4.20.
Proof.
The result follows immediately from applying Theorem 3.8. ∎
Remark 4.21.
It is worth contrasting the dynamic ACR properties of the negative slope motif with the other motifs. The negative slope motif has particularly striking robustness properties when inflows are added, which is not the case for the other motifs. This is further argument in favor of the attention that the negative slope motif has attracted, besides having a positive conservation law and being relatively simple in nature.
4.7 Enzyme catalysis with bifunctional enzyme
Bifunctional enzymes are those which have two different (usually opposing) functions, for instance helping both to catalyze production as well as elimination of a substrate [8, 21]. For instance, a bifunctional enzyme might facilitate phosphorylation and when in a different form, facilitate dephosphorylation. Bifunctional enzymes have been shown to play a critical role in generating static absolute concentration robustness [9, 21]. Here we show that an enzyme catalysis network with a bifunctional enzyme can produce dynamic absolute concentration robustness as well.
We consider a mass action system with inflows that results from the reaction network depicted below.
(4.34) | ||||
The system of ODEs for the mass action system is
(4.35) | ||||
We note that the variable is in power-engine-load form:
and therefore is a candidate for dynamic ACR. The key to proving dynamic ACR for different inflows or no inflows is to show that the “power” variable is eventually bounded away from for any initial value. We will do this here for a variety of cases with inflows. When there is no inflow in () and assuming that is a dynamic ACR species, then it is easy to see that the dynamic ACR value must be , the same as its static ACR value. In the case of no inflows (in any species ), one can further show that has dynamic ACR, that is for any positive initial value with , we have that . In other words, every initial value compatible with the hyperplane results in convergence to the hyperplane. We defer the proof of this result to future work because it requires additional ideas not directly related to the main theme of the paper. We focus here on certain interesting inflow cases.
In the theorem below, we show that can converge to the same value even in cases when some (or all) of the inflows are present.
Theorem 4.22.
Consider (4.35) with (while the other inflow rates are arbitrary nonnegative constants). Then .
Proof.
Introduce the invertible change of variables , where and . The new variables satisfy
(4.36) | ||||
where , , as well as and for all . The hypothesis implies that and . The evolution of and is uncoupled from that of and , and is easily seen to have the solution and . So it is natural to think of (4.36) as a two-dimensional non-autonomous system in the variables .
Since the first term of is nonnegative, we have that which is positive for any and so after some finite time, . But this implies that for any sufficiently large , and so is bounded above by some after some finite time.
Now suppose that
Then
which implies that since and .
The result then follows from applying Theorem 3.8. ∎
We now present a case where specific inflows result in converging to a finite value, which is however not the same as (unless ), the ACR value of when there are no inflows.
Theorem 4.23.
Proof.
Introduce the invertible change of variables , where and . The new variables satisfy
(4.37) | ||||
where , , as well as and for all .
Suppose first that for all time. For arbitrary , suppose that . Then we have that
Since , we have that the right hand side is arbitrarily large after some finite time, which implies that .
Now suppose that for some . It is clear that is invariant for any . We may therefore assume, without loss of generality, that for all . For convenience we add to and rewrite the original system (4.35) as
(4.38) | ||||
Let , and so the previous system in terms of and is:
(4.39) |
Note that is equivalent to . Furthermore,
(4.40) | ||||
This shows that either for all time after some finite time has passed, or . We argue that in both cases must converge to a positive limit.
First suppose that . Then and , and so is nondecreasing for any . If , then since is bounded above. But this contradicts . So is bounded above and therefore converges to a positive limit that is greater than . But then from the equation , we have that converges to a positive limit that is greater than .
Now suppose that for all large enough . Then for large enough , so that is increasing. Since is bounded above by , must converge to a positive limit.
We conclude that converges to a positive limit in every case. From the equation , we conclude that converges to a positive limit. If converges to a limit less than , then from , increases without bound because increases without bound. This is a contradiction. Therefore . We may therefore conclude from Theorem 3.8 that
∎
5 Discussion
The property of dynamic ACR depends on global dynamics and this makes it difficult to prove it even in simple systems. It is helpful to have either network conditions or ODE characterizations. Extending our previous work on network motifs which was only in two dimensions, we provide a power-engine-load form applicable in arbitrary dimensions. We give convergence results and apply these to certain network models in the chemostat setting, where inflows and sometimes outflows are present. Even when the overall trajectory does not converge, we show that the ACR variable converges to a definite finite quantity, the so-called ACR value. Moreover, in many cases this is the same value that the system would converge to when taken as a closed system, i.e. without any inflows and outflows.
This work has implications for understanding the dynamics of systems which are far from equilibrium. We focus here on showing dynamic ACR in a few representative examples. In future work, we apply some of these results to analyze more complex and biochemically realistic systems.
Acknowledgments
B.J. was supported by NSF grant DMS-2051498. G.C. was supported by NSF grant DMS-2051568 and by a Simons Foundation fellowship. We thank the referee for careful reading and helpful comments.
References
- [1] Badal Joshi and Gheorghe Craciun. Foundations of static and dynamic absolute concentration robustness. Journal of Mathematical Biology, 85(53), 2022.
- [2] Badal Joshi and Gheorghe Craciun. Reaction network motifs for static and dynamic absolute concentration robustness. SIAM Journal on Applied Dynamical Systems, 22(2):501–526, 2023.
- [3] Guy Shinar and Martin Feinberg. Structural sources of robustness in biochemical reaction networks. Science, 327(5971):1389–1391, 2010.
- [4] Frank D Russo and Thomas J Silhavy. The essential tension: opposed reactions in bacterial two-component regulatory systems. Trends in microbiology, 1(8):306–310, 1993.
- [5] Weihong Hsing, Frank D Russo, Karen K Bernd, and Thomas J Silhavy. Mutations that alter the kinase and phosphatase activities of the two-component sensor EnvZ. Journal of bacteriology, 180(17):4538–4546, 1998.
- [6] Eric Batchelor and Mark Goulian. Robustness and the cycle of phosphorylation and dephosphorylation in a two-component regulatory system. Proceedings of the National Academy of Sciences, 100(2):691–696, 2003.
- [7] Guy Shinar, Ron Milo, María Rodríguez Martínez, and Uri Alon. Input–output robustness in simple bacterial signaling systems. Proceedings of the National Academy of Sciences, 104(50):19931–19935, 2007.
- [8] Uri Alon. An introduction to systems biology: design principles of biological circuits. CRC press, 2019.
- [9] Yuval Hart and Uri Alon. The utility of paradoxical components in biological circuits. Molecular cell, 49(2):213–221, 2013.
- [10] Jinsu Kim and German Enciso. Absolutely robust controllers for chemical reaction networks. Journal of the Royal Society Interface, 17(166):20200031, 2020.
- [11] Fangzhou Xiao and John C Doyle. Robust perfect adaptation in biomolecular reaction networks. In 2018 IEEE conference on decision and control (CDC), pages 4345–4352. IEEE, 2018.
- [12] Daniele Cappelletti, Ankit Gupta, and Mustafa Khammash. A hidden integral structure endows absolute concentration robust systems with resilience to dynamical concentration disturbances. Journal of the Royal Society Interface, 17(171):20200437, 2020.
- [13] Mustafa H Khammash. Perfect adaptation in biology. Cell Systems, 12(6):509–521, 2021.
- [14] Eduardo D Sontag. Adaptation and regulation with signal detection implies internal model. Systems & control letters, 50(2):119–126, 2003.
- [15] Ankit Gupta and Mustafa Khammash. Universal structural requirements for maximal robust perfect adaptation in biomolecular networks. Proceedings of the National Academy of Sciences, 119(43):e2207802119, 2022.
- [16] Badal Joshi and Anne Shiu. A survey of methods for deciding whether a reaction network is multistationary. “Chemical Dynamics” – special issue of Mathematical Modelling of Natural Phenomena, 10(5):47–67, 2015.
- [17] Polly Y Yu and Gheorghe Craciun. Mathematical analysis of chemical reaction systems. Israel Journal of Chemistry, 58(6-7):733–741, 2018.
- [18] David G. Schaeffer and John W. Cain. Ordinary differential equations: Basics and beyond. Springer, 2018.
- [19] John Guckenheimer and Philip Holmes. Nonlinear oscillations, dynamical systems, and bifurcations of vector fields, volume 42. Springer Science & Business Media, 2013.
- [20] Nicolette Meshkat, Anne Shiu, and Angelica Torres. Absolute concentration robustness in networks with low-dimensional stoichiometric subspace. Vietnam Journal of Mathematics, 50:623–651, 2022.
- [21] Badal Joshi and Tung D Nguyen. Bifunctional enzyme provides absolute concentration robustness in multisite covalent modification networks. arXiv preprint arXiv:2304.02679, 2023.