اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEvolutionary Games on Graphs and Discrete Dynamical Systems
181
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor, update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for $k$-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation and full defection. We construct examples to show that these conditions are not necessary. Finally, by formulating a list of open questions we emphasize the advantages of our rigorous approach.
قيم البحث
اقرأ أيضاً
We study two coupled discrete-time equations with different (asynchronous) periodic time scales. The coupling is of the type sample and hold, i.e., the state of each equation is sampled at its update times and held until it is read as an input at the
next update time for the other equation. We construct an interpolating two-dimensional complex-valued system on the union of the two time scales and an extrapolating four-dimensional system on the intersection of the two time scales. We discuss stability by several results, examples and counterexamples in various frameworks to show that the asynchronicity can have a significant impact on the dynamical properties.
We introduce a family of discrete dynamical systems which includes, and generalizes, the mutation dynamics of rank two cluster algebras. These systems exhibit behavior associated with integrability, namely preservation of a symplectic form, and in th
e tropical case, the existence of a conserved quantity. We show in certain cases that the orbits are unbounded. The tropical dynamics are related to matrix mutation, from the theory of cluster algebras. We are able to show that in certain special cases, the tropical map is periodic. We also explain how our dynamics imply the asymptotic sign-coherence observed by Gekhtman and Nakanishi in the $2$-dimensional situation.
In this paper, we investigate the embeddings for topological flows. We prove an embedding theorem for discrete topological system. Our results apply to suspension flows via constant function, and for this case we show an embedding theorem for suspens
ion flows and give a new proof of Gutman-Jin embedding theorem.
Multivector fields provide an avenue for studying continuous dynamical systems in a combinatorial framework. There are currently two approaches in the literature which use persistent homology to capture changes in combinatorial dynamical systems. The
first captures changes in the Conley index, while the second captures changes in the Morse decomposition. However, such approaches have limitations. The former approach only describes how the Conley index changes across a selected isolated invariant set though the dynamics can be much more complicated than the behavior of a single isolated invariant set. Likewise, considering a Morse decomposition omits much information about the individual Morse sets. In this paper, we propose a method to summarize changes in combinatorial dynamical systems by capturing changes in the so-called Conley-Morse graphs. A Conley-Morse graph contains information about both the structure of a selected Morse decomposition and about the Conley index at each Morse set in the decomposition. Hence, our method summarizes the changing structure of a sequence of dynamical systems at a finer granularity than previous approaches.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
