Do you want to publish a course? Click here

Absolute concentration robustness in power law kinetic systems

125   0   0.0 ( 0 )
 Added by Noel Fortun
 Publication date 2020
  fields
and research's language is English




Ask ChatGPT about the research

Absolute concentration robustness (ACR) is a condition wherein a species in a chemical kinetic system possesses the same value for any positive steady state the network may admit regardless of initial conditions. Thus far, results on ACR center on chemical kinetic systems with deficiency one. In this contribution, we use the idea of dynamic equivalence of chemical reaction networks to derive novel results that guarantee ACR for some classes of power law kinetic systems with deficiency zero. Furthermore, using network decomposition, we identify ACR in higher deficiency networks (i.e. deficiency $geq$ 2) by considering the presence of a low deficiency subnetwork with ACR. Network decomposition also enabled us to recognize and define a weaker form of concentration robustness than ACR, which we named as `balanced concentration robustness. Finally, we also discuss and emphasize our view of ACR as a primarily kinetic character rather than a condition that arises from structural sources.



rate research

Read More

There have been recent theoretic results that provide sufficient conditions for the existence of a species displaying absolute concentration robustness (ACR) in a power law kinetic (PLK) system. One such result involves the detection of ACR among networks of high deficiency by considering a lower deficiency subnetwork with ACR as a local property. In turn, this smaller subnetwork serves as a building block for the larger ACR-possessing network. Here, with this theorem as foundation, we construct an algorithm that systematically checks ACR in a PLK system. By slightly modifying the algorithm, we also provide a procedure that identifies balanced concentration robustness (BCR), a weaker form of concentration robustness than ACR, in a PLK system.
The fundamental decomposition of a chemical reaction network (also called its $mathscr{F}$-decomposition) is the set of subnetworks generated by the partition of its set of reactions into the fundamental classes introduced by Ji and Feinberg in 2011 as the basis of their higher deficiency algorithm for mass action systems. The first part of this paper studies the properties of the $mathscr{F}$-decomposition, in particular, its independence (i.e., the networks stoichiometric subspace is the direct sum of the subnetworks stoichiometric subspaces) and its incidence-independence (i.e., the image of the networks incidence map is the direct sum of the incidence maps images of the subnetworks). We derive necessary and sufficient conditions for these properties and identify network classes where the $mathscr{F}$-decomposition coincides with other known decompositions. The second part of the paper applies the above-mentioned results to improve the Multistationarity Algorithm for power-law kinetic systems (MSA), a general computational approach that we introduced in previous work. We show that for systems with non-reactant determined interactions but with an independent $mathscr{F}$-decomposition, the transformation to a dynamically equivalent system with reactant-determined interactions -- required in the original MSA -- is not necessary. We illustrate this improvement with the subnetwork of Schmitzs carbon cycle model recently analyzed by Fortun et al.
Persistence and permanence are properties of dynamical systems that describe the long-term behavior of the solutions, and in particular specify whether positive solutions approach the boundary of the positive orthant. Mass-action systems (or more generally power-law systems) are very common in chemistry, biology, and engineering, and are often used to describe the dynamics in interaction networks. We prove that two-species mass-action systems derived from weakly reversible networks are both persistent and permanent, for any values of the reaction rate parameters. Moreover, we prove that a larger class of networks, called endotactic networks, also give rise to permanent systems, even if we allow the reaction rate parameters to vary in time. These results also apply to power-law systems and other nonlinear dynamical systems. In addition, ideas behind these results allow us to prove the Global Attractor Conjecture for three-species systems.
A persistent dynamical system in $mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for large $t$. These properties have important applications for the study of mathematical models in biochemistry, cell biology, and ecology. Inspired by reaction network theory, we define a class of polynomial dynamical systems called tropically endotactic. We show that two-dimensional tropically endotactic polynomial dynamical systems are permanent, irrespective of the values of (possibly time-dependent) parameters in these systems. These results generalize the permanence of two-dimensional reversible, weakly reversible, and endotactic mass action systems.
A complex balanced kinetic system is absolutely complex balanced (ACB) if every positive equilibrium is complex balanced. Two results on absolute complex balancing were foundational for modern chemical reaction network theory (CRNT): in 1972, M. Feinberg proved that any deficiency zero complex balanced system is absolutely complex balanced. In the same year, F. Horn and R. Jackson showed that the (full) converse of the result is not true: any complex balanced mass action system, regardless of its deficiency, is absolutely complex balanced. In this paper, we revive the study of ACB systems first by providing a partial converse to Feinbergs Theorem. In the spirit of Horn and Jacksons result, we then describe several methods for constructing new classes of ACB systems with positive deficiency and present classes of power law kinetic systems for each method. Furthermore, we illustrate the usefulness of the ACB property for obtaining new results on absolute concentration robustness (ACR) in a species, a concept introduced for mass action systems by Shinar and Feinberg in 2010, for a class of power law systems. Finally, we motivate the study of ACB in poly-PL systems, i.e. sums of power law systems, and indicate initial results.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا