اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGraph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems
223
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 extend previous work on injectivity in chemical reaction networks to general interaction networks. Matrix- and graph-theoretic conditions for injectivity of these systems are presented. A particular signed, directed, labelled, bipartite multigraph
, termed the ``DSR graph, is shown to be a useful representation of an interaction network when discussing questions of injectivity. A graph-theoretic condition, developed previously in the context of chemical reaction networks, is shown to be sufficient to guarantee injectivity for a large class of systems. The graph-theoretic condition is simple to state and often easy to check. Examples are presented to illustrate the wide applicability of the theory developed.
The goal of this paper is to gather and develop some necessary and sufficient criteria for injectivity and multistationarity in vector fields associated with a chemical reaction network under a variety of more or less general assumptions on the natur
e of the network and the reaction rates. The results are primarily linear algebraic or matrix-theoretic, with some graph-theoretic results also mentioned. Several results appear in, or are close to, results in the literature. Here, we emphasise the connections between the results, and where possible, present elementary proofs which rely solely on basic linear algebra and calculus. A number of examples are provided to illustrate the variety of subtly different conclusions which can be reached via different computations. In addition, many of the computations are implemented in a web-based open source platform, allowing the reader to test examples including and beyond those analysed in the paper.
Delay mass-action systems provide a model of chemical kinetics when past states influence the current dynamics. In this work, we provide a graph-theoretic condition for delay stability, i.e., linear stability independent of both rate constants and de
lay parameters. In particular, the result applies when the system has no delay, implying asymptotic stability for the ODE system. The graph-theoretic condition is about cycles in the directed species-reaction graph of the network, which encodes how different species in the system interact.
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 value
s 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.
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 decomposit
ions 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
