اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGradient systems on coupled cell networks
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell graph, and we use tools from graph theory to deduce the general form of such functions, relating it to the topological structure of the graph defining the network. The coupling of pairs of dynamical systems cells is represented by edges of the graph, and from spectral graph theory we detect the existence and nature of equilibria of the gradient system from the critical points of the coupling function. In particular, we study fully synchronous and 2-state patterns of equilibria on regular graphs.These are two special types of equilibrium configurations for gradient networks. We also investigate equilibrium configurations of S1-invariant admissible functions on a ring of cells.
قيم البحث
اقرأ أيضاً
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.
A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in different
ways, which can be represented graphically by different symbols, or abstractly by equivalence relations. Various synchronous behaviors, from full synchrony to partial synchrony, can be observed for a given network. Patterns of synchrony, which do not depend on specific dynamics of the network, but only on the network structure, are associated with a special type of partition of cells, termed balanced equivalence relations. Algorithms in Aldis (2008) and Belykh and Hasler (2011) find the unique pattern of synchrony with the least clusters. In this paper, we compute the set of all possible patterns of synchrony and show their hierarchy structure as a complete lattice. We represent the network structure of a given coupled cell network by a symbolic adjacency matrix encoding the different coupling types. We show that balanced equivalence relations can be determined by a matrix computation on the adjacency matrix which forms a block structure for each balanced equivalence relation. This leads to a computer algorithm to search for all possible balanced equivalence relations. Our computer program outputs the balanced equivalence relations, quotient matrices, and a complete lattice for user specified coupled cell networks. Finding the balanced equivalence relations of any network of up to 15 nodes is tractable, but for larger networks this depends on the pattern of synchrony with least clusters.
Recently, the synchronization of coupled dynamical systems has been widely studied. Synchronization is referred to as a process wherein two (or many) dynamical systems are adjusted to a common behavior as time goes to infinity, due to coupling or for
cing. Therefore, before discussing synchronization, a basic problem on continuation of the solution must be solved: For given initial conditions, can the solution of coupled dynamical systems be extended to the infinite interval $[0,+infty)$? In this paper, we propose a general model of coupled dynamical systems, which includes previously studied systems as special cases, and prove that under the assumption of QUAD, the solution of the general model exists on $[0,+infty)$.
We define a graph network to be a coupled cell network where there are only one type of cell and one type of symmetric coupling between the cells. For a difference-coupled vector field on a graph network system, all the cells have the same internal d
ynamics, and the coupling between cells is identical, symmetric, and depends only on the difference of the states of the interacting cells. We define four nested sets of difference-coupled vector fields by adding further restrictions on the internal dynamics and the coupling functions. These restrictions require that these functions preserve zero or are odd or linear. We characterize the synchrony and anti-synchrony subspaces with respect to these four subsets of admissible vector fields. Synchrony and anti-synchrony subspaces are determined by partitions and matched partitions of the cells that satisfy certain balance conditions. We compute the lattice of synchrony and anti-synchrony subspaces for several graph networks. We also apply our theory to systems of coupled van der Pol oscillators.
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 networ
ks. 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
