اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDelay stability of reaction systems
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Delay differential equations are used as a model when the effect of past states has to be taken into account. In this work we consider delay models of chemical reaction networks with mass action kinetics. We obtain a sufficient condition for absolute delay stability of equilibrium concentrations, i.e., local asymptotic stability independent of the delay parameters. Several interesting examples on sequestration networks with delays are presented.
قيم البحث
اقرأ أيضاً
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.
Many biochemical and industrial applications involve complicated networks of simultaneously occurring chemical reactions. Under the assumption of mass action kinetics, the dynamics of these chemical reaction networks are governed by systems of polyno
mial ordinary differential equations. The steady states of these mass action systems have been analysed via a variety of techniques, including elementary flux mode analysis, algebraic techniques (e.g. Groebner bases), and deficiency theory. In this paper, we present a novel method for characterizing the steady states of mass action systems. Our method explicitly links a networks capacity to permit a particular class of steady states, called toric steady states, to topological properties of a related network called a translated chemical reaction network. These networks share their reaction stoichiometries with their source network but are permitted to have different complex stoichiometries and different network topologies. We apply the results to examples drawn from the biochemical literature.
We are concerned with polynomial ordinary differential systems that arise from modelling chemical reaction networks. For such systems, which may be of high dimension and may depend on many parameters, it is frequently of interest to obtain a reductio
n of dimension in certain parameter ranges. Singular perturbation theory, as initiated by Tikhonov and Fenichel, provides a path toward such reductions. In the present paper we discuss parameter values that lead to singular perturbation reductions (so-called Tikhonov-Fenichel parameter values, or TFPVs). An algorithmic approach is known, but it is feasible for small dimensions only. Here we characterize conditions for classes of reaction networks for which TFPVs arise by turning off reactions (by setting rate parameters to zero), or by removing certain species (which relates to the classical quasi-steady state approach to model reduction). In particular, we obtain definitive results for the class of complex balanced reaction networks (of deficiency zero) and first order reaction networks.
We study two specific measures of quality of chemical reaction networks, Precision and Sensitivity. The two measures arise in the study of sensory adaptation, in which the reaction network is viewed as an input-output system. Given a step change in i
nput, Sensitivity is a measure of the magnitude of the response, while Precision is a measure of the degree to which the system returns to its original output for large time. High values of both are necessary for high-quality adaptation. We focus on reaction networks without dissipation, which we interpret as detailed-balance, mass-action networks. We give various upper and lower bounds on the optimal values of Sensitivity and Precision, characterized in terms of the stoichiometry, by using a combination of ideas from matroid theory and differential-equation theory. Among other results, we show that this class of non-dissipative systems contains networks with arbitrarily high values of both Sensitivity and Precision. This good performance does come at a cost, however, since certain ratios of concentrations need to be large, the network has to be extensive, or the network should show strongly different time scales.
We derive a reduction formula for singularly perturbed ordinary differential equations (in the sense of Tikhonov and Fenichel) with a known parameterization of the critical manifold. No a priori assumptions concerning separation of slow and fast vari
ables are made, or necessary.We apply the theoretical results to chemical reaction networks with mass action kinetics admitting slow and fast reactions. For some relevant classes of such systems there exist canonical parameterizations of the variety of stationary points, hence the theory is applicable in a natural manner. In particular we obtain a closed form expression for the reduced system when the fast subsystem admits complex balanced steady states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
