Search arXivSearch

arXiv · 1403.3792

Globally synchronized oscillations in complex cyclic games

Abstract

The Rock-Paper-Scissors (RPS) game and its generalizations with ${\cal S}>3$ species are well studied models for cyclically interacting populations. Four is, however, the minimum number of species that, by allowing other interactions beyond the single, cyclic loop, breaks both the full intransitivity of the food graph and the one predator, one prey symmetry. Lütz {\it et al} (J. Theor. Biol. {\bf 317} (2013) 286) have shown the existence, on a square lattice, of two distinct phases, with either four or three coexisting species. In both phases, each agent is eventually replaced by one of its predators but these strategy oscillations remain localized as long as the interactions are short ranged. Distant regions may be either out of phase or cycling through different food web subloops (if any). Here we show that upon replacing a minimum fraction $Q_c$ of the short range interactions by long range ones, there is a Hopf bifurcation and global oscillations become stable. Surprisingly, to build such long distance, global synchronization, the four species coexistence phase requires less long range interactions than the three species phase, while one would naively expect the contrary. Moreover, deviations from highly homogeneous conditions ($χ=0$ or 1) increase $Q_c$ and the more heterogeneous is the food web, the harder the synchronization is. By further increasing $Q$, while the three species phase remains stable, the four species one has a transition to an absorbing, single species state. The existence of a phase with global oscillations for ${\cal S}>3$, when the interaction graph has multiple subloops and several possible local cycles, lead to the conjecture that global oscillations are a general characteristic, even for large, realistic food webs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charlotte Rulquin, Jeferson J. Arenzon. 2014-03-15. Globally synchronized oscillations in complex cyclic games. https://doi.org/10.1103/physreve.89.032133

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE