اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGraph-theoretic approaches to injectivity and multiple equilibria in systems of interacting elements
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 kinet
ics, 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 describe combinatorial approaches to the question of whether families of real matrices admit pairs of nonreal eigenvalues passing through the imaginary axis. When the matrices arise as Jacobian matrices in the study of dynamical systems, these con
ditions provide necessary conditions for Hopf bifurcations to occur in parameterised families of such systems. The techniques depend on the spectral properties of additive compound matrices: in particular, we associate with a product of matrices a signed, labelled digraph termed a DSR^[2] graph, which encodes information about the second additive compound of this product. A condition on the cycle structure of this digraph is shown to rule out the possibility of nonreal eigenvalues with positive real part. The techniques developed are applied to systems of interacting elements termed interaction networks, of which networks of chemical reactions are a special case.
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.
We establish characteristic factors for natural classes of polynomial multiple ergodic averages in rings of integers and derive corresponding Khintchine-type recurrence theorems, extending results of Frantzikinakis and Kra and of Frantzikinakis about
polynomial configurations in $mathbb{Z}$. Using previous work of Griesmer and of the second author and Robertson, we reduce the problem of finding characteristic factors to proving a result on equidistribution of polynomial orbits in nilmanifolds, which is of independent interest.
The leading-order approximation to a Filippov system $f$ about a generic boundary equilibrium $x^*$ is a system $F$ that is affine one side of the boundary and constant on the other side. We prove $x^*$ is exponentially stable for $f$ if and only if
it is exponentially stable for $F$ when the constant component of $F$ is not tangent to the boundary. We then show exponential stability and asymptotic stability are in fact equivalent for $F$. We also show exponential stability is preserved under small perturbations to the pieces of $F$. Such results are well known for homogeneous systems. To prove the results here additional techniques are required because the two components of $F$ have different degrees of homogeneity. The primary function of the results is to reduce the problem of the stability of $x^*$ from the general Filippov system $f$ to the simpler system $F$. Yet in general this problem remains difficult. We provide a four-dimensional example of $F$ for which orbits appear to converge to $x^*$ in a chaotic fashion. By utilising the presence of both homogeneity and sliding motion the dynamics of $F$ can in this case be reduced to the combination of a one-dimensional return map and a scalar function.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
