Introduction

Various biological systems have been understood by employing mathematical approaches. Dynamical behaviors of biological systems are understood from interactions between biomolecules using mathematical models. For example, diversity of cell types and transition between them have been understood as bifurcation of dynamics of biological systems. Bifurcation is a phenomenon where the equilibria (or, more generally, the attractors) of a dynamical system undergo qualitative changes in response to continuous changes in system parameters.

Accumulated evidence has shown the connections between bifurcation theory and biological phenomena. For instance, Ozbudak et al. found that in Escherichia coli, the expression level of lactose permease (LacY), which is responsible for the cellular uptake of lactose and its analogues (e.g., TMG), switched significantly in response to continuous changes in the nutrient environment1. Ozbudak et al. developed a simple mathematical model and found that the jumps in LacY expression can arise from transitions between different steady states associated with the passage of a saddle-node bifurcation point. In this case, not only does the bifurcation create distinct cellular states, but it also creates a situation in which the transitions between these states are reversible, but the nutrient concentration thresholds that trigger the transitions are different in a state-dependent manner.

Another biological example associated with bifurcation is the polarization of macrophages. Macrophage is a type of white cell that can be polarized toward either an M1 (pro-inflammatory) or an M2 (anti-inflammatory) phenotype2. M1 and M2 macrophages can coexist under some microenvironmental conditions, which indicates that the dynamics of the polarization features the existence of alternative steady states3. Moreover, it has been known that a macrophage has the ability to switch its phenotype in response to stimuli4,5,6,7. These facts indicate that the dynamics of macrophage polarization allow transition between multiple steady states in response to parameter changes.

Bifurcation analyses of biological systems are mostly done in a heuristic manner. The analysis first starts from the construction of a mathematical model for the system under consideration, and then it is followed by the identification of equilibria in correspondence to given parameters. For a biological system, an analytical solution to determine the equilibrium point(s) by a function of parameters is not always technically available. Hence, to probe the bifurcation of a complex system, the equilibrium points are numerically determined while a parameter of the system is varying. This profiling step may capture bifurcation phenomena by chance; nonetheless, it is usually not known in advance that change in which of the numerous parameters can trigger a bifurcation. Also, it is not known in advance under what parameter condition bifurcation will occur, or which of the many variables will exhibit bifurcation behaviors.

The Jacobian matrix, denoted by J, plays a crucial role in the study of equilibrium bifurcations, as it takes the value of zero at a bifurcation point. Exploiting this property, a series of studies has provided fruitful findings that correlate the graphic representation of the network and the Jacobian determinant8,9,10. In addition, it has been shown that the number of alternative states can be even concluded from the sign of the Jacobian determinant11,12. While the Jacobian matrix can help identify the onset of a bifurcation, a numerical approach is still required unless the matrix is explicitly defined as a function of parameters. In practice, for large networked systems, conducting a bifurcation analysis remains challenging.

To cope with the practical problems of bifurcation analysis rooted in the application of the Jacobian determinant, Okada et al. developed Structural Bifurcation Analysis (SBA) by which the equilibrium bifurcation of a chemical reaction system is analyzed only from the structural information of the network13,14. Structural Bifurcation Analysis is based on a matrix \(\varvec{A}\) determined by the network structure and a proved fact that \(\det {\varvec{A}}=0\) only when \(\det {J}=0\). This approach circumvents the problem that, without the functional form of reaction rate functions, the equilibria are not explicitly available for a bifurcation analysis. Nonetheless, a great deal about the possible bifurcation behaviors of the steady state can actually be determined from the network structure alone. Specifically, (1) By SBA, a network is decomposed into subnetworks based on a characteristics/index of sub-graphs, and this decomposition indicates all the conditions under which bifurcation can occur. (2) For each substructure given by the network decomposition, we can identify reactions containing the parameters that can induce the bifurcation. (3) Moreover, we can identify chemicals on the network that exhibit bifurcation behaviors when any substructure satisfies the bifurcation condition (Fig. 1).

Fig. 1
figure 1

Summary of Structural Bifurcation Analysis (modified from13). One can construct a matrix \(\varvec{A}\) according to the network structure of a given chemical reaction networks. With the matrix, one can further conclude the conditions where bifurcations can occur, the inducing parameters, and the chemicals that exhibit the bifurcations.

That being said, there remained a couple of open problems in this approach: (i) the theorem was proved under the assumption that no conserved quantity is present in a given network, whereas the general case is open to discussion; (ii) the explicit relation between the matrix \(\varvec{A}\) and the Jacobian matrix is unclear, giving rise to a barrier to further development and applications. In this paper, we extend the theory of SBA by solving the two open problems. Our new theorem provides an explicit formula converting \(\varvec{A}\) to a modified Jacobian matrix \(J_g\) (without redundant eigenvalues arising from the presence of conserved quantities, see Method). This breakthrough not only guarantees the application of SBA in general cases, but it also gives a corollary as a criterion for the (in-)stability of equilibrium points. Remarkably, our theorem is kinetics-independent and renders the study of system dynamics a hierarchical insight into network topology; furthermore, it provides a great potential to associate the framework of structural analysis with other theorems rooted in Jacobian matrices, e.g., multistationarity analysis.

Results

Unveiling bifurcation behaviors of chemical reaction networks through SBA

We begin by demonstrating how bifurcation behavior in chemical reaction networks can be predicted using SBA based on network topology. Suppose that a network composed of four reactions is given:

(1)

Here, the symbol \(\emptyset\) denotes an external reservoir. The arrow “\(\rightarrow\)” from chemical B to reaction \(R_2\) in the network graph represents positive regulation. The subnetwork indicated by the red dashed block is a buffering structure identified by SBA, of which definition and properties are explained later. Then, according to the differences in the coefficients in the chemical reactions, we know the system follows the ordinary differential equation

$$\begin{aligned} \dfrac{d}{dt}\left( \begin{array}{c} x_A \\ x_B \end{array}\right) = \underbrace{\left( \begin{array}{cccc} 1 & -1 & 1 & -1 \\ 0 & 1 & -1 & 0 \end{array}\right) }_{\text {stoichiometric matrix } \nu } \left( \begin{array}{c} r_1(k_1) \\ r_2(x_A, x_B; k_2) \\ r_3(x_B; k_3) \\ r_4(x_A; k_4) \end{array}\right) {=}{:}f(\varvec{x}; \varvec{k}), \end{aligned}$$
(2)

where \(k_n\)’s are parameters of the reaction rate functions.

The SBA uses only the structural information from a reaction system, which is encapsulated in an augmented matrix \({\varvec{A}}\) (see Method Eq. (15) for the precise definition). In the absence of conserved quantities, \({\varvec{A}}\) is constructed based on the information whether reaction rates depend on each chemical (i.e., \(r_{ij} {:}{-} \frac{\partial{ r_i}}{\partial {x_j}} =0\) or not) and a basis for the right kernel of the stoichiometric matrix \(\nu\). A kernel basis can be found from a perspective of graph theory by considering closed paths/loops, with the reservoir \(\emptyset\) also taken as a node of the graph. In this case, we observe two loops: \(C_1: (\emptyset \xrightarrow [1]{\qquad} A \xrightarrow [2]{\qquad} B \xrightarrow [3]{\qquad} A \xrightarrow [4]{\qquad} \emptyset )\) and \(C_2: (A \xrightarrow [2]{\qquad} B \xrightarrow [3]{\qquad} A)\). Then, it is immediately followed by

(3)

By the theorem given by Okada, Tsai, and Mochizuki13, an equilibrium bifurcation occurs only when the determinant of the matrix takes the value of zero, since \(\det {\varvec{A}}\propto \det {J_f}\) in which \(J_f\) is the Jacobian matrix of f in the governing equation Eq. (2). Therefore, the bifurcation points that can be identified by the condition \(\det {J_f}=0\) can also be identified by \(\det {{\varvec{A}}}=0\).

One of the advantages of SBA over standard analysis using the Jacobian matrix is that it gives a network decomposition with the factorization of bifurcation conditions. A network can be decomposed when there exist buffering structures15,16, defined to be a subnetwork \(\gamma\) satisfying:

  1. 1.

    (Output-completeness) All the reactions regulated by any chemicals of \(\gamma\) are included in \(\gamma\).

  2. 2.

    \(0 = \#(\text {chemicals in }\gamma )-\#(\text {reactions in }\gamma )+\#(\text {loops in }\gamma ) +\#(\text {conserved quantities in }\gamma )\).

This is followed by a fact (which can be an alternative definition, see SI Appendix A) that the matrix \(\varvec{A}\) can be rearranged to be an upper block triangular matrix; that is, for some permutation matrices \(P_r\) and \(P_c\) we have

$$\begin{aligned} P_r \varvec{A} P_c = \left( \begin{array}{c|c} \varvec{A}_{\gamma } & *\\ \hline & \varvec{A}_{\gamma ^c} \end{array}\right) \end{aligned}$$
(4)

such that \(\varvec{A}_\gamma\) is a square block, with \(\gamma ^c\) denoting the complement of \(\gamma\). The immediate consequence of the above factorization property is that a bifurcation occurs only if either (i) \(\det {\varvec{A}_\gamma } = 0\) or (ii) \(\det {\varvec{A}_{\gamma ^c}} = 0\). For the considered example, \(\gamma {:}{=}\{B, R_2, R_3\}\) is a buffering structure and one has

(5)

with the factorization of bifurcation conditions

$$\begin{aligned} \det {\varvec{A}} = \underbrace{\left| \begin{array}{cc} r_{2B} & 1 \\ r_{3B} & 1 \end{array}\right| }_{\det {\varvec{A}_\gamma }} \times \underbrace{\left| \begin{array}{cc} r_{4A} & 1 \\ 0 & 1 \end{array}\right| }_{\det {\varvec{A}_{\gamma ^c}}} = (r_{2B} - r_{3B})\cdot r_{4A}. \end{aligned}$$
(6)

and it is clear that \(\det {{\varvec{A}}_{\gamma ^{c}}}=r_{4A}>0\) because A is a reactant of \(R_4\); therefore, we can conclude that the system bifurcates only when \(\det {{\varvec{A}}_{\gamma }}=r_{2B}-r_{3B}=0\).

Another advantage of SBA is its ability to predict bifurcation behavior without requiring kinetic information. With SBA14, it can be concluded that (i) when \(\det {\varvec{A}_\gamma } = 0\), only chemicals in \(\gamma\) would exhibit the bifurcation behavior (SI Appendix A); (ii) if \(\det {\varvec{A}_{\gamma ^c}} = 0\), all the chemicals could exhibit the bifurcation behavior. Nonetheless, in the considered example, we see that a bifurcation occurs only when \(\det {\varvec{A}_{\gamma }} = r_{2B}-r_{3B} = 0\), and hence the behavior would only be exhibited by the chemical B. To verify that theoretical prediction holds regardless of kinetics, we plot the bifurcation diagrams of the common example network with three different reaction functions in ordinary differential equation models (SI Appendix B). As a parameter of the rate function of reaction \(R_2\) is changing, the network exhibits three different types of bifurcations, whereas the bifurcation behaviors are always exhibited only by B as predicted (Fig. 2).

Fig. 2
figure 2

Bifurcation diagrams of the example network with different ODE models. The three models respectively show a (a) pitchfork, (b) transcritical, and (c) saddle-node bifurcation. Independent of the kinetics, we verify our prediction that the bifurcation behavior is exhibited only by B. The ODE models and the parameter settings are given by SI Appendix B.

The generalization of SBA with a standard procedure for chemical reaction networks

One of the challenges in bifurcation analyses in analytical approaches is posed when a system possesses conserved quantities. Conserved quantities create problems for standard bifurcation analysis because they cause the determinant of the standard Jacobian to vanish in such cases (as discussed in Method). Zero eigenvalues associated with these conserved quantities make \(\det {J_f}\equiv 0\), rendering the determinant a poor indicator of bifurcation. Networks with conserved quantities have been studied in the structural analysis with an extended \(\varvec{A}\) with data on conserved quantities, but not in the context of bifurcation analyses but sensitivity analyses16. It was left as an open question whether such a structural approach still works for exploring bifurcation phenomena, that is, whether \(\det {{\varvec{A}}}\) acts as a non-trivial bifurcation indicator despite the failure of \(\det {J_f}\).

Facing this problem, we find that the theory of SBA can be generalized to the case in which conserved quantities are present. Specifically, we prove that when conserved quantities are present, \(\det {\varvec{A}}\) is proportional to a modified Jacobian \(J_g\) that omits the redundant eigenvalues linked to conserved quantities. In other words, \(\det {\varvec{A}}\) remains a reliable indicator of equilibrium bifurcations even in systems with conserved quantities (Method Eq. (18) and Eq. (19)). In particular, an explicit formula that transforms the matrix \(\varvec{A}\) into the modified Jacobian \(J_g\) is given by our main theorem (Theorem 1 in Method), followed by an identity

$$\begin{aligned} \det {\varvec{A}} = \dfrac{\det {(D^\intercal D)\cdot \det {(C^\intercal C)}}}{\det {\Lambda }}\cdot \det {J_g}, \end{aligned}$$
(7)

where the constant matrices CD, and \(\Lambda\) are structurally determined and defined in terms of the stoichiometric matrix. Furthermore, the system stability is assessed by \(\det {{\varvec{A}}}\) with

Corollary 1

\(\quad \mathop {\textrm{sign}}\nolimits (\det {\Lambda }\cdot \left. \det {\varvec{A}}\right| _{\varvec{x}}) \ne (-1)^{M-L} \implies \varvec{x}\text { is not a stable equilibrium point,}\)

where M is the number of chemical species, and L is the number of conserved quantities (see Method).

In summary, our new mathematical findings demonstrate that the determinant of the matrix \(\varvec{A}\) serves as a general bifurcation and stability indicator for chemical reaction networks. This extends the applicability of SBA to a broader range of networks, including the problematic cases in which the standard Jacobian \(J_f\) fails to be an informative indicator. Moreover, although the definition of \({\varvec{A}}\) differs in the presence of conserved quantities, the procedure suggested by reference13 for cases without conserved quantities can still be formally adopted without modification. To further streamline the workflow of SBA, we introduce a 6-step procedure (Fig. 3):

Fig. 3
figure 3

Summary of the standard procedure of Structural Bifurcation Analysis. The theory of SBA has been extended to networks with conserved quantities allowed, and we further improve the procedure for users to facilitate the roles and relations of subnetworks in the bifurcation dynamics.

  1. (1)

    Construct the matrix \(\varvec{A}\) according to the network topology.

  2. (2)

    Identify buffering structures and rearrange \(\varvec{A}\) into an upper block triangular form.

  3. (3)

    Decompose the network into subnetworks \(\Gamma _i\)’s and construct the influence graph according to the rearranged \(\varvec{A}\).

  4. (4)

    For each subnetwork \(\Gamma _i\), compute \(\det {\varvec{A}_{\Gamma _i}}\).

  5. (5)

    Summarize the conditions in which \(\det {\varvec{A}_{\Gamma _i}}\) can change its sign for some \(\Gamma _i\), and conclude the inducing parameters.

  6. (6)

    For each condition listed in (5), according to the influence graph, determine the bifurcating chemicals.

We improve the protocol with the step of constructing the influence graph (defined in Method Eq. (28) and Eq. (29)), which provides an insight into the roles of and relations between subnetworks. With the generalization of the theory and the improvement of the procedure, in the following subsection, we would like to investigate the switching behaviors of a biological system at a cellular level.

Macrophage polarization network

Macrophages are specialized innate immune cells with significant plasticity to change their phenotypes in response to the microenvironment17. The phenotypic states of macrophages are broadly categorized into two distinct groups: M1 (pro-inflammatory) and M2 (anti-inflammatory), each wielding diverse functions in inflammation and tumor defense. M1 macrophages, characterized by highly activated STAT1 and NF\(\kappa\)B, produce pro-inflammatory cytokines and exert cytotoxic functions to combat pathogens18,19; on the other hand, M2, characterized by highly activated STAT3 and STAT6, represents an anti-inflammatory group which takes charge of tissue repairing and contributes to the resolution of inflammation18,20,21. In various diseases, the balance between M1 and M2 macrophages can be crucial and is thought to be strictly regulated according to the microenvironment including physiological and pathological conditions. Thus, for therapeutic purposes, researchers strive to comprehend and potentially manipulate macrophage polarization. For instance, it has been suggested that mutations in SOCS3 (suppressor of cytokine signaling 3), a gene that has a suppressive function for STAT3, may result in a hyperactivation of STAT3 and thus prevent the metastasis of skin cancer22. By elucidating the macrophage switching system, it would be possible to artificially switch macrophages between different phenotypes, which could potentially be used in the future for immunotherapy against cancer.

We take a simplified network associated with macrophage polarization as an example (Fig. 4). With the network, we first numerically verify that \(\varvec{A}\) outperforms the standard Jacobian \(J_f\) as a bifurcation indicator (by Theorem 1) and a stability indicator (by Corollary 1). After that, we demonstrate the power of SBA on predicting bifurcation behaviors based on the network topology. It is noteworthy that a signaling pathway as considered can usually possess conserved quantities, because signal transduction pathways often contain signaling proteins that reversibly transition between activated and inactivated states, and the total amounts of such (paired) proteins are constant in the timescale of chemical reactions. Specifically, in this macrophage polarization system, the total amount of each protein molecule (STAT1, NF\(\kappa\)B, STAT3, and STAT6) in a single cell corresponds to a quantity that does not change in a short period of time. Note the difference between the total amount and the activity level of each molecule. An important fact is that the expression levels of these proteins are known to vary among cells. In particular, it is reported that STAT1-deficiency in macrophage leads to a significantly low tendency of switching to an M1 phenotype23,24. Therefore, in the following analysis, we will focus on the qualitative changes in system behavior, or bifurcation behavior, that are caused by differences in expression levels between cells, i.e., differences in the total amount of signaling proteins (specifically, the total amount of inactivated and activated STAT1).

Fig. 4
figure 4

Macrophage polarization network for the wild type. By an arrow "\(\dashv\)" pointing from a complex to a reaction, we mean a negative regulation. The superscript \(+\) denotes the phosphorylated/activated form for each of the four complexes STAT1, STAT3, STAT6, and NF\(\kappa\)B, of which signalings are essential to the macrophage M1/M2 polarization. In this simplified network, the M1 polarization is primarily associated with the dominance of STAT1\({}^+\) and NF\(\kappa\)B\({}^+\), while the M2 polarization is associated with the dominance of STAT3\({}^+\) and STAT6\({}^+\).

SBA for the (wild-type) macrophage polarization network

The network of the macrophage polarization system, presented in Fig. 4 and referred to as the wild-type (WT) network, possesses no buffering structures (except for a trivial one, the entire network). Consequently, our structural method implies that the whole network is responsible for the bifurcation condition, and the determinant factor associated with the entire network, \(\det {\varvec{A}}\), is a bifurcation/stability indicator. Furthermore, it implies that if the system exhibits bifurcations, then all the four proteins must exhibit bifurcating behaviors.

To numerically verify these predictions from the SBA, we construct a model for the considered network. Reactions in the network can be categorized into two classes: deactivation (or degradation) and activation subject to negative regulation. For simplicity, the reaction rate function of deactivation is given by the law of mass action; on the other hand, the activation as well as the negative regulation involve phosphorylation, which is commonly modeled as a sigmoid function25, and this is considered in our model as well. The detailed parameter settings for the following numerical experiments can be found in supplementary materials (SI Appendix B).

For the convenience of the notation, the concentration of NF\(\kappa\)B is denoted by N, and that of activated form NF\(\kappa\)B\({}^+\) is denoted by \(N^p\). Similarly, \(S_i\) and \(S_i^p\) (\(i=1,3,6\)) denote the concentrations of inactivated and activated STAT family, respectively. Then, the four conserved quantities can be specified as \(\eta _1 = S_1 + S_1^p\), \(\eta _2 = S_3 + S_3^p\), \(\eta _3 = S_6 + S_6^p\), and \(\eta _4 = N + N^p\). In order to examine the effect of variation in the amount of STAT1 expression, we numerically construct the bifurcation diagrams with varying \(\eta _1\) (Fig. 5 (a)). Specifically, for a fixed \(\eta _1\), the equilibrium points are obtained by numerically finding the solution to \(\varvec{0}=\nu \,\varvec{r}(\varvec{x})\). To numerically test the stability of each equilibrium point, say \(\varvec{x}_0\), a small randomly given perturbation \(\delta \varvec{x}\) such that \((\varvec{x}_0+\delta \varvec{x})\) shares the same conserved quantities with \(\varvec{x}_0\) is exerted to see whether the system state recovers to \(\varvec{x}_0\).

As shown in Fig. 5 (a), the numerical simulations demonstrate that all the chemicals exhibit the bifurcation behavior, which agrees with the SBA prediction. More specifically, there are two stable branches: one with highly-activated NF\(\kappa\)B and STAT1, and the other with highly-activated STAT3 and STAT6. Thus, our simple model successfully reproduced the known phenotypes of M1 and M2 macrophages. Besides, one of the stable branches, corresponding to M1 phenotype, disappears when STAT1 expression \(\eta _1\) decreases to a threshold value (\(\approx 6.58\)). This result is qualitatively consistent with the experimental observation that STAT1 deficiency in macrophages leads to a higher ratio of M2 to M1 polarization23,24.

Fig. 5
figure 5

Bifurcation analysis of the WT network. (a) The bifurcation diagrams with the conserved quantity \(\eta _1=\text {STAT1}+\text {STAT1}^+\) ranging in [6, 8.5] being the bifurcation parameter. Markers in different shapes are used to denote points on distinct equilibrium branches. The short and long stable equilibrium branches can be interpreted as the M1 (red) and M2 (blue) polarized states, respectively. (b) For each equilibrium as denoted in (a), we numerically estimate the determinants of the matrix \(\varvec{A}\) and the standard Jacobian. It is clear that the positiveness of \(\det {\varvec{A}}\) represents the stability of equilibria, verifying our corollary of stability, and the standard Jacobian determinant always vanishes, failing to be an informative indicator of bifurcation. The vertical dashed line in each of panels illustrates the bifurcation threshold (\(\approx 6.58\)).

Collecting all the stable and unstable equilibrium points in the bifurcation diagram, we shall compute the corresponding \(\det {\varvec{A}}\) and \(\det {J_f}\) to see whether the former does outperform \(\det {J_f}\) as an indicator for bifurcation and stability. Based on the network topology, we have

$$\begin{aligned} \varvec{A} = \left( {\begin{array}{cccccccc|cccc} r_{1S_1} & & & r_{1S_3^p} & & r_{1S_6^p} & & & 1 & & & \\ & r_{2S_1^p} & & & & & & & 1 & & & \\ & r_{3S_1^p} & r_{3S_3} & r_{3S_3^p} & & & & r_{3N^p} & & 1 & & \\ & & & r_{4S_3^p} & & & & & & 1 & & \\ & r_{5S_1^p} & & & r_{5S_6} & & & & & & 1 & \\ & & & & & r_{6S_6^p} & & & & & 1 & \\ & & & r_{7S_3^p} & & r_{7S_6^p} & r_{7N} & r_{7N^p} & & & & 1\\ & & & & & & & r_{8N^p} & & & & 1\\ \hline 1 & 1 & & & & & & & & & & \\ & & 1 & 1 & & & & & & & & \\ & & & & 1 & 1 & & & & & & \\ & & & & & & 1 & 1 & & & & \end{array}}\right) . \end{aligned}$$
(8)

We numerically evaluate \(\det {J_f}\) and \(\det {\varvec{A}}\) at all the equilibrium points and confirm that the system is unstable when \(\det {\varvec{A}}\ge 0\), as claimed by Corollary 1 (Fig. 5 (b)). It is shown that the determinant of the standard Jacobian always vanishes and thus fails to be a decent bifurcation indicator; on the other hand, \(\det {\varvec{A}}\) stays informative of the occurrence of bifurcation.

Network alterations create buffering structures, resulting in localized bifurcation behaviors

As aforementioned, it has been suggested that the suppression of SOCS3 can cause the hyperactivation of STAT3 and prevent the metastasis of skin cancer22. Therefore, one may wish to examine the influence of deleting SOCS3 on the bifurcation behavior associated with macrophage polarization. SOCS3 can be induced by STAT1\({}^+\), STAT3\({}^+\), and NF\(\kappa\)B\({}^+\) and negatively regulates STAT3 activation. In the WT network, presented in Fig. 4, these regulations are depicted by the three arrows acting on the activation of STAT3. In the matrix \(\varvec{A}\) corresponding to the WT network, these three regulations are expressed by negative partial derivatives \(r_{3N^p}\), \(r_{3S_1^p}\), and \(r_{3S_3^p}\). Therefore, the deletion of SOCS3 corresponds to removing these negative regulations from the network and setting these partial derivatives to zero in \(\varvec{A}\). As we will demonstrate below, this network alteration creates buffering structures, which can confine bifurcation behaviors.

We follow the 6-step standard procedure to predict the bifurcation behavior based on the network topology (see SI Appendix B for the altered network). In the first step, the matrix \(\varvec{A}\) is constructed as given in Eq. (8) but with \(r_{3N^p} = r_{3S_1^p} = r_{3S_3^p} = 0\), since the regulation effects disappear due to the SOCS3 deletion. In step 2, the matrix \(\varvec{A}\) can be rearranged to be

(9)

According to the form, we define three subnetworks by

$$\begin{aligned} \begin{array}{rcl} \Gamma _1 & =& \{\text {NF}\kappa \text {B}, \text {NF}\kappa \text {B}^+, R_7, R_8\} \\ \Gamma _2 & =& \{\text {STAT1}, \text {STAT1}^+, \text {STAT6}, \text {STAT6}^+, R_1, R_2, R_5, R_6\} \\ \Gamma _3 & =& \{\text {STAT3}, \text {STAT3}^+, R_3, R_4\}, \end{array} \end{aligned}$$
(10)

Then, \(\Gamma _1\) and \((\Gamma _1\cup \Gamma _2)\) are two buffering structures, and the hierarchy of buffering structures with respect to the inclusion relations can be summarized as step 3 (Fig. 6). Next, calculating the determinants of square blocks in the diagonal in Eq. (9), then one obtains

$$\begin{aligned} \begin{array}{ccl} \det {\varvec{A}_{\Gamma _1}} & = & (r_{7N^p} - r_{7N} - r_{8N^p}) < 0 \\ \det {\varvec{A}_{\Gamma _2}} & = & (r_{1S_1} r_{5S_6} + r_{1S_1} r_{6S_6^p} - r_{1S_6^p} r_{5S_1^p} + r_{2S_1^p} r_{5S_6} + r_{2S_1^p} r_{6S_6^p}) \\ \det {\varvec{A}_{\Gamma _3}} & = & (r_{3S_3} + r_{4S_3^p})> 0. \end{array} \end{aligned}$$
(11)

Notice that \(r_{7N^p}<0\) because NF\(\kappa\)B\({}^+\) negatively regulates \(R_7\) (i.e., the activation of NF\(\kappa\)B), and \(r_{7N}>0\) and \(r_{8N^p}>0\) because the NF\(\kappa\)B and NF\(\kappa\)B\({}^+\) are reactants in \(R_7\) and \(R_8\), respectively. This assures that \(\det {\varvec{A}_{\Gamma _1}}\) never becomes zero but stays negative, and we analogously have \(\det {\varvec{A}_{\Gamma _3}}>0\). Therefore, as the conclusion of step 5, only \(\Gamma _2\) is responsible for the occurrence of bifurcation. Finally, since the minimal buffering structure including \(\Gamma _2\) is \((\Gamma _1\cup \Gamma _2)\), the bifurcation behavior can be exhibited only in \((\Gamma _1\cup \Gamma _2)\).

Fig. 6
figure 6

The influence graphs and the rearranged \(\varvec{A}\) matrices corresponding to the wild, the SOCS3-deleted, and the SOCS3-/KLF4- deleted types. In the rearranged matrix, we color the block \(A_{\Gamma _2}\) since the sign of its determinant can change, determining the occurrence of bifurcations. With the influence graphs, SBA predicts that chemicals in \((\Gamma _1\cup \Gamma _2)\) exhibit the bifurcation behavior in the SOCS3-deleted network, while the bifurcation behavior is limited within \(\Gamma _2\) when KLF4-deletion is further applied to the network.

To verify the prediction of SBA that the SOCS3-deleted network can exhibit the bifurcation only in activated and inactivated forms of NF\(\kappa\)B, STAT1, and STAT6 (that is, chemicals in \((\Gamma _1\cup \Gamma _2)\)), we adopt the ODE model built for the wild type but with the regulations mediated by SOCS3 removed (see SI Appendix B). The bifurcation diagram numerically computed aligns perfectly with the theoretical prediction based on SBA (Fig. 7 (a)). Furthermore, in our numerical analysis, the protein STAT3—located outside the buffering structure, \((\Gamma _1\cup \Gamma _2)\), and therefore not exhibiting bifurcation—persists in a highly activated state, a characteristic akin to M2 polarization. This result is consistent with an experimental report that STAT3 is highly activated in the SOCS3-deleted mutants22.

Fig. 7
figure 7

Bifurcation analysis of the modified networks. The bifurcation diagrams of (a) the SOCS3-deleted network and (b) the SOCS3- and KLF4-deleted network, which fully agree with the prediction of SBA. Markers in different shapes denote distinct equilibrium branches as done in Fig. 5, where as the coloring for each chemical is determined by the biological interpretation (red for M1-like, and blue for M2-like). The vertical dashed lines denote the bifurcation threshold (\(\approx 7.25\)) for \(\eta _1\).

In the analysis of the SOCS3-deleted network described above, STAT3 is fixed in the M2-like phenotype due to a buffering structure that confines the bifurcation range within it. To further illustrate our method, we additionally modify this network to fix a subsystem to the M1-like phenotype. Equation (9) suggests that \(\Gamma _2\) becomes an independent buffering structure if \(r_{7S^p_6}\equiv 0\) in the SOCS3-deleted network. This partial derivative is corresponding to the regulation of STAT6\({}^+\) on the activation of NF\(\kappa\)B via the gene expression of KLF4 (Krüppel-like factor 4). When the deletions of both SOCS3 and KLF4 are applied (see SI Appendix B for the doubly-altered network), we still have Eq. (11); namely, only \(\Gamma _2\) is responsible for the occurrence of bifurcation. Moreover, since the minimal buffering structure including \(\Gamma _2\) is \(\Gamma _2\) itself, SBA concludes that only the four chemicals STAT1, STAT1\({}^+\), STAT6, and STAT6\({}^+\) can exhibit the bifurcation behaviors. With an analogous numerical simulation, we once again verify that the prediction of SBA (Fig. 7 (b)). Only STAT1 and STAT6, located within \(\Gamma _2\), exhibit bifurcation, resulting in branches where both of the proteins are M1-like or both are M2-like. Conversely, STAT3 and NF\(\kappa\)B, located outside \(\Gamma _2\), remain persistently highly activated, each resembling the M2 and M1 phenotypes, respectively. In other words, our results suggest that the double mutations would create a phenotype that simultaneously displays M1- and M2-associated features, robustly (e.g. independently of \(\eta _1\)).

Discussion

In this paper, we further extend structural bifurcation analysis, which determines the fundamental properties of bifurcation behavior in chemical reaction systems based solely on network structures. We have increased the theoretical generality of the method while also demonstrating its practicality for elucidating biological systems. We have shown, through rigorous mathematical formulae, the direct relationship between the Jacobian matrix, which characterizes conventional theory, and the matrix \(\varvec{A}\), which characterizes structural bifurcation analysis. This not only clarifies the relationship with conventional theory, but also makes it possible to analyze bifurcation behavior in response to changes in conserved quantities in addition to changes in reaction parameters. We also showed the method of explicitly obtaining the influence relationship of parameter perturbation on substructures on the network as an influence graph from the matrix \(\varvec{A}\). Furthermore, we showed the algorithm for comprehensively performing structural bifurcation analysis and structural sensitivity analysis. These results were applied to the macrophage polarization system, and not only did they clarify the mechanisms behind cell fate regulation, but they also enabled us to predict changes in cell fate switching behavior in mutants.

As the example of the macrophage polarization system shows, bifurcation has important significance for biological systems, as it creates discrete states and transitions between them. Nevertheless, bifurcation analysis has not yet achieved sufficient popularity in the life sciences. The main reason for this is the difficulty of the analysis. To find bifurcation phenomena, it is necessary to identify the equilibrium points of the target system and investigate the dependence of the equilibrium points on parameters. To perform these analyses on biological systems, which include many molecular species, i.e., high-dimensional dynamical systems, the practical way is to perform numerical analysis. Nonetheless, such a high-dimensional biological system always comes with a large number of parameters involved. Therefore, until now, the only way to identify the equilibrium points and parameter dependencies of high-dimensional dynamical systems in life was through a trial-and-error approach using numerical calculations.

The structural bifurcation analysis we propose has the potential to address the aforementioned issues by determining fundamental bifurcation properties solely based on network structure in a model-free manner. This approach becomes especially powerful when buffering structures, identified according to the network structures, are present. By decomposing large biological systems into substructures determined by buffering structures, we can elucidate the structural conditions necessary for bifurcation, and pinpoint the bifurcation parameters and variables that exhibit bifurcation behavior within each substructure of the network.

The matrix \(\varvec{A}\) directly reflects the topology of the network and provides deeper insight into the network structure for analysis. The new mathematical finding presented in this paper not only generalizes the theory of structural bifurcation analysis to chemical reaction networks with conserved quantities but also opens avenues for further expansion of the theory. For instance, it implies that the (in-)stability of the system can be inferred from the matrix \(\varvec{A}\). We anticipate that this breakthrough can be integrated into other methods rooted in the analyses of the Jacobian matrix. For example, the type of bifurcation can be determined by the eigenspectrum of the Jacobian matrix26, and the sign of the Jacobian determinant can give a hint whether the system possesses a single equilibrium point27. We believe that using the matrix \(\varvec{A}\) instead of the Jacobian matrix can render these theories a structural insight into chemical reaction networks.

With the network in Example 1, we obtained three different bifurcation scenarios by assuming three different mathematical models, i.e., sets of reaction rate functions. While different reaction rate functions yielded different bifurcation types, the use of a common network produced consistent results for bifurcation conditions, bifurcation parameters, and bifurcating variables. This clearly demonstrates that these three dynamical properties are determined solely by the structure of the reaction network. Historically, bifurcation patterns have been a significant focus in the mathematical sciences. However, within the context of structural bifurcation analysis, bifurcation patterns may be regarded as incidental properties that emerge only after the network structure has been defined and a specific model is assumed.

In this paper, we focus on equilibrium bifurcations, which are characterized by the Jacobian matrix acquiring a zero eigenvalue. Our analysis does not extend to bifurcations involving complex eigenvalues, such as Hopf bifurcations, whose onset is indicated by the emergence of purely imaginary eigenvalues. Such eigenvalue configurations are not captured by the determinant of the Jacobian, and the framework of SBA is thus not applicable in these cases. As shown in Okada et al.14, in the absence of conserved quantities, the characteristic polynomial of the Jacobian matrix J can be written in terms of the matrix \(\varvec{A}\). Our main theoretical result (Theorem 1 in Methods), which connects the matrix \(\varvec{A}\) to the modified Jacobian—a system without conserved quantities—therefore implies that the full eigenvalues can be examined structurally even in the presence of conserved quantities. We consider the study of bifurcations associated with complex eigenvalues to be an important and promising avenue for future research.

The structural bifurcation analysis presented in this study will serve as a powerful tool for advancing our understanding of biological systems. To demonstrate this, we analyzed the macrophage polarization system and derived general predictions from the network structures. In wild-type cells, macrophage polarization was examined by varying the expression level of STAT1. When STAT1 expression is low, macrophages are predicted to exhibit only the M2 type (anti-inflammatory), lacking diversity in phenotype. Conversely, when STAT1 expression is high, both M1 (inflammatory) and M2 types appear. In SOCS3 mutants, our analysis indicates that STAT3 keeps highly activated, independent of STAT1 expression, without exhibiting bifurcation behavior. This finding aligns with experimental observations of STAT3 hyperactivation in SOCS3 mutants. However, it is important to note that bifurcation behavior can still occur in the activities of STAT1 and STAT6 in SOCS3 mutants. This result suggests that the polarization behavior of macrophages with SOCS3 deletion may differ depending on which gene’s expression is observed. For instance, STAT3 may always display hyperactivation and an M2 phenotype, while STAT1 and STAT6 show normal polarization into either M1 or M2, similar to the wild type. Additionally, structural bifurcation analysis suggests that the suppression or deletion of KLF4 in the SOCS3-knockout system further eliminates multistability in both NF\(\kappa\)B and STAT3, leading to their simultaneous hyperactivation. Interestingly, while NF\(\kappa\)B hyperactivation is associated with the induction of pro-inflammatory genes, STAT3 hyperactivation promotes anti-inflammatory responses. This suggests that a macrophage lacking both SOCS3 and KLF4 may exhibit seemingly contradictory behaviors, warranting further investigation to understand its role in inflammation.

Actually, the reliability of network information in databases is widely concerned. Networks may contain unknown reactions or regulatory interactions that are not reflected in existing databases. Our structural approach is particularly powerful in such challenging circumstances, precisely because SBA relies solely on the network topology. Suppose that SBA is applied to a network on a database, but experimental results in the verification phase do not align with the prediction. In that case, misinformation about the network structure presented in the databases can be firmly concluded. In the subsequent phase of network refinement, one can search for missing reactions or regulations whose inclusion would reconcile the predictions of SBA with experimental observations. By experimentally testing these candidates, the true underlying network structure can be elucidated.

We believe that our predictions on the bifurcation behaviors of macrophage polarization can be verified through experiments and that these experiments can provide valuable results. As noted, experimental validations can help identify unknown reactions/regulations and guide network refinement. Finally, it is noteworthy that the M1 and M2 dichotomy is a simplistic and convenient categorization of possible macrophage phenotypes. There are subtypes between the M1 and M2 phenotypes, and their immunological roles are increasingly recognized as important28,29. Our structural method may also be beneficial in predicting potential subtypes based on a network structure or in proposing modifications to achieve targeted phenotypes.

Methods

Review of Structural Bifurcation Analysis (SBA)

Suppose that a network is given by N reactions

$$\begin{aligned} R_n: \quad \nu ^-_{1,n}X_1+\ldots +\nu ^-_{M,n}X_M \xrightarrow {\hspace{1cm}} \nu ^+_{1,n}X_1+\ldots +\nu ^+_{M,n}X_M, \qquad (n=1,\ldots ,N) \end{aligned}$$
(12)

where \(\{X_m\}_{m=1}^M\) is the collection of chemical species and \(\nu ^\pm _{m,n}\)’s represent the coefficients in the reactions. Then, an \(M\times N\) stoichiometric matrix \(\nu\) is defined by \((\nu _{m,n}) {:}{=}(\nu ^+_{m,n} - \nu ^-_{m,n})\), encoding the network topology as a weighted incidence matrix of the directed graph. Then, the dynamics follows the ordinary differential equations

$$\begin{aligned} \displaystyle \frac{d}{dt}\,x_m = \sum _{n=1}^{N} \nu _{m,n} r_{n}(\varvec{x};\varvec{k}) {=}{:}f_m(\varvec{x};\varvec{k}) \end{aligned}$$
(13)

for each \(m=1, 2,\ldots ,M\), where \(\varvec{k}\) is a parameter vector in the reaction rate function \(\varvec{r}:\mathbb {R}^M\times \mathbb {R}^N\rightarrow \mathbb {R}^N\). There is no universal rule of determining the functional form for reaction rate function \(\varvec{r}\). The nonlinearity of reaction rate functions in general contributes to the difficulties of modeling approaches in quantitatively estimating the parameters based on data. The influences of chemicals to reaction rates, meanwhile, can usually be qualitatively determined by the biological background knowledge. For instance, the value of the partial derivative \(\frac{\partial {r_n}}{\partial {x_m}}\) is positive if \(X_m\) is a reactant in the reaction \(R_n\), and it is negative if \(X_m\) negatively regulates the reaction as a suppressor, and it can also be zero when \(X_m\) does not affect the reaction rate of \(R_n\).

Without functional forms of kinetics, the equilibrium dynamics can still be well characterized to a degree with the help of two linear subspaces. When the system is at an equilibrium point \(\overline{\varvec{x}}\in \mathbb {R}^M\), the change rate is zero and thus we have

$$\begin{aligned} \varvec{r}(\overline{\varvec{x}}) = \sum _{p=1}^{P} \mu _p \varvec{c}^p \end{aligned}$$
(14)

for some \(\mu \in \mathbb {R}^P\), where \(\{\varvec{c}^p\}_{p=1}^{P}\) is a basis of \(\ker {\nu }\subseteq \mathbb {R}^N\) and \(P=\dim \ker {\nu }\). We may put \(C{:}{=}(\varvec{c}^1, \ldots , \varvec{c}^P)\in \mathbb {R}^{N\times P}\) and let \(\left\langle C\right\rangle\) denote the space spanned by column vectors of C. Besides, we say a chemical reaction network has a conserved quantity if a linear combination of chemicals is time-invariant, namely, \(0\equiv \varvec{d}^\intercal \dot{\varvec{x}}\) for some \(\varvec{d}\in \mathbb {R}^M\) for any \(\varvec{x}\in \mathbb {R}^M\). By the dynamics given by Eq. (13), we see \(\varvec{d}\in \ker {\nu ^\intercal }\simeq \mathop {\textrm{coker}}\nolimits {\nu }\). Therefore, take a cokernel basis \(D = (\varvec{d}^1,\ldots ,\varvec{d}^Q)\in \mathbb {R}^{M\times Q}\) with \(Q=\dim \ker {\nu ^\intercal }\), then \(\varvec{\eta }{:}{=}D^\intercal \varvec{x}\) specifies all the conserved quantities. We similarly denote \(\left\langle D\right\rangle =\ker {\nu ^\intercal }\).

With the graph and the biological information rendered by the chemical reactions, a square matrix \(\varvec{A}\) is defined as

$$\begin{aligned} \varvec{A} {:}{-} \left( \begin{array}{c|c} \begin{array}{ccc} {} & {} & {} \\ {} & \dfrac{\partial \varvec{r}}{\partial \varvec{x}} & {} \\ {} & {} & {} \end{array} & C \\ \hline D^\intercal & \end{array}\right) , \end{aligned}$$
(15)

of which lower-right block is empty (throughout the article, trivial blocks are denoted empty). Together with C indicating loops of reactions, D determining the conserved quantities, the zero-nonzero pattern of entries of the matrix \(\varvec{A}\) directly encodes the structure of the reaction network structure. Such a matrix was first introduced for the sensitivity analysis of chemical reaction networks30,31; specifically, a sensitivity matrix \(\varvec{S} = -\varvec{A}^{-1}\) determines the system responses to perturbations in parameters. More explicitly,

$$\begin{aligned} \dfrac{\delta {x_i}}{\delta {k_j}} = (\varvec{S})_{ij} \end{aligned}$$
(16)

indicates the change \((x_i\mapsto x_i+\delta x_i)\) in the chemical \(X_i\) in response to a parameter change \((k_i\mapsto k_i+\delta k_i)\) in \(K_j\) (see SI Appendix A.I for details of structural sensitivity analysis).

The identification of buffering structures is important in the approach of structural analysis, since a localization principle arises from buffering structures—the influence of a parameter change inside a buffering structure localizes inside the buffering structure (see SI Appendix A.III.). The localization principle does not hold only in the context of the aforementioned sensitivity problem, but it was extended to bifurcation analysis by the mathematical finding of Okada et al.13,14 that \(\det \varvec{A}\propto \det {J_f}\) when \(\nu\) is full-ranked (i.e., the system has no conserved quantities), where \(J_f\) being the Jacobian of f in the Eq. (13). This leads to the development of Structural Bifurcation Analysis, in which a bifurcation is identified by the vanishing of the determinant of \(\varvec{A}\). In particular, as shown in Eq. (4), the identification of buffering structures facilitates the factorization of the determinant (followed by the fact that \(\det \varvec{A}=0\iff\) \(\det \varvec{A}_\gamma =0\) or \(\det \varvec{A}_{\gamma ^c}=0\)). The presence of multiple buffering structures (say \(\gamma _\alpha\)’s) highly benefits us in bifurcation analysis with the capability of

  1. 1.

    Factorizing the bifurcation conditions: the bifurcation analysis of a complex network can be facilitated by the network decomposition into determinant structures (denoted by \(\Gamma _{\beta }\)’s), which are defined as buffering structures with subtraction of their inner buffering structures (Fig. 1 (3)). For each determinant structure, the condition for bifurcation occurrence can be examined from its network structure.

  2. 2.

    Finding (bifurcation-)inducing parameters: for each determinant structure \(\Gamma _{\beta }\), the bifurcation parameters associated with \(\det \varvec{A}_{\Gamma _{\beta }}=0\), termed as the inducing parameters for \(\Gamma _{\beta }\), are identifiable on the network. The bifurcations are induced by the parameters which are outside any buffering structures non-intersecting with the determinant structure \(\Gamma _{\beta }\) (Fig. 1 (4)).

  3. 3.

    Determining the bifurcating chemicals: for each determinant structure \(\Gamma _{\beta }\), the chemicals exhibiting bifurcation behaviors associated with \(\det \varvec{A}_{\Gamma _{\beta }}=0\), termed as the bifurcating chemicals for \(\Gamma _{\beta }\), are identifiable on the network. When the bifurcation condition is satisfied, the bifurcation of steady-state concentrations (and fluxes) appears only inside the (minimal) buffering structure that contains the determinant structure \(\Gamma _{\beta }\) (Fig. 1 (5)).

The generalization of SBA

SBA is rooted in the finding of Okada et al. that \(\det {\varvec{A}}\propto \det {J_f}\), and we remark that the theorem is proved under the assumption that \(\nu\) is full-ranked, that is, no conserved quantity is present in the considered network13,14. It remains an open problem whether the framework of SBA can be employed when conserved quantities exist.

What is the problem with the conserved quantities? When the cokernel space \(\left\langle D\right\rangle\) is nontrivial, we have \(D^\intercal J_f = D^\intercal \nu \frac{\partial \varvec{r}}{\partial \varvec{x}} = (\nu ^\intercal D)^\intercal \frac{\partial \varvec{r}}{\partial \varvec{x}} \equiv \varvec{0}\). This implies that the Jacobian \(J_f\) is always non-invertible because of the vanishing eigenvalues due to the nontrivial cokernel space. Intuitively speaking, a trajectory \(\varvec{x}(t)\) always lies on a hyperplane parallel to \(\mathop {\textrm{im}}\nolimits \nu\), which does not span the whole space when \(\nu\) is not full-ranked. Therefore, L of the eigenvalues that measure diverging rates of trajectories must be zero, where \(L {:}{-} \dim \mathop {\textrm{coker}}\nolimits \nu = (M-\dim \mathop {\textrm{im}}\nolimits \nu )\) is the number of independent conserved quantities.

To circumvent the problem with the redundant eigenvalues, the intuition above motivates us to have a change of coordinates with \((\mathop {\textrm{im}}\nolimits \nu )\) and its orthogonal complement \((\mathop {\textrm{im}}\nolimits \nu )^\perp\) being the two axes. To do so, we put V to be a full-ranked matrix such that \(\left\langle V\right\rangle =\mathop {\textrm{im}}\nolimits \nu\) and consider the pseudo-inverses

$$\begin{aligned} V^\dagger {:}{=}(V^\intercal V)^{-1} V^\intercal \quad \text {and}\quad D^\dagger {:}{=}(D^\intercal D)^{-1} D^\intercal . \end{aligned}$$
(17)

Then, a linear isomorphism for the desired change of coordinate is obtained as

(18)

or, alternatively, \(\varvec{x}=V\varvec{\xi } + (D^\dagger )^\intercal \varvec{\eta }\). Then, the dynamics can be rewritten as

$$\begin{aligned} \left\{ \begin{array}{cccc} \dot{\varvec{\xi }} & = & g(\varvec{\xi };\varvec{\eta },\varvec{k}) & {:}{-} V^\dagger \nu \,\varvec{r}(V\varvec{\xi } + (D^\dagger )^\intercal \varvec{\eta };\varvec{k}) \\ \dot{\varvec{\eta }} & = & \varvec{0} \end{array}\right. . \end{aligned}$$
(19)

This gives a clear picture showing that the dynamics of \(\varvec{x}\) solely counts on that of \(\varvec{\xi }\), and thus it is sufficient to consider the Jacobian \(J_g=V^\dagger {J_f}V\) of g for the bifurcation and stability analyses. By considering \(J_g\) instead of \(J_f\), the problem of the vanishing eigenvalues due to conserved quantities is well circumvented. Moreover, the Jacobian \(J_g\) is associated with the matrix \(\varvec{A}\) which is given by the network topology. Considering a constant matrix

$$\begin{aligned} \Lambda {:}{-} \left( \begin{array}{c|c} \begin{array}{ccc} {} & {} & {} \\ {} & \nu & {} \\ {} & {} & {} \end{array} & D \\ \hline C^\intercal & \end{array}\right) , \end{aligned}$$
(20)

we have the relation associating \(\varvec{A}\) and the Jacobian, given by

Theorem 1

Given a kernel basis C and a cokernel basis D of the mapping \(\nu\), then there exists an orthogonal basis \(\widetilde{T}\in \mathbb {R}^{(M+Q)\times (M+Q)}\) such that

figure b

and hence \(\det {\varvec{A}} = \dfrac{\det {(D^\intercal D)\cdot \det {(C^\intercal C)}}}{\det {\Lambda }}\cdot \det {J_g}\).

In particular, when \(\dim \mathop {\textrm{coker}}\nolimits \nu =0\), we have \(\det {\varvec{A}} = \dfrac{\det {(C^\intercal C)}}{\det {\Lambda }}\cdot \det {J_f}\).

The relation further gives Corollary 1 as a criterion for stable equilibria. The proofs are left in SI Appendix C.

An example network with conserved quantities

To show the problem induced by the presence of conserved quantities and how our theorem circumvent it, we consider a simple network.

(21)

The corresponding stoichiometric matrix is

$$\begin{aligned} \nu = \left( {\begin{array}{cccccc} 1 & -1 & {\,} & {\,} & {\,} & {\,} \\ {\,} & 1 & -1 & {\,} & 1 & -1 \\ {\,} & {\,} & 1 & -1 & {\,} & {\,} \\ {\,} & {\,} & {\,} & {\,} & -1 & 1 \\ {\,} & {\,} & {\,} & {\,} & -1 & 1 \\ \end{array}}\right) . \end{aligned}$$
(22)

Furthermore, one sees that the cokernel space is given by

$$\begin{aligned} \ker \nu ^\intercal = \langle \,(0,0,0,1,-1)^\intercal \,\rangle , \end{aligned}$$
(23)

since \(\eta _1 {:}{-} 1\cdot {x_D} + (-1)\cdot {x_E}\) determines the conserved quantity. On the other hand, the kernel basis can be obtained by considering the two loops \(C_1: (B \xrightarrow [6]{\qquad} (D+E) \xrightarrow [5]{\qquad} B)\) and \(C_2: (\emptyset \xrightarrow [1]{\qquad} A \xrightarrow [2]{\qquad} B \xrightarrow [3]{\qquad} C \xrightarrow [4]{\qquad} \emptyset )\). As such, one obtains

(24)

By the identification as given in SI Appendix A, it can be seen that \(\Gamma _1\), \((\Gamma _1\cup \Gamma _2)\) and \(\Gamma _3\) are three buffering structures, where \(\Gamma _1 {:}{-} \{A, R_2\}\), \(\Gamma _2{:}{-}\{C, R_4\}\), \(\Gamma _3 {:}{-} \{B, D, E, R_3, R_5, R_6\}\), and \(\Gamma _4 {:}{-} \{R_1\}\). We have the rearranged form

(25)

where \(P_r\) and \(P_c\) are permutation matrices with \(\det {P_r} = \det {P_c} = -1\). The step of rearranging \(\varvec{A}\) according to the buffering structure highly facilitates the computation and factorization of the determinants, giving

$$\begin{aligned} \det {\varvec{A}} = \det {P_r\varvec{A}P_c} = \prod _{i=0}^3 \det {\varvec{A}_{\Gamma _i}} = r_{2A}\,r_{4C}\,(r_{3B}r_{5D}+r_{3B}r_{5E}+r_{3E}r_{6B}), \end{aligned}$$
(26)

in which \(\Gamma_0 {:}{-} \left( \bigcup _{i=1}^3\Gamma _i\right) ^c\) is the complement of the union of all buffering structures. With Theorem 1, it is known that \(\det {\varvec{A}} = \frac{\det {(D^\intercal D)\cdot \det {(C^\intercal C)}}}{\det {\Lambda }}\cdot \det {J_g} = \det {J_g}\) since \(\det {(C^\intercal C)} = 8\), \(\det {(D^\intercal D)} = 2\), and \(\det {\Lambda } = 16\); meanwhile,

$$\begin{aligned} \det {J_f} = \left| { \begin{array}{ccccc} -r_{2A} & & -r_{2C} & & \\ r_{2A} & -r_{3B} - r_{6B} & r_{2C} & r_{5D} & -r_{3E} + r_{5E} \\ & r_{3B} & -r_{4C} & & r_{3E} \\ & r_{6B} & & -r_{5D} & -r_{5E} \\ & r_{6B} & & -r_{5D} & -r_{5E} \end{array}}\right| \equiv 0, \end{aligned}$$
(27)

which always vanishes and thus fails to be an informative bifurcation indicator.

Despite the vanishing standard Jacobian determinant, we see that the generalized SBA can be applied to this network to predict the bifurcation behaviors. Since A is a reactant in \(R_2\) and C is a reactant in \(R_4\), both \(r_{2A}\) and \(r_{4C}\) do not vanish but stay positive. The Eq. (26) implies that a bifurcation occurs only when \(\det {\varvec{A}_{\Gamma _3}}=0\). Furthermore, \(\Gamma _3\) is a buffering structure, one can conclude that the bifurcation behaviors can be exhibited only by chemicals BD, and E.

Influence graph among subnetworks

As shown by the two pedagogical examples, a network decomposition into subnetworks readily follows the rearrangement of the matrix \(\varvec{A}\). Explicitly, the square blocks in the diagonal of the upper block triangular \(P_r\varvec{A}P_c\) define disjoint subnetworks \(\Gamma _i\)’s. More specifically, the rearranged matrix \(P_r\varvec{A}P_c\) takes the form

$$\begin{aligned} P_r \varvec{A} P_c = \left( \begin{array}{cccc} A_{\Gamma _1} & Y_{12} & \cdots & Y_{1S}\\ {\,} & A_{\Gamma _2} & \cdots & Y_{2S} \\ {\,} & {\,} & \ddots & \vdots \\ {\,} & {\,} & {\,} & A_{\Gamma _S} \end{array}\right) , \end{aligned}$$
(28)

and the subnetworks \(\Gamma _i\)’s can be determined accordingly: a subnetwork \(\Gamma _i\) consists of a chemical/reaction if a \(\Gamma _i\)’s column/row is corresponding to the chemical/reaction. We term the subnetworks \(\Gamma _\alpha\)’s the determinant structures, which are not necessarily buffering structures, but a buffering structure is always a union of some determinant structures. In other words, determinant structures give a finer network decomposition then buffering structures do.

Our interest is the influence relation among these subnetworks \(\Gamma _i\)’s, which is termed determinant structures. Before introducing how the relation is revealed by SBA, we shall first clarify what it means by influence. We say a subnetwork \(\Gamma _\alpha\) influence another subnetwork \(\Gamma _\beta\) if there exists some parameter \(K_i\in \Gamma _\alpha\) and \(X_j\in \Gamma _\beta\) such that \(\frac{\delta x_i}{\delta k_j}\ne 0\), of which idea is identical to Eq. (16).

The influence relation among the determinant structures is encoded by blocks \(Y_{ij}\)’s in the matrix representation (28). In particular, a subnetwork \(\Gamma _j\) influences another subnetwork \(\Gamma _i\) if \(Y_{ij}\) is not a zero matrix. As such, we can draw a directed graph to visualize the influencing relation among subnetworks, by considering the adjacency matrix G32 defined by

$$\begin{aligned} G_{ij} = \left\{ \begin{array}{cl} 1 & \text {if }i\ne j\text { and }Y_{ji}\text { is not a zero block}, \\ 0 & \text {otherwise.} \end{array}\right. \end{aligned}$$
(29)

We may take the network given in Eq. (21) for example, with \(\Gamma _1 {:}{=}\{A, R_2\}\), \(\Gamma _2{:}{=}\{C, R_4\}\), \(\Gamma _3 {:}{=}\{B, D, E, R_3, R_5, R_6\}\), and \(\Gamma _4{:}{=}\{R_1\}\), according to the rearranged form \(P_r\varvec{A}P_c\) as in Eq. (25). The matrix can be rewritten into the form

$$\begin{aligned} P_r\varvec{A}P_c = \left( \begin{array}{cccc} \varvec{A}_{\Gamma _1} & Y_{12} & {\,} & Y_{14} \\ {\,} & \varvec{A}_{\Gamma _2} & {\,} & Y_{24} \\ {\,} & {\,} & \varvec{A}_{\Gamma _3} & Y_{34} \\ {\,} & {\,} & {\,} & \varvec{A}_{\Gamma _4} \end{array}\right) , \end{aligned}$$
(30)

suggesting the adjacency matrix G of the influence graph as

(31)

so that the influence relation among determinant structures can be clearly visualized. A determinant structure \(\Gamma _i\) influences another subnetwork \(\Gamma _j\) if there is a directed path from \(\Gamma _i\) to \(\Gamma _j\) in the influence graph. With the graph, it is straightforward to see that \(\Gamma _1, (\Gamma _1\cup \Gamma _2)\) and \(\Gamma _3\) are buffering structures, since they do not have their downstreams in the influence graph. It is clear to see that parameter changes in \(\Gamma _2\) could possibly influence \(\Gamma _1\) but not \(\Gamma _3\) and \(\Gamma _4\), since that only \(\Gamma _1\) is in the downstream for \(\Gamma _2\). It is also worthy of mention that the graph is acyclic (i.e., with no directed cycles), which means that a subnetwork would not be simultaneously in the upstream and the downstream for any other subnetwork. In summary, the influence graph renders the network a hierarchy of subnetworks, giving a structural insight into the equilibrium dynamics.