Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHomotopy methods for counting reaction network equilibria
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Dynamical system models of complex biochemical reaction networks are usually high-dimensional, nonlinear, and contain many unknown parameters. In some cases the reaction network structure dictates that positive equilibria must be unique for all values of the parameters in the model. In other cases multiple equilibria exist if and only if special relationships between these parameters are satisfied. We describe methods based on homotopy invariance of degree which allow us to determine the number of equilibria for complex biochemical reaction networks and how this number depends on parameters in the model.
rate research
Read More
We develop a general stability theory for equilibrium points of Poisson dynamical systems and relative equilibria of Hamiltonian systems with symmetries, including several generalisations of the Energy-Casimir and Energy-Momentum methods. Using a topological generalisation of Lyapunovs result that an extremal critical point of a conserved quantity is stable, we show that a Poisson equilibrium is stable if it is an isolated point in the intersection of a level set of a conserved function with a subset of the phase space that is related to the non-Hausdorff nature of the symplectic leaf space at that point. This criterion is applied to generalise the Energy-Momentum method to Hamiltonian systems which are invariant under non-compact symmetry groups for which the coadjoint orbit space is not Hausdorff. We also show that a $G$-stable relative equilibrium satisfies the stronger condition of being $A$-stable, where $A$ is a specific group-theoretically defined subset of $G$ which contains the momentum isotropy subgroup of the relative equilibrium.
In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chemical kinetics, such as mass-action kinetics, Michaelis-Menten kinetics, etc. Our results relate previously described linear algebraic and graph-theoretic conditions for injectivity of chemical reaction systems. After developing a translation between the two formalisms, we show that a graph-theoretic test developed earlier in the context of systems with mass action kinetics, can be applied to reaction systems with arbitrary kinetics. The test, which is easy to implement algorithmically, and can often be decided without the need for any computation, rules out the possibility of multiple equilibria for the systems in question.
We present conditions which guarantee a parametrization of the set of positive equilibria of a generalized mass-action system. Our main results state that (i) if the underlying generalized chemical reaction network has an effective deficiency of zero, then the set of positive equilibria coincides with the parametrized set of complex-balanced equilibria and (ii) if the network is weakly reversible and has a kinetic deficiency of zero, then the equilibrium set is nonempty and has a positive, typically rational, parametrization. Via the method of network translation, we apply our results to classical mass-action systems studied in the biochemical literature, including the EnvZ-OmpR and shuttled WNT signaling pathways. A parametrization of the set of positive equilibria of a (generalized) mass-action system is often a prerequisite for the study of multistationarity and allows an easy check for the occurrence of absolute concentration robustness (ACR), as we demonstrate for the EnvZ-OmpR pathway.
This paper presents novel decomposition classes of chemical reaction networks (CRNs) derived from S-system kinetics. Based on the network decomposition theory initiated by Feinberg in 1987, we introduce the concept of incidence independent decompositions and develop the theory of $mathscr{C}$- and $mathscr{C}^*$- decompositions which partition the set of complexes and the set of nonzero complexes respectively, including their structure theorems in terms of linkage classes. Analogous to Feinbergs independent decomposition, we demonstrate the important relationship between sets of complex balance equilibria for an incidence independent decomposition of weakly reversible subnetworks for any kinetics. We show that the $mathscr{C}^*$-decompositions are also incidence independent. We also introduce in this paper a new realization for an S-system that is analyzed using a newly defined class of species coverable CRNs. This led to the extension of the deficiency formula and characterization of fundamental decompositions of species decomposable reaction networks.
In the first part of this paper, we propose new optimization-based methods for the computation of preferred (dense, sparse, reversible, detailed and complex balanced) linearly conjugate reaction network structures with mass action dynamics. The developed methods are extensions of previously published results on dynamically equivalent reaction networks and are based on mixed-integer linear programming. As related theoretical contributions we show that (i) dense linearly conjugate networks define a unique super-structure for any positive diagonal state transformation if the set of chemical complexes is given, and (ii) the existence of linearly conjugate detailed balanced and complex balanced networks do not depend on the selection of equilibrium points. In the second part of the paper it is shown that determining dynamically equivalent realizations to a network that is structurally fixed but parametrically not can also be written and solved as a mixed-integer linear programming problem. Several examples illustrate the presented computation methods.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
