Reaction Network Analysis
of Metabolic Insulin Signaling
Abstract
Absolute concentration robustness (ACR) and concordance are novel concepts in the theory of robustness and stability within Chemical Reaction Network Theory. In this paper, we have extended Shinar and Feinberg’s reaction network analysis approach to the insulin signaling system based on recent advances in decomposing reaction networks. We have shown that the network with 20 species, 35 complexes, and 35 reactions is concordant, implying at most one positive equilibrium in each of its stoichiometric compatibility class. We have obtained the system’s finest independent decomposition consisting of 10 subnetworks, a coarsening of which reveals three subnetworks which are not only functionally but also structurally important. Utilizing the network’s deficiency-oriented coarsening, we have developed a method to determine positive equilibria for the entire network. Our analysis has also shown that the system has ACR in 8 species all coming from a deficiency zero subnetwork. Interestingly, we have shown that, for a set of rate constants, the insulin-regulated glucose transporter GLUT4 (important in glucose energy metabolism), has stable ACR.
Keywords: independent decomposition, metabolic insulin signaling, positive equilibria, reaction network, subnetwork
1 Introduction
Between 2010 and 2015, Shinar and Feinberg published a series of papers based on the novel concepts of absolute concentration robustness (ACR) and concordance, which one may view as the beginnings of a theory of robustness within Chemical Reaction Network Theory (CRNT) [17, 24, 25, 26, 27]. ACR characterizes the invariance of the concentrations of a species at all positive equilibria of a kinetic system and, from experimental observations in Escherichia coli subsystems, the authors extracted sufficient (mathematical) conditions for the property. They related ACR to bifunctionality of enzymes and viewed the condition as a “structural source” [24] or “design principle” [25] of robustness. Concordance, on the other hand, is seen to indicate “architectures that, by their very nature, enforce duller, more restrictive behavior despite what might be great intricacy in the interplay of many species, even independent of values that kinetic parameters might take” [26]. Shinar and Feinberg provided small models of biological systems such as the osmotic pressure response system EnvZ-OmpR of Escherichia coli for ACR and calcium dynamics of olfactory cilia for concordance. The goal of this paper is to explore the extension of their reaction network analysis approach to larger models of biochemical systems based on recent advances in decomposing reaction networks [12, 13, 14] using the example of a widely used model of the insulin signaling system [23].
The insulin signaling system is an important metabolic system that, upon binding of insulin to its receptor at the cell surface, initiates the uptake of glucose into the cell. The analysis of this process in muscle cells, hepatocytes, cells of adipose tissue, and (most recently) neurons is crucial for understanding the underlying mechanisms of insulin resistance. This reduced ability of cells to use available insulin for energy metabolism is viewed as a common factor in diseases such as obesity, type 2 diabetes, metabolic syndrome, and cancer. More recently, brain insulin resistance has received increased attention from neuroscientists in connection with mild cognitive impairment and Alzheimer’s Disease (AD) [2, 22]. Our studies of the metabolic aspects of AD, in fact, provided the motivation for this analysis of a mathematical model of the insulin signaling system [28].
The complexity of the insulin signaling system, both in terms of the number of molecular components involved as well as the intricate combination of positive and negative feedback loops, clearly warrants the application of mathematical modeling and computational tools. A natural starting point for our studies of such models is the seminal work of Sedaghat et al [23]. This widely-cited work has been applied in various contexts and the authors conveniently provided WinPP source files for the system. We utilized the Hars-Tóth criterion presented in [4] to derive a chemical reaction network underlying the system of ordinary differential equations (ODEs) of the Sedaghat et al model, leading to its realization as a mass action system with 20 species, 35 complexes, and 35 reactions.
The first main result of our analysis of the Sedaghat et al system is that the underlying network is concordant. Concordance is a property abstracted from the continuous flow stirred tank reactor model widely used in chemical engineering and its occurrence in complex biological systems is not straightforward. To date, only two smaller systems—the previously-mentioned calcium signaling and the Wnt signaling [8]—have been shown to have the property. Concordance has numerous structural and kinetic consequences including monostationarity for the insulin signaling system (see Section 2.3). A detailed discussion of concordance properties can be found in Chapter 10 of Feinberg’s recent book [8].
The remaining main results derive from the systematic use of decomposition theory.
Decomposition theory was initiated by Feinberg in his 1987 review [7] where he also introduced the important concept of an independent decomposition, a decomposition wherein the stoichiometric subspace of the whole network is the direct sum of the stoichiometric subspaces of the subnetworks. He highlighted its importance by showing that in an independent decomposition the set of positive equilibria of the whole network is the intersection of the equilibria sets of the subnetworks. Hence, if a species has ACR in a subnetwork of an independent decomposition, it also has ACR in the whole network since the latter’s equilibria set is contained in that of the subnetwork. Recent results of Hernandez and De la Cruz [14] provided a criterion and procedure for determining the existence of a nontrivial independent decomposition (the trivial independent decomposition is the network itself).
The second main result is the existence of nontrivial independent decompositions of the network. This property allows insights into structural relationships between positive equilibria of the whole network and its subnetworks. Since the algorithm from Hernandez and De la Cruz [14] determines the finest independent decomposition and independence is invariant under decomposition coarsening, all independent decompositions can be generated from the result. We developed a Matlab code for the said algorithm and applied it to the insulin signaling system.
Third, it is shown that the networks of three functional modules—the insulin receptor binding and recycling subsystem, the postreceptor signaling subsystem, and the GLUT4 translocation subsystem—discussed by Sedaghat et al also form an independent decomposition. These subsystems, hence, not only are functionally but also structurally significant, i.e., positive equilibria of the whole system come from equilibria of these systems. Further details can be found in Section 3.1.
Fourth is the existence of a large weakly reversible, deficiency zero subnetwork constituting a well-understood part of the system and which is also the source of all 8 ACR species.
For the ACR analysis, we implemented the algorithm of Fontanil et al [12] in Matlab and discovered Shinar-Feinberg reaction pairs in appropriate low-deficiency subnetworks of coarsenings of the finest independent decomposition. We found that the system has ACR in 8 (out of 20) species. This restricts the variability of the positive equilibria and suggests that this “structural source of robustness” may be an important factor in the system’s overall robustness, a property which, according to a previous study by Dexter et al [5], is not common in biochemical systems. Overall, however, there is still a high variation in equilibria composition due to the lack of ACR species in the deficiency 7 subnetwork of the network’s deficiency-oriented decomposition. To our knowledge, this is the first large kinetic system for which an ACR assessment has been documented.
The last main result is the discovery of ACR of the essential glucose transporter GLUT4 which, coupled with adequate glucose supply, enables reliable cellular energy production. Further details are discussed in Section 4.3.
The paper is organized as follows: The construction of the metabolic insulin signaling reaction network, as well as its basic properties are described in Section 2. Section 3 discusses the finest nontrivial independent decomposition of the insulin signaling system and its deficiency-oriented coarsening. In Section 4, a brief review of relevant ACR results is followed by ACR analyses based on decompositions of the network. A short summary and the future direction of our research conclude the paper in Section 5. Basic concepts and notations related to CRNT, as well as some detailed computations relevant to the paper, are provided in the Appendix.
2 Model Realization as a Mass Action System
In this section, we present the ODE system of Sedaghat et al [23] and its mass action system realization. We then analyze various properties of the underlying chemical reaction network (CRN), including its positive dependency, -minimality, nonconservativity, and concordance.
2.1 Insulin Signaling Model
We consider the system of ODEs in Sedaghat et al [23] which has only the state variables to . We streamlined the notation to clearly identify the 35 reactions involved in the metabolic insulin signaling network (see Appendix B for the description and units of the variables):
Sedaghat et al used a biochemical map to derive the ODE system and an incomplete extract of the map is shown in their paper. For better visual orientation of the reader, we combined information from the paper’s text and the ODE system to reconstruct the complete biochemical map shown in Figure 1.

2.2 Application of the Hars-Tóth Criterion for Mass Action System Realization
Theorem 4 of Chellaboina et al [4], called the Hars-Tóth criterion, guarantees a mass action system realization such that the ODE system with species and reactions is given by where represents componentwise multiplication, , , , , and is the element of with th component for and .
In the insulin signaling model in Section 2.1, it is easy to check that the function is a multivariate polynomial with nonnegative coefficients for each . For instance, for and , we have
Similar computations for yield the same conclusion. Therefore, by the Hars-Tóth criterion, there is a reaction network of the form such that where and have nonnegative integer entries (see Appendix C for the detailed computation). The CRN corresponding to the insulin signaling model is:
2.3 CRNT Analysis of the Mass Action System: Key Basic Properties
From this point onward, we denote the CRN constructed in the previous section for the metabolic insulin signaling network as with mass action kinetics , stoichiometric subspace , set of species , set of complexes , and set of reactions .
Table 1 presents the network numbers of . These numbers provide a cursory analysis of the structural and dynamical properties of the CRN. Properties inferred by Table 1 include non-weak reversibility (since ), -minimality (since ), branching (since ), and non-point terminality and non-cycle terminality (since and , respectively).
Network numbers | ||
---|---|---|
Species | 20 | |
Complexes | 35 | |
Reactant complexes | 24 | |
Reversible reactions | 10 | |
Irreversible reactions | 15 | |
Reactions | 35 | |
Linkage classes | 13 | |
Strong linkage classes | 24 | |
Terminal strong linkage classes | 13 | |
Rank | 15 | |
Reactant rank | 20 | |
Deficiency | 7 | |
Reactant deficiency | 4 |
Recall that deficiency measures the linear dependence of the network’s reactions, i.e., the higher the deficiency, the higher the linear dependence. The insulin signaling system is of deficiency , indicative of high complexity of the network.
2.3.1 Positive Dependency
CRNToolbox [10] results show that the metabolic insulin signaling network is positive dependent, implying that a set of rate constants exists for which the mass action system can admit a positive equilibrium.
Proposition 1 shows the key implication of positive dependency in a general form for rate constant-interaction map decomposable (RID) kinetic systems (a kinetics is RID if it assigns to each th reaction a function with rate constant and interaction map for ). More information about RID kinetic systems can be found in Nazareno et al [21] where they were introduced. The proposition with the implication of positive dependency was shown for mass action systems by Feinberg [7].
Proposition 1.
For any RID kinetics on a positive dependent network , there are rate constants such that the set of positive equilibria .
Proof.
Since is positive dependent, then for each reaction there is a positive number such that
For a positive vector , by definition of RID kinetics. Set . Then
i.e., . ∎
2.3.2 -minimality
Table 1 shows that there is only one terminal strong linkage class in each linkage class since , i.e., the network is -minimal. Feinberg and Horn [9] showed that this implies the coincidence of the kinetic and stoichiometric subspaces.
The noncoincidence of the kinetic and stoichiometric subspaces is closely related to the degeneracy of equilibria. In [11], the authors showed that if the two subspaces differ, then all equilibria are degenerate. In his book, Feinberg describes anomalies that can occur if the two subspaces do not coincide (Section 3.A.1 of [8]).
Thus, the -minimality of the metabolic insulin signaling network is a necessary condition for the existence of nondegenerate equilibria as detailed in Remark 4.11 of [11].
2.3.3 Nonconservativity
Recall that a reaction network is conservative whenever the orthogonal complement of its stoichiometric subspace contains a strictly positive member of , i.e., . Otherwise, the network is called nonconservative.
The metabolic insulin signaling network has species and rank . Thus, has dimension 5. A basis for is the set
which implies that . Therefore, the metabolic insulin signaling network is nonconservative. The positive implications of this property for ACR will be discussed in Section 4.
2.3.4 Concordance
The most important specific result of the CRNT analysis is the network’s concordance.
Concordance is closely related to weakly monotonic kinetics as shown by Proposition 4.8 of [26]. It shows that, for any weakly monotonic kinetic system, injectivity (and, therefore, the absence of distinct stoichiometrically compatible equilibria, at least one of which is positive) can be precluded merely by establishing concordance of the underlying reaction network. The converse of the said proposition is not true, i.e., there can be a weakly monotonic kinetic system (in fact, a mass action system) that is injective even when its underlying reaction network is not concordant.
Theorem 4.11 of [26] shows that the class of concordant networks is precisely the class of networks that are injective for every assignment of a weakly monotonic kinetics.
In summary, concordance implies injectivity (of the mass action kinetics) and hence monostationarity, i.e., there is at most one positive equilibrium in each stoichiometric compatibility class. We ran the Concordance Test in the CRNToolbox which showed that the metabolic insulin signaling network is concordant. Running the Mass Action Injectivity Test and the Higher Deficiency Test confirms that the kinetics of the insulin signaling system is injective and that the system is monostationary, respectively.
3 Independent Decompositions of the Insulin Signaling System
In this section, we present the finest nontrivial independent decomposition of the metabolic insulin signaling network. We also present a deficiency-oriented coarsening of the decomposition which will be useful in the analysis of the network’s ACR.
3.1 The Finest Nontrivial Independent Decomposition
Hernandez and De la Cruz [14] provide an algorithm for constructing an independent decomposition. Their procedure utilizes a coordinate graph that represents the network using the reaction vectors of the CRN. A nontrivial independent decomposition is generated if the coordinate graph is not connected and, in this case, each connected component of the graph constitutes a partition of the set of reaction vectors of the CRN. Following their procedure, we developed a Matlab code to run the said algorithm and got the independent decomposition consisting of 10 subnetworks:
Furthermore, the independent decomposition obtained is precisely the finest independent decomposition of [16]. The network numbers of the subnetworks are presented in Table 2.
Network numbers | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Species | 7 | 1 | 4 | 3 | 3 | 2 | 3 | 3 | 4 | 1 | |
Complexes | 7 | 2 | 6 | 2 | 4 | 2 | 4 | 4 | 6 | 2 | |
Reactant complexes | 7 | 2 | 3 | 2 | 2 | 2 | 2 | 2 | 4 | 2 | |
Reversible reactions | 5 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | |
Irreversible reactions | 4 | 0 | 3 | 0 | 2 | 0 | 2 | 2 | 2 | 0 | |
Reactions | 14 | 2 | 3 | 2 | 2 | 2 | 2 | 2 | 4 | 2 | |
Linkage classes | 1 | 1 | 3 | 1 | 2 | 1 | 2 | 2 | 3 | 1 | |
Strong linkage classes | 1 | 1 | 6 | 1 | 4 | 1 | 4 | 4 | 5 | 1 | |
Terminal strong linkage classes | 1 | 1 | 3 | 1 | 2 | 1 | 2 | 2 | 3 | 1 | |
Rank | 6 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |
Reactant rank | 7 | 1 | 3 | 2 | 2 | 2 | 2 | 2 | 4 | 1 | |
Deficiency | 0 | 0 | 2 | 0 | 1 | 0 | 1 | 1 | 2 | 0 | |
Reactant deficiency | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
Consider the coarsening where , , and . This decomposition shows the three subsystems considered by Sedaghat et al in the construction of their system: the insulin receptor binding and recycling subsystem (), the postreceptor signaling subsystem (), and the GLUT4 translocation subsystem (). It is significant to note that CRNT analysis using independent decomposition reveals that these subnetworks of the insulin signaling system are not just functionally but also structurally important, i.e., positive equilibria of the whole system come from equilibria of these systems.
Recall that a decomposition is said to be bi-independent if it is both independent and incidence independent.
Proposition 2.
The decomposition is bi-independent.
Proof.
Note that since Proposition 7 of [6] implies that every coarsening is also incidence independent, then every coarsening is bi-independent as well.
3.2 Deficiency-Oriented Coarsening
We next consider a deficiency-oriented coarsening of the independent decomposition. The deficiency-oriented coarsening is where and . Let , , , and be the set of species, set of complexes, kinetics, and stoichiometric subspace, respectively, of for .
In , we consider together all subnetworks of the finest independent decomposition which have a deficiency of 0. On the other hand, we put together all nonzero-deficiency subnetworks in . The network numbers of and are presented in Table 3. Note that the set of common species of the subnetworks is while its set of common complexes .
Network numbers | |||
---|---|---|---|
Species | 13 | 13 | |
Complexes | 13 | 24 | |
Reactant complexes | 13 | 13 | |
Reversible reactions | 9 | 1 | |
Irreversible reactions | 4 | 11 | |
Reactions | 22 | 13 | |
Linkage classes | 3 | 12 | |
Strong linkage classes | 3 | 23 | |
Terminal strong linkage classes | 3 | 12 | |
Rank | 10 | 5 | |
Reactant rank | 12 | 11 | |
Deficiency | 0 | 7 | |
Reactant deficiency | 1 | 2 |
The two subnetworks contrast in further properties besides deficiency: is weakly reversible and nonconservative, while is not weakly reversible and conservative. However, they are both -minimal and concordant (hence monostationary). The Deficiency Zero Theorem for mass action systems, in fact, guarantees that has a unique complex balanced equilibrium in every stoichiometric compatibility class. Because is not weakly reversible, it has no complex balanced equilibria and there may be stoichiometric compatibility classes without an equilibrium.
Lemma 3 paves the way for the usefulness of the deficiency-oriented decomposition.
Lemma 3.
Let be a CRN. If is an independent decomposition of with , , and the set of species, stoichiometric subspace, and kinetics, respectively, of for , then:
-
If , then for , the projection maps induce an isomorphism of where ; and
-
If , let be the projection to . Then is in if and only if , .
Proof.
Let . It is well-defined because we have the following: . Since , if the projections are in and , respectively, showing the injectivity. Furthermore, the number of species (since ) and the rank (due to direct sum). Hence, the domain and codomain have the same dimensions, showing the isomorphism.
This follows directly from Feinberg’s Decomposition Theorem that if a decomposition is independent, then . ∎
Remark 2.
- 1.
-
2.
Although statement of Lemma 3 is an easy consequence of Feinberg’s Decomposition Theorem, it turns out to be useful in cases where at least one of the subnetworks has a well-understood set of positive equilibria, as in the case of the metabolic insulin signaling network. This is shown in Proposition 4 and Example 3.2.
Proposition 4.
Let be the metabolic insulin signaling network and its deficiency-oriented decomposition. Then:
-
The map given by is injective.
-
The map given by is surjective.
-
if and only if there is such that .
Proof.
is equivalent to the statement that is monostationary. follows from the fact that the map is the composition of (surjective due to the Deficiency Zero Theorem) and the surjective map . Finally, is the application of statement of Lemma 3 to the metabolic insulin signaling network. ∎
Example 1. The following example illustrates the use of statement of Proposition 4.
First, we express the positive equilibria of in terms of the rate constants:
Observe that in subnetwork , the equilibria of , , and are independent of the rate constants. Note also that there are restrictions on the rate constant values since the ’s have to be positive. Using the rate constants from [23], we obtain a positive equilibrium for :
Next, we substitute the values of the species common to and into the ODEs for and look for a positive solution (this implements statement of Proposition 4):
Solving , we get the following equilibrium for the other species in :
Note that the equilibrium values of , , and depend on any values of and . If we (randomly) choose and , we get the following:
Remark 3.
Example 3.2 provides an alternative method for solving for positive equilibria using smaller subnetworks instead of the (more complex) entire network.
4 ACR of Species in Insulin Signaling
ACR denotes the invariance of the concentrations of a species at all positive equilibria of a kinetic system. Shinar and Feinberg introduced the concept in 2010 [24] and, from experimental observations in Escherichia coli subsystems, extracted sufficient (mathematical) conditions for the property. In this section, after a brief review of relevant results on ACR, we present an analysis of the property in the insulin signaling system.
4.1 Absolute Concentration Robustness
A pair of reactant complexes is a Shinar-Feinberg pair (SF-pair) in species if their kinetic order vectors (i.e., the corresponding row in the kinetic order matrix) differ only in . In mass action systems, the stoichiometric coefficients of the complexes play the role of the kinetic order vectors.
An SF-pair is called nonterminal if both complexes are not in terminal strong linkage classes. The pair is said to be linked if both complexes are in a linkage class.
Proposition 5.7 of [18] presents a framework for ACR using SF-pairs. A special case of condition of the said proposition is any weakly reversible power law system with reactant-determined kinetics, zero deficiency, and a linked SF-pair in . A proof of ACR in in this case was already provided in Theorem 6 in the Appendix of [13]. We refer the reader to [18] for the detailed discussion of positive equilibria log-parametrized systems and a proof of the general framework. We apply Proposition 5.7 of [18] only in the special case of the deficiency zero subnetwork of the metabolic insulin signaling network.
We will often call subnetworks with the property or of Proposition 5.7 of [18] “(low deficiency) ACR building blocks”. A computational approach to the framework was developed in [12]. For the ACR analysis, we implemented this algorithm using Matlab.
Another theorem that we will apply to the ACR analysis of the metabolic insulin signaling network is Theorem 5.5 of [20] regarding the stable ACR for one-dimensional networks which we will refer to as the “Meshkat et al criterion”. As defined by Meshkat et al [20], a kinetic system has stable ACR in a species (for a set of rate constants) if all the steady states of the kinetic system (for the set of rate constants) are stable.
Remark 4.
The sufficient conditions for ACR in a species in the works of Lao et al [18] and Meshkat et al [20] establish the property for all rate constants for which the system has a positive equilibrium. Meshkat et al have proposed the convention of “vacuous ACR” for the case in which no positive equilibrium exists: in such a scenario, ACR in all species is assumed. This enables the more convenient terminology that the above sufficient conditions provide ACR “for all rate constants” and we adopt this terminology in the following analysis.
4.2 ACR Analysis of Rank 1 Subnetworks of the Finest Independent Decomposition
The finest independent decomposition using the Hernandez-De la Cruz algorithm consists of one subnetwork of rank 6 () and 9 subnetworks of rank 1 () (see Table 2). It is natural to first try to apply the ACR criterion of Meshkat et al to the latter set of subnetworks.
Condition of the Meshkat et al criterion says that all reactions, taken pairwise, must be SF-pairs in species . Table 4 shows the result of the verification.
Subnetwork | Reactions | Non-SF-pair, e.g. | satisfied for species |
, | none | Yes for | |
, , | , | No | |
, | , | No | |
, | , | No | |
, | , | No | |
, | , | No | |
, | , | No | |
, , , | , | No | |
, | none | Yes for |
Subnetworks and satisfy condition of the Meshkat et al criterion as well since they each consist of a reversible pair and are identical to the required embedded network. Hence, and have ACR for all rate constants in the whole network since the decomposition is independent (see Proposition 4.4 of [18]).
Remark 5.
-
1.
The Meshkat et al criterion ensures stability of the equilibria only within the subnetworks and not for the whole network so we cannot infer any claim about the property for and .
-
2.
In a similar vein, non-ACR for a species in the subnetwork does not necessarily imply non-ACR in the whole network since the set of positive equilibria of the latter is generally smaller than that of the former.
4.3 ACR Analysis of Subnetworks in the Deficiency-Oriented Independent Decomposition
Implementing the algorithm of Fontanil et al [12] and using Proposition 5.7 of [18], we discover Shinar-Feinberg reaction pairs in appropriate low-deficiency subnetworks of coarsenings of the finest independent decomposition in Section 3.1. We find that the system has ACR in 8 species (from the zero-deficiency building blocks): , , , , , , , . The other species are not identified as having ACR because the reactant complexes of their associated SF-pairs are not nonterminal in the subnetwork generated by the building block. Table 5 provides an overview.
It is particularly significant that the system’s output to glucose energy metabolism () has ACR. GLUT4 is a key transporter of glucose into neurons. Under healthy conditions (i.e., no insulin resistance), the insulin signaling system works such that GLUT4, which determines the amount of glucose transported into a cell, is held constant. GLUT4, coupled with adequate glucose supply, enables reliable cellular energy production. Keeping the value of GLUT4 is very important for glucose energy metabolism, showing real robustness in the system. Energy processing of neurons works properly due to this robustness.
Species | SF-pair | ACR building block | Deficiency | Comments |
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair | ||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 1 | |||
, | 0 | linked SF-pair | ||
, | 0 | linked SF-pair |
Remark 6.
The ACR in 8 species of the network is inferred from ACR in the deficiency zero subnetwork . A necessary condition for this occurrence is the nonconservativity of . If were conservative, i.e., there was a positive vector in , then . Hence, would be a conservative deficiency zero mass action network and have no ACR in any species (Theorem 9.7.1 of [8]).
4.4 ACR Analysis of the Metabolic Insulin Signaling Network for a Set of Rate Constants
Table 5 shows that there are SF-pairs in deficiency one subnetworks in further independent coarsenings of the metabolic insulin signaling network. The failure of the three sufficient conditions for ACR for all rate constants (Meshkat et al criterion) led us to suspect that the remaining species (i.e., , , , , , and ) do not have this property. The test is done using the set of rate constants available from [23].
Example 3.2 in Section 3.2 presents a positive equilibrium of the metabolic insulin signaling network. It is evident from the example that positive equilibria for the metabolic insulin signaling network have the same value for and . For the other 12 species, their equilibrium value is dependent on the following variables: , , , , and . This suggests that there are infinitely many possible positive equilibria.
Our computations verify that, for the set of rate constants used above, species and have stable ACR while the remaining species do not have ACR (since the 5 species identified as “independent variables” can take various values and the remaining species will vary according to the variation of the variables).
These computations indeed confirm that species , , , , , and do not have ACR for all rate constants.
Remark 7.
The number of species exhibiting ACR (which we call “ACR species” for short) is an inverse measure of the variation in the equilibria composition: the more ACR species there are, the less the variation. An extreme case is ACR in all species, which is equivalent to the system having a unique equilibrium (in the entire species space). With 8 ACR species among 20, the metabolic insulin signaling network has a fairly high variation in equilibria composition. The deficiency-oriented decomposition reveals the source of this variation. The deficiency zero subnetwork contains all the ACR species. Furthermore, since the insulin signaling system is a log-parametrized system, it follows from the results of Lao et al [18] that the number of ACR species (among the total 13 species in the subnetwork) is bounded by the subnetwork’s rank (). This shows that the high variation in equilibria composition is caused primarily by the lack of ACR species among the 13 species in the deficiency 7 subnetwork .
5 Summary and Outlook
The insulin signaling system is an important metabolic system. In this study, we derived a CRN of the Sedaghat et al insulin signaling model with 20 species, 35 complexes, and 35 reactions. We have shown that it is a nonconservative, non-weakly reversible, and high deficiency () system. The positive dependence of the reaction network ensures the existence of rate constants under which the mass action system has positive equilibria (Proposition 1). Additionally, the network’s -minimality implies that the kinetic and stoichiometric subspaces coincide, which is necessary for the existence of nondegenerate equilibria. Moreover, the network is concordant, which implies that the system’s species formation rate function, when restricted to any stoichiometric compatibility class, is injective. It follows, then, that the kinetic system is monostationary, i.e., there is at most one positive equilibrium in each stoichiometric compatibility class.
We obtained the finest independent decomposition of the metabolic insulin signaling network consisting of 10 subnetworks which we have shown to be bi-independent (Proposition 2). CRNT analysis using a coarsening of the decomposition revealed three subnetworks of the metabolic insulin signaling network which are not only functionally but also structurally important. Upon considering a deficiency-oriented coarsening of the finest decomposition, we have shown how a binary decomposition can be viewed in relation to a network’s set of positive equilibria (Lemma 3). We have also developed a method of determining positive equilibria of the metabolic insulin signaling network using its deficiency-oriented coarsening (Proposition 4). This provides an alternative method for solving positive equilibria analytically using smaller subnetworks instead of the (more complex) entire network.
For the ACR analysis, we have shown that subnetworks and satisfy the Meshkat et al criterion, but species and (which come from the said subnetworks) have ACR for all rate constants only in their respective subnetwork. This implies that the stability of the equilibria is only within the subnetworks and not for the whole network. Upon implementing the algorithm of Fontanil et al [12], however, we found that the system had ACR in 8 species. This restricts the variability of the positive equilibria and also suggests that this “structural source of robustness” may be an important factor in the system’s overall robustness. However, overall there is still a high variation in equilibria composition due to the lack of ACR species in the deficiency 7 subnetwork of the network’s deficiency-oriented coarsening. For the rate constants used in the study of Sedaghat et al [23], we have verified that species , and indeed have stable ACR. Interestingly, , i.e., the insulin-regulated glucose transporter GLUT4, plays an important role in glucose energy metabolism.
Our analysis of the Sedaghat et al model is the first part of a two-step research effort on metabolic insulin signaling. In their paper, Sedaghat et al constructed the model from data of healthy cells. As a second step, we have started a reaction network analysis of a model of metabolic insulin signaling by Brännmark et al [3] based on cell data from type 2 diabetes patients, i.e., cells with insulin resistance. Preliminary results already indicate significant differences to our main results on the Sedaghat et al model [19].
References
- [1] Arceo C, Jose E, Lao A, Mendoza E (2017) Reaction networks and kinetics of biochemical systems. Math Biosci 283:13–29. https://doi.org/10.1016/j.mbs.2016.10.004
- [2] Arnold S, Arvanitakis Z, Macauley-Rambach S, Koenig A, Wang H, Ahima R, Craft S, Gandy S, Buettner C, Stoeckel L, Holtzman D, Nathan D (2018) Brain insulin resistance in type 2 diabetes and Alzheimer disease: concepts and conundrums. Nat Rev Neurol 14(3):168–181. https://doi.org/10.1038/nrneurol.2017.185
-
[3]
Brännmark C, Nyman E, Fagerholm S, Bergenholm L, Ekstrand E, Cedersund G, Strålfors P (2013) Insulin signaling in type 2 diabetes: experimental and modeling analyses reveal mechanisms of insulin resistance in human adipocytes. J Biol Chem 288(14):9867–9880.
https://doi.org/10.1074/jbc.m112.432062 -
[4]
Chellaboina V, Bhat S, Haddad W, Bernstein D (2009) Modeling and analysis of mass-action kinetics. IEEE Control Syst 29(4):60–78.
https://doi.org/10.1109/MCS.2009.932926 -
[5]
Dexter J, Dasgupta T, Gunawardena, J (2015) Invariants reveal multiple forms of robustness in bifunctional enzyme systems. Integr Biol 7(8):883–894.
https://doi.org/10.1039/c5ib00009b - [6] Fariñas H, Mendoza E, Lao A (2021) Chemical reaction network decompositions and realizations of S-systems. Philipp Sci Lett 14(1):147–157
- [7] Feinberg M (1987) Chemical reaction network structure and the stability of complex isothermal reactors: I. The deficiency zero and deficiency one theorems. Chem Eng Sci 42(10):2229–2268. https://doi.org/10.1016/0009-2509(87)80099-4
-
[8]
Feinberg M (2019) Foundations of chemical reaction network theory. Springer, Switzerland,
https://doi.org/10.1007/978-3-030-03858-8 -
[9]
Feinberg M, Horn J (1977) Chemical mechanism structure and the coincidence of the stoichiometric and kinetic subspaces. Arch Ration Mech Anal 66(1):83–97.
https://doi.org/10.1007/bf00250853 - [10] Feinberg M, Ellison P, Ji H, Knight D (2018) The Chemical Reaction Network Toolbox Version 2.35. https://doi.org/10.5281/zenodo.5149266
- [11] Feliu E, Wiuf C (2012) Preclusion of switch behavior in networks with mass-action kinetics. Appl Math Comput 219(14):1449–1467. https://doi.org/10.1016/j.amc.2012.07.048
- [12] Fontanil L, Mendoza E, Fortun N (2021) A computational approach to concentration robustness in power law kinetic systems of Shinar-Feinberg type. MATCH Commun Math Comput Chem 86(3):489–516
- [13] Fortun N, Mendoza E (2021) Absolute concentration robustness in power law kinetic systems. MATCH Commun Math Comput Chem 85(3):669–691
- [14] Hernandez B, De la Cruz R (2021) Independent decompositions of chemical reaction networks. Bull Math Biol 83(76):1–23. https://doi.org/10.1007/s11538-021-00906-3
- [15] Hernandez B, Mendoza E (2021) Positive equilibria of Hill-type kinetic systems. J Math Chem 59:840–870. https://doi.org/10.1007/s10910-021-01230-w
-
[16]
Hernandez B, Amistas D, De la Cruz R, Fontanil L, de los Reyes V A, Mendoza E (2022) Independent, incidence independent and weakly reversible decompositions of chemical reaction networks. MATCH Commun Math Comput Chem 87(2):367–396.
https://doi.org/10.46793/match.87-2.367H -
[17]
Knight D, Shinar G, Feinberg M (2015) Sharper graph-theoretical conditions for the stabilization of complex reaction networks. Math Biosci 262:10–27.
https://doi.org/10.1016/j.mbs.2015.01.002 -
[18]
Lao A, Lubenia P, Magpantay D, Mendoza E (2022) Concentration robustness in LP kinetic systems. MATCH Commun Math Comput Chem 88(1):29–66.
https://doi.org/10.46793/match.88-1.029L - [19] Lubenia P, Mendoza E, Lao A (2022) Comparison of kinetic realizations of insulin signaling systems (in preparation)
-
[20]
Meshkat N, Shiu A, Torres A (2021) Absolute concentration robustness in networks with low-dimensional stoichiometric subspace. Vietnam J Math
https://doi.org/10.1007/s10013-021-00524-5 - [21] Nazareno A, Eclarin R, Mendoza E, Lao A (2019) Linear conjugacy of chemical kinetic systems. Math Biosci Eng 16(6):8322–8355. https://doi.org/10.3934/mbe.2019421
- [22] Neth B, Craft S (2017) Insulin resistance and Alzheimer’s disease: Bioenergetic linkages. Front Aging Neurosci 9(345):1–20. https://doi.org/10.3389/fnagi.2017.00345
-
[23]
Sedaghat A, Sherman A, Quon M (2002) A mathematical model of metabolic insulin signaling pathways. Am J Physiol Endocrinol Metab 283(5):E1084–E1101.
https://doi.org/10.1152/ajpendo.00571.2001 - [24] Shinar G, Feinberg M (2010) Structural sources of robustness in biochemical reaction networks. Science 327(5971):1389–1391. https://doi.org/10.1126/science.1183372
-
[25]
Shinar G, Feinberg M (2011) Design principles for robust biochemical reaction networks: What works, what cannot work, and what might almost work. Math Biosci 231(1):39–48.
https://doi.org/10.1016/j.mbs.2011.02.012 - [26] Shinar G, Feinberg M (2012) Concordant chemical reaction networks. Math Biosci 240(2):92–113. https://doi.org/10.1016/j.mbs.2012.05.004
- [27] Shinar G, Feinberg M (2012) Concordant chemical reaction networks and the species-reaction graph. Math Biosci 241(1):1–23. https://doi.org/10.1016/j.mbs.2012.08.002
-
[28]
Villasis O, Tan D, Mendoza E, Lao A (2022) Systems biology approach of understanding insulin resistance: Linkage between type 2 diabetes & Alzheimer’s disease.
bioRxiv 2022.04.13.463890
Appendix A Notations and Definition of Terms
In this section, we lay the foundation of Chemical Reaction Network Theory (CRNT) by discussing the definition of terms used in the paper. After discussing the fundamentals of chemical reaction networks and kinetic systems, we review important terminologies related to decomposition theory.
A.1 Chemical Reaction Networks
A chemical reaction network (CRN) is a triple of nonempty finite sets , , and of species, complexes, and reactions, respectively, where and satisfying the following:
-
()
for any ; and
-
()
For each , there exists such that or .
Given a set , refers to the vector space of real-valued functions with domain . If is a vector in , we use the symbol to denote the number that assigns to . In the context of a CRN, , , and are referred to as the species space, complex space, and reaction space, respectively.
In a CRN, we denote the species as . This way, can be identified with the vector in with 1 in the th coordinate and zero elsewhere. We denote the reactions as . We denote the complexes as where the manner in which the complexes are numbered play no essential role. A complex is given as or as the vector . The coefficient is called the stoichiometric coefficient of species in complex . Stoichiometric coefficients are all nonnegative numbers. We define the zero complex as the zero vector in . A reaction is called an inflow reaction while a reaction is called an outflow reaction. The ordered pair corresponds to the familiar notation which indicates the reaction where complex reacts to complex . We call the reactant complex and the product complex. We denote the number of reactant complexes as . A reaction is called reversible if it is accompanied by its reverse reaction . Otherwise, it is called irreversible.
Example A.1. Consider the reaction
, , and are the species, the reactant complex is , and is the product complex. The stoichiometric coefficients are 2, 1, and 2 for , , and , respectively.
Let be a CRN. For each reaction , we associate the reaction vector . The linear subspace of spanned by the reaction vectors is called the stoichiometric subspace of , defined as . The rank of is given by , i.e., the rank of the network is the rank of its set of reaction vectors. In this paper, we sometimes use the notation where we loosely use the notation to refer to either reaction or its corresponding reaction vectors.
Two vectors are said to be stoichiometrically compatible if is an element of the stoichiometric subspace . Stoichiometric compatibility is an equivalence relation that induces a partition of or into equivalence classes called the stoichiometric compatibility classes or positive stoichiometric compatibility classes, respectively, of the network. In particular, the stoichiometric compatibility class containing is the set where is the left coset of containing . Similarly, the positive stoichiometric compatibility class containing is the set .
The molecularity matrix is an matrix whose entry is the stoichiometric coefficient of species in complex . The incidence matrix is an matrix whose entry is defined as follows:
The stoichiometric matrix is the matrix given by . The columns of are the reaction vectors of the system. From the definition of stoichiometric subspace, we can see that is the image of , written as . Observe that .
Example A.2. Consider the following CRN:
The set of species and complexes are and , respectively. Thus, there are species, complexes, reactant complexes, and reactions. The network’s molecularity matrix, incidence matrix, and stoichiometric matrix are as follows:
The network has rank .
CRNs can be viewed as directed graphs where the complexes are represented by vertices and the reactions by edges. The linkage classes of a CRN are the subnetworks of its reaction graph where for any complexes and of the subnetwork, there is a path between them. The number of linkage classes is denoted by . The linkage class is said to be a strong linkage class if there is a directed path from to , and vice versa, for any complexes and of the subnetwork. The number of strong linkage classes is denoted by . Moreover, terminal strong linkage classes, the number of which is denoted as , are the maximal strongly connected subnetworks where there are no edges (reactions) from a complex in the subgraph to a complex outside the subnetwork. Complexes belonging to terminal strong linkage classes are called terminal; otherwise, they are called nonterminal.
In Example A.1, the number of linkage classes is : ; the number of strong linkage classes is : ; and the number of terminal strong linkage classes is : . and are terminal complexes while and are nonterminal complexes.
A CRN is called weakly reversible if , -minimal if , point terminal if , and cycle terminal if . The deficiency of a CRN is given by .
For a CRN , the linear subspace of generated by the reactant complexes is called the reactant subspace of , defined as . The reactant rank of is given by , i.e., the reactant rank of the network is the rank of its set of complexes. The reactant deficiency of is given by .
To make sense of the reactant subspace , write the incidence matrix as where consists only of the 0’s and 1’s in while contains only the 0’s and absolute values of the ’s. We form the reactant matrix (size ) given by . The columns of contains the reactant complexes of the system. From the definition of reactant subspace, we can see that is the image of , written as . Observe that .
The incidence matrix of the network in Example A.1 can be written as
allowing us to form the reactant matrix
The network has reactant rank and reactant deficiency .
A.2 Chemical Kinetic Systems
A kinetics for a CRN is an assignment to each reaction of a rate function such that
The system is called a chemical kinetic system (CKS). The support of complex is , i.e, it is the set of all species that have nonzero stoichiometric coefficients in complex .
A kinetics gives rise to two closely related objects: the species formation rate function and the associated ordinary differential equation system.
The species formation rate function (SFRF) of a CKS is given by
where is the vector of species in and is the rate function assigned to reaction . The SFRF is simply the summation of the reaction vectors for the network, each multiplied by the corresponding rate function. The kinetic subspace for a CKS is the linear subspace of defined by Note that the SFRF can be written as where the vector of rate functions. The equation is the ordinary differential equation (ODE) system or dynamical system of the CKS.
The ODE system of the CRN in Example A.1 can be written as
A zero of the SFRF is called an equilibrium or a steady state of the system. If is differentiable, an equilibrium is called degenerate if where is the Jacobian of evaluated at and Ker is the kernel function; otherwise, the equilibrium is said to be nondegenerate.
A vector is called complex balanced if is contained in where is the incidence matrix. Furthermore, if is a positive equilibrium, then we call it a complex balanced equilibrium. A CKS is called complex balanced if it has a complex balanced equilibrium.
The reaction vectors of a CRN are positively dependent if, for each reaction , there exists a positive number such that
A CRN with positively dependent reaction vectors is said to be positive dependent. Shinar and Feinberg [26] showed that a CKS can admit a positive equilibrium only if its reaction vectors are positively dependent. The set of positive equilibria of a CKS is given by
A CRN is said to admit multiple (positive) equilibria if there exist positive rate constants such that the ODE system admits more than one stoichiometrically compatible equilibria. Analogously, the set of complex balanced equilibria of a CKS is given by
Let be an matrix of real numbers. Define by for . A power law kinetics (PLK) assigns to each th reaction a function
with rate constant and kinetic order . The vector is called the rate vector and the matrix is called the kinetic order matrix. We refer to a CRN with PLK as a power law system. The PLK becomes the well-known mass action kinetics (MAK) if the kinetic order matrix consists of stoichiometric coefficients of the reactants. We refer to a CRN with MAK as a mass action system.
In the ODE system of Example A.1, we assumed PLK so that the kinetic order matrix is
where . If we assume MAK, the kinetic order matrix is
The reactions are called branching reactions if they have the same reactant complex. One way to check if we have identified all branching reactions is through the formula
where is the reactant complex in , is the set of branching reactions of , and is the cardinality of . if and only if all reactant complexes are nonbranching. A CRN is called branching if .
We can classify a power law system based on the kinetic orders assigned to its branching reactions. A power law system has reactant-determined kinetics (of type PL-RDK) if, for any two branching reactions , their corresponding rows of kinetic orders in are identical, i.e., for . Otherwise, a power law system has non-reactant-determined kinetics (of type PL-NDK). From Proposition 12 in Arceo et al [1], a nonbranching power law system is PL-RDK.
Note that the stoichiometric subspace is just the set of all linear combinations of the reaction vectors, i.e., the set of all vectors in can be written in the form
Let be the linear map defined by
is the set of all vectors such that .
We say that a CRN is concordant if there do not exist an and a nonzero having the following properties:
-
()
For each such that , contains a species for which where denotes the term in involving the species and is the signum function.
-
()
For each such that , either for all , or else contains species and for which , but not zero.
A network that is not concordant is discordant.
A CKS is injective if, for each pair of distinct stoichiometrically compatible vectors , at least one of which is positive,
Clearly, an injective kinetic system cannot admit two distinct stoichiometrically compatible equilibria, at least one of which is positive.
A kinetics for a CRN is weakly monotonic if, for each pair of vectors , the following implications hold for each reaction such that and :
-
()
implies that there is a species with .
-
()
implies that for all or else there are species with and .
We say that a CKS is weakly monotonic when its kinetics is weakly monotonic.
Example A.3. Every MAK is weakly monotonic.
A.3 Decomposition Theory
A covering of a CRN is a collection of subsets whose union is . A covering is called a decomposition of if the sets form a partition of . defines a subnetwork of where such that consists of all complexes occurring in and has all the species occurring in . In this paper, we will denote a decomposition as a union of the subnetworks: . We refer to a “decomposition” with a single “subnetwork” as the trivial decomposition. Furthermore, when a network has been decomposed into subnetworks, we can refer to the said network as the parent network.
The most widely used decomposition of a reaction network is the set of linkage classes. Linkage classes have the special property that they not only partition the set of reactions but also the set of complexes.
A decomposition is independent if the parent network’s stoichiometric subspace is the direct sum of the subnetworks’ stoichiometric subspaces . Equivalently, the sum is direct when the rank of the parent network is equal to the sum of the ranks of the individual subnetworks, i.e.,
A network decomposition is a refinement of (and the latter a coarsening of the former) if it is induced by a refinement of .
Example A.4. If and , then
-
•
is a refinement of ; and
-
•
is a coarsening of .
A decomposition is said to be incidence independent if its incidence matrix is the direct sum of the incidence matrices of the subnetworks. Consider the network decomposition . If () has () complexes and () linkage classes, then incidence independence is equivalent to
Despite its early founding by Feinberg in 1987, decomposition theory has received little attention in the Chemical Reaction Network Theory (CRNT) community. Recently, however, its usefulness expanded beyond results on equilibria existence and parametrization, e.g., in the relatively new field of concentration robustness. Interesting results for large and high deficiency systems have been derived for more general kinetic systems such as power law systems [12, 13] and Hill-type systems [15].
Appendix B Variable Descriptions and Units
The following are the variables used in the metabolic insulin signaling network together with their descriptions and unit of measurement:
Appendix C Determining the CRN of the Metabolic Insulin Signaling Network
In Section 2.2, it is determined by the Hars-Tóth criterion that there is a reaction network of the form such that where and have nonnegative integer entries. In this section, we show the detailed computation on how to get matrices and .
To determine matrix , we write
which gives us
To get , observe first that we can write the ODE system as
providing us with
allowing us to easily get :
Matrices and are used to determine the CRN corresponding to the ODE system in Section 2.1.
Appendix D Generalization of Lemma 3
In this section, we present two propositions related to Lemma 3 in Section 3.2. The first can be viewed as a corollary of statement of Lemma 3. The rest of the section leads to a generalization of this corollary to the case of a nonempty intersection of the species sets.
Proposition 5.
Let be a CRN with kinetics and subsets and such that . If , then for any kinetics, if each subsystem has an equilibrium in every stoichiometric class, then so does . If the equilibria are unique positive equilibria, the same holds for .
Proof.
By Feinberg’s Decomposition Theorem, any equilibrium of the whole system is also an equilibrium in each subnetwork. Hence, such an equilibrium in a stoichiometric compatibility class corresponds to its projection pair in the subnetwork stoichiometric compatibility classes. ∎
The next proposition describes the relationship between the stoichiometric classes of a CRN and those of a binary decomposition. This lays the foundation for the generalization of statement of Lemma 3 to the nonempty intersection case.
Proposition 6.
Let be a decomposition and , , and the corresponding stoichiometric subspaces. Let be the linear map and the linear map . Then
-
is surjective.
-
-
If, in addition, the decomposition is independent, then
-
is an isomorphism.
-
Proof.
It is easily verified that the maps are well-defined.
For any , write where and . Let where (the projection map is defined in statement of Lemma 3). Then .
By definition, we have . This implies that where . Therefore, . Conversely, implies that .
Clearly, . On the other hand, for any and any , and . Hence, .
and since the sum is direct.
Suppose the intersection is nonempty with common elements and . Then and implying that since the sum is direct. ∎
Hence, for any binary independent decomposition, we have
Since where and are the numbers of species in and , respectively, we have
where ( is the number of common species). Since is an isomorphism between and , we have
This reduces to statement of Lemma 3 when .