اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn classes of reaction networks and their associated polynomial dynamical systems
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In the study of reaction networks and the polynomial dynamical systems that they generate, special classes of networks with important properties have been identified. These include reversible, weakly reversible}, and, more recently, endotactic networks. While some inclusions between these network types are clear, such as the fact that all reversible networks are weakly reversible, other relationships are more complicated. Adding to this complexity is the possibility that inclusions be at the level of the dynamical systems generated by the networks rather than at the level of the networks themselves. We completely characterize the inclusions between reversible, weakly reversible, endotactic, and strongly endotactic network, as well as other less well studied network types. In particular, we show that every strongly endotactic network in two dimensions can be generated by an extremally weakly reversible network. We also introduce a new class of source-only networks, which is a computationally convenient property for networks to have, and show how this class relates to the above mentioned network types.
قيم البحث
اقرأ أيضاً
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations give rise to
maps between dynamical systems on networks. This allows us to produce conjugacy between dynamical systems out of combinatorial data. In particular we show that surjective graph fibrations lead to synchrony subspaces in networks. The injective graph fibrations, on the other hand, give rise to surjective maps from large dynamical systems to smaller ones. One can view these surjections as a kind of fast/slow variable decompositions or as abstractions in the computer science sense of the word.
We characterize the dynamical systems consisting of the set of 5-adic integers and polynomial maps which consist of only one minimal component.
Neural Networks (NNs) have been identified as a potentially powerful tool in the study of complex dynamical systems. A good example is the NN differential equation (DE) solver, which provides closed form, differentiable, functional approximations for
the evolution of a wide variety of dynamical systems. A major disadvantage of such NN solvers can be the amount of computational resources needed to achieve accuracy comparable to existing numerical solvers. We present new strategies for existing dynamical system NN DE solvers, making efficient use of the textit{learnt} information, to speed up their training process, while still pursuing a completely unsupervised approach. We establish a fundamental connection between NN theory and dynamical systems theory via Koopman Operator Theory (KOT), by showing that the usual training processes for Neural Nets are fertile ground for identifying multiple Koopman operators of interest. We end by illuminating certain applications that KOT might have for NNs in general.
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.
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 devel
oped 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
