Dynamics of a linearly-perturbed May-Leonard competition model

The May--Leonard model was introduced to examine the behavior of three competing populations where rich dynamics, such as limit cycles and nonperiodic cyclic solutions, arise. In this work, we perturb the system by adding the capability of global mutations, allowing one species to evolve to the other two in a linear manner. We find that for small mutation rates the perturbed system not only retains some of the dynamics seen in the classical model, such as the three-species equal-population equilibrium bifurcating to a limit cycle, but also exhibits new behavior. For instance, we capture curves of fold bifurcations where pairs of equilibria emerge and then coalesce. As a result, we uncover parameter regimes with new types of stable fixed points that are distinct from the single- and dual-population equilibria characteristic of the original model. In short, a linear perturbation proves to be not at all trivial, with the modified system exhibiting new behavior captured even with small mutation rates.Comment: 29 pages, 12 figure

Eco-Evolutionary Feedback and the Invasion of Cooperation in Prisoner's Dilemma Games

Unveiling the origin and forms of cooperation in nature poses profound challenges in evolutionary ecology. The prisoner's dilemma game is an important metaphor for studying the evolution of cooperation. We here classified potential mechanisms for cooperation evolution into schemes of frequency- and density-dependent selection, and focused on the density-dependent selection in the ecological prisoner's dilemma games. We found that, although assortative encounter is still the necessary condition in ecological games for cooperation evolution, a harsh environment, indicated by a high mortality, can foster the invasion of cooperation. The Hamilton rule provides a fundamental condition for the evolution of cooperation by ensuring an enhanced relatedness between players in low-density populations. Incorporating ecological dynamics into evolutionary games opens up a much wider window for the evolution of cooperation, and exhibits a variety of complex behaviors of dynamics, such as limit and heteroclinic cycles. An alternative evolutionary, or rather succession, sequence was proposed that cooperation first appears in harsh environments, followed by the invasion of defection, which leads to a common catastrophe. The rise of cooperation (and altruism), thus, could be much easier in the density-dependent ecological games than in the classic frequency-dependent evolutionary games

Deterministic Approximation of a Stochastic Imitation Dynamics with Memory

We provide results of a deterministic approximation for non-Markovian stochastic processes modeling finite populations of individuals who recurrently play symmetric finite games and imitate each other according to payoffs. We show that a system of delay differential equations can be obtained as the deterministic approximation of such a non-Markovian process. We also show that if the initial states of stochastic process and the corresponding deterministic model are close enough, then the trajectory of stochastic process stays close to that of the deterministic model up to any given finite time horizon with a probability exponentially approaching one as the population size increases. We use this result to obtain that the lower bound of the population size on the absorption time of the non-Markovian process is exponentially increasing. Additionally, we obtain the replicator equations with distributed and discrete delay terms as examples and analyze how the memory of individuals can affect the evolution of cooperation in a two-player symmetric Snow-drift game. We investigate the stability of the evolutionary stable state of the game when agents have the memory of past population states, and implications of these results are given for the stochastic model.Comment: 23 pages, 2 figures one of which includes 4 subfigure

Rhythms and Evolution: Effects of Timing on Survival

The evolution of metabolism regulation is an intertwined process, where different strategies are constantly being developed towards a cognitive ability to perceive and respond to an environment. Organisms depend on an orchestration of a complex set of chemical reactions: maintaining homeostasis with a changing environment, while simultaneously sending material and energetic resources to where they are needed. The success of an organism requires efficient metabolic regulation, highlighting the connection between evolution, population dynamics and the underlying biochemistry. In this work, I represent organisms as coupled information-processing networks, that is, gene-regulatory networks receiving signals from the environment and acting on chemical reactions, eventually affecting material flows. I discuss the mechanisms through which metabolism control is improved during evolution and how the nonlinearities of competition influence this solution-searching process. The propagation of the populations through the resulting landscapes generally point to the role of the rhythm of cell division as an essential phenotypic feature driving evolution. Subsequently, as it naturally follows, different representations of organisms as oscillators are constructed to indicate more precisely how the interplay between competition, maturation timing and cell-division synchronisation affects the expected evolutionary outcomes, not always leading to the \"survival of the fastest\"

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

A complex systems approach to education in Switzerland

The insights gained from the study of complex systems in biological, social, and engineered systems enables us not only to observe and understand, but also to actively design systems which will be capable of successfully coping with complex and dynamically changing situations. The methods and mindset required for this approach have been applied to educational systems with their diverse levels of scale and complexity. Based on the general case made by Yaneer Bar-Yam, this paper applies the complex systems approach to the educational system in Switzerland. It confirms that the complex systems approach is valid. Indeed, many recommendations made for the general case have already been implemented in the Swiss education system. To address existing problems and difficulties, further steps are recommended. This paper contributes to the further establishment complex systems approach by shedding light on an area which concerns us all, which is a frequent topic of discussion and dispute among politicians and the public, where billions of dollars have been spent without achieving the desired results, and where it is difficult to directly derive consequences from actions taken. The analysis of the education system's different levels, their complexity and scale will clarify how such a dynamic system should be approached, and how it can be guided towards the desired performance