1
|
Moawad A, Abbara A, Bitbol AF. Evolution of cooperation in deme-structured populations on graphs. Phys Rev E 2024; 109:024307. [PMID: 38491653 DOI: 10.1103/physreve.109.024307] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/18/2023] [Accepted: 12/19/2023] [Indexed: 03/18/2024]
Abstract
Understanding how cooperation can evolve in populations despite its cost to individual cooperators is an important challenge. Models of spatially structured populations with one individual per node of a graph have shown that cooperation, modeled via the prisoner's dilemma, can be favored by natural selection. These results depend on microscopic update rules, which determine how birth, death, and migration on the graph are coupled. Recently, we developed coarse-grained models of spatially structured populations on graphs, where each node comprises a well-mixed deme, and where migration is independent from division and death, thus bypassing the need for update rules. Here, we study the evolution of cooperation in these models in the rare-migration regime, within the prisoner's dilemma. We find that cooperation is not favored by natural selection in these coarse-grained models on graphs where overall deme fitness does not directly impact migration from a deme. This is due to a separation of scales, whereby cooperation occurs at a local level within demes, while spatial structure matters between demes.
Collapse
Affiliation(s)
- Alix Moawad
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland and SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| | - Alia Abbara
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland and SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| | - Anne-Florence Bitbol
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland and SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| |
Collapse
|
2
|
Abbara A, Bitbol AF. Frequent asymmetric migrations suppress natural selection in spatially structured populations. PNAS NEXUS 2023; 2:pgad392. [PMID: 38024415 PMCID: PMC10667037 DOI: 10.1093/pnasnexus/pgad392] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 07/16/2023] [Accepted: 11/06/2023] [Indexed: 12/01/2023]
Abstract
Natural microbial populations often have complex spatial structures. This can impact their evolution, in particular the ability of mutants to take over. While mutant fixation probabilities are known to be unaffected by sufficiently symmetric structures, evolutionary graph theory has shown that some graphs can amplify or suppress natural selection, in a way that depends on microscopic update rules. We propose a model of spatially structured populations on graphs directly inspired by batch culture experiments, alternating within-deme growth on nodes and migration-dilution steps, and yielding successive bottlenecks. This setting bridges models from evolutionary graph theory with Wright-Fisher models. Using a branching process approach, we show that spatial structure with frequent migrations can only yield suppression of natural selection. More precisely, in this regime, circulation graphs, where the total incoming migration flow equals the total outgoing one in each deme, do not impact fixation probability, while all other graphs strictly suppress selection. Suppression becomes stronger as the asymmetry between incoming and outgoing migrations grows. Amplification of natural selection can nevertheless exist in a restricted regime of rare migrations and very small fitness advantages, where we recover the predictions of evolutionary graph theory for the star graph.
Collapse
Affiliation(s)
- Alia Abbara
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland
- SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| | - Anne-Florence Bitbol
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland
- SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| |
Collapse
|
3
|
Sharma N, Yagoobi S, Traulsen A. Self-loops in evolutionary graph theory: Friends or foes? PLoS Comput Biol 2023; 19:e1011387. [PMID: 37656739 PMCID: PMC10501642 DOI: 10.1371/journal.pcbi.1011387] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/27/2023] [Revised: 09/14/2023] [Accepted: 07/25/2023] [Indexed: 09/03/2023] Open
Abstract
Evolutionary dynamics in spatially structured populations has been studied for a long time. More recently, the focus has been to construct structures that amplify selection by fixing beneficial mutations with higher probability than the well-mixed population and lower probability of fixation for deleterious mutations. It has been shown that for a structure to substantially amplify selection, self-loops are necessary when mutants appear predominately in nodes that change often. As a result, for low mutation rates, self-looped amplifiers attain higher steady-state average fitness in the mutation-selection balance than well-mixed populations. But what happens when the mutation rate increases such that fixation probabilities alone no longer describe the dynamics? We show that self-loops effects are detrimental outside the low mutation rate regime. In the intermediate and high mutation rate regime, amplifiers of selection attain lower steady-state average fitness than the complete graph and suppressors of selection. We also provide an estimate of the mutation rate beyond which the mutation-selection dynamics on a graph deviates from the weak mutation rate approximation. It involves computing average fixation time scaling with respect to the population sizes for several graphs.
Collapse
Affiliation(s)
- Nikhil Sharma
- Department of Theoretical Biology, Max Planck Institute for Evolutionary Biology, Plön, Germany
| | - Sedigheh Yagoobi
- Department of Theoretical Biology, Max Planck Institute for Evolutionary Biology, Plön, Germany
| | - Arne Traulsen
- Department of Theoretical Biology, Max Planck Institute for Evolutionary Biology, Plön, Germany
| |
Collapse
|
4
|
Liu R, Masuda N. Fixation dynamics on hypergraphs. PLoS Comput Biol 2023; 19:e1011494. [PMID: 37751462 PMCID: PMC10558078 DOI: 10.1371/journal.pcbi.1011494] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/16/2023] [Revised: 10/06/2023] [Accepted: 09/05/2023] [Indexed: 09/28/2023] Open
Abstract
Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals. In the present study, we propose and analyze evolutionary dynamics on hypergraphs, in which each node takes one of the two types of different but constant fitness values. For the corresponding dynamics on conventional networks, under the birth-death process and uniform initial conditions, most networks are known to be amplifiers of natural selection; amplifiers by definition enhance the difference in the strength of the two competing types in terms of the probability that the mutant type fixates in the population. In contrast, we provide strong computational evidence that a majority of hypergraphs are suppressors of selection under the same conditions by combining theoretical and numerical analyses. We also show that this suppressing effect is not explained by one-mode projection, which is a standard method for expressing hypergraph data as a conventional network. Our results suggest that the modeling framework for structured populations in addition to the specific network structure is an important determinant of evolutionary dynamics, paving a way to studying fixation dynamics on higher-order networks including hypergraphs.
Collapse
Affiliation(s)
- Ruodan Liu
- Department of Mathematics, State University of New York at Buffalo, Buffalo, New York, United States of America
| | - Naoki Masuda
- Department of Mathematics, State University of New York at Buffalo, Buffalo, New York, United States of America
- Computational and Data-Enabled Sciences and Engineering Program, State University of New York at Buffalo, Buffalo, New York, United States of America
| |
Collapse
|
5
|
Richter H. Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating. J Math Biol 2023; 87:3. [PMID: 37284903 DOI: 10.1007/s00285-023-01937-1] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/05/2022] [Revised: 01/03/2023] [Accepted: 05/19/2023] [Indexed: 06/08/2023]
Abstract
The paper deals with two interrelated topics: (1) identifying transient amplifiers in an iterative process, and (2) analyzing the process by its spectral dynamics, which is the change in the graph spectra by edge manipulation. Transient amplifiers are networks representing population structures which shift the balance between natural selection and random drift. Thus, amplifiers are highly relevant for understanding the relationships between spatial structures and evolutionary dynamics. We study an iterative procedure to identify transient amplifiers for death-Birth updating. The algorithm starts with a regular input graph and iteratively removes edges until desired structures are achieved. Thus, a sequence of candidate graphs is obtained. The edge removals are guided by quantities derived from the sequence of candidate graphs. Moreover, we are interested in the Laplacian spectra of the candidate graphs and analyze the iterative process by its spectral dynamics. The results show that although transient amplifiers for death-Birth updating are generally rare, a substantial number of them can be obtained by the proposed procedure. The graphs identified share structural properties and have some similarity to dumbbell and barbell graphs. We analyze amplification properties of these graphs and also two more families of bell-like graphs and show that further transient amplifiers for death-Birth updating can be found. Finally, it is demonstrated that the spectral dynamics possesses characteristic features useful for deducing links between structural and spectral properties. These feature can also be taken for distinguishing transient amplifiers among evolutionary graphs in general.
Collapse
Affiliation(s)
- Hendrik Richter
- Faculty of Engineering, HTWK Leipzig University of Applied Sciences, Leipzig, Germany.
| |
Collapse
|
6
|
Yagoobi S, Sharma N, Traulsen A. Categorizing update mechanisms for graph-structured metapopulations. J R Soc Interface 2023; 20:20220769. [PMID: 36919418 PMCID: PMC10015335 DOI: 10.1098/rsif.2022.0769] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 03/16/2023] Open
Abstract
The structure of a population strongly influences its evolutionary dynamics. In various settings ranging from biology to social systems, individuals tend to interact more often with those present in their proximity and rarely with those far away. A common approach to model the structure of a population is evolutionary graph theory. In this framework, each graph node is occupied by a reproducing individual. The links connect these individuals to their neighbours. The offspring can be placed on neighbouring nodes, replacing the neighbours-or the progeny of its neighbours can replace a node during the course of ongoing evolutionary dynamics. Extending this theory by replacing single individuals with subpopulations at nodes yields a graph-structured metapopulation. The dynamics between the different local subpopulations is set by an update mechanism. There are many such update mechanisms. Here, we classify update mechanisms for structured metapopulations, which allows to find commonalities between past work and illustrate directions for further research and current gaps of investigation.
Collapse
Affiliation(s)
- Sedigheh Yagoobi
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, August-Thienemann Strasse 2, Plön 24306, Germany
| | - Nikhil Sharma
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, August-Thienemann Strasse 2, Plön 24306, Germany
| | - Arne Traulsen
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, August-Thienemann Strasse 2, Plön 24306, Germany
| |
Collapse
|
7
|
Pires DL, Broom M. More can be better: An analysis of single-mutant fixation probability functions under 2 × 2 games. Proc Math Phys Eng Sci 2022. [DOI: 10.1098/rspa.2022.0577] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022] Open
Abstract
Evolutionary game theory has proved to be a powerful tool to probe the self-organization of collective behaviour by considering frequency-dependent fitness in evolutionary processes. It has shown that the stability of a strategy depends not only on the payoffs received after each encounter but also on the population’s size. Here, we study
2
×
2
games in well-mixed finite populations by analyzing the fixation probabilities of single mutants as functions of population size. We proved that nine of the 24 possible games always lead to monotonically decreasing functions, similarly to fixed fitness scenarios. However, fixation functions showed increasing regions under 12 distinct anti-coordination, coordination and dominance games. Perhaps counter-intuitively, this establishes that single-mutant strategies often benefit from being in larger populations. Fixation functions that increase from a global minimum to a positive asymptotic value are pervasive but may have been easily concealed by the weak selection limit. We obtained sufficient conditions to observe fixation increasing for small populations and three distinct ways this can occur. Finally, we describe fixation functions with the increasing regions bounded by two extremes under intermediate population sizes. We associate their occurrence with transitions from having one global extreme to other shapes.
Collapse
Affiliation(s)
- Diogo L. Pires
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK
| | - Mark Broom
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK
| |
Collapse
|
8
|
Monk T, van Schaik A. Martingales and the fixation time of evolutionary graphs with arbitrary dimensionality. ROYAL SOCIETY OPEN SCIENCE 2022; 9:220011. [PMID: 35573040 PMCID: PMC9091843 DOI: 10.1098/rsos.220011] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 01/06/2022] [Accepted: 04/01/2022] [Indexed: 05/03/2023]
Abstract
Evolutionary graph theory (EGT) investigates the Moran birth-death process constrained by graphs. Its two principal goals are to find the fixation probability and time for some initial population of mutants on the graph. The fixation probability of graphs has received considerable attention. Less is known about the distribution of fixation time. We derive clean, exact expressions for the full conditional characteristic functions (CCFs) of a close proxy to fixation and extinction times. That proxy is the number of times that the mutant population size changes before fixation or extinction. We derive these CCFs from a product martingale that we identify for an evolutionary graph with any number of partitions. The existence of that martingale only requires that the connections between those partitions are of a certain type. Our results are the first expressions for the CCFs of any proxy to fixation time on a graph with any number of partitions. The parameter dependence of our CCFs is explicit, so we can explore how they depend on graph structure. Martingales are a powerful approach to study principal problems of EGT. Their applicability is invariant to the number of partitions in a graph, so we can study entire families of graphs simultaneously.
Collapse
Affiliation(s)
- Travis Monk
- International Centre for Neuromorphic Systems, The MARCS Institute, Western Sydney University, Sydney, Australia
| | - André van Schaik
- International Centre for Neuromorphic Systems, The MARCS Institute, Western Sydney University, Sydney, Australia
| |
Collapse
|
9
|
Labavić D, Loverdo C, Bitbol AF. Hydrodynamic flow and concentration gradients in the gut enhance neutral bacterial diversity. Proc Natl Acad Sci U S A 2022; 119:e2108671119. [PMID: 34969835 PMCID: PMC8740595 DOI: 10.1073/pnas.2108671119] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Accepted: 11/08/2021] [Indexed: 01/23/2023] Open
Abstract
The gut microbiota features important genetic diversity, and the specific spatial features of the gut may shape evolution within this environment. We investigate the fixation probability of neutral bacterial mutants within a minimal model of the gut that includes hydrodynamic flow and resulting gradients of food and bacterial concentrations. We find that this fixation probability is substantially increased, compared with an equivalent well-mixed system, in the regime where the profiles of food and bacterial concentration are strongly spatially dependent. Fixation probability then becomes independent of total population size. We show that our results can be rationalized by introducing an active population, which consists of those bacteria that are actively consuming food and dividing. The active population size yields an effective population size for neutral mutant fixation probability in the gut.
Collapse
Affiliation(s)
- Darka Labavić
- CNRS, Institut de Biologie Paris-Seine, Laboratoire Jean Perrin (UMR 8237), Sorbonne Université, F-75005 Paris, France
| | - Claude Loverdo
- CNRS, Institut de Biologie Paris-Seine, Laboratoire Jean Perrin (UMR 8237), Sorbonne Université, F-75005 Paris, France;
| | - Anne-Florence Bitbol
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland;
- SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| |
Collapse
|
10
|
Balasekaran M, Johanis M, Rychtář J, Taylor D, Zhu J. Quasi-neutral evolution in populations under small demographic fluctuations. J Theor Biol 2022; 538:111040. [DOI: 10.1016/j.jtbi.2022.111040] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/02/2021] [Revised: 01/11/2022] [Accepted: 01/19/2022] [Indexed: 10/19/2022]
|
11
|
Marrec L, Lamberti I, Bitbol AF. Toward a Universal Model for Spatially Structured Populations. PHYSICAL REVIEW LETTERS 2021; 127:218102. [PMID: 34860074 DOI: 10.1103/physrevlett.127.218102] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/19/2021] [Revised: 07/23/2021] [Accepted: 10/06/2021] [Indexed: 06/13/2023]
Abstract
A key question in evolution is how likely a mutant is to take over. This depends on natural selection and on stochastic fluctuations. Population spatial structure can impact mutant fixation probabilities. We introduce a model for structured populations on graphs that generalizes previous ones by making migrations independent of birth and death. We demonstrate that by tuning migration asymmetry, the star graph transitions from amplifying to suppressing natural selection. The results from our model are universal in the sense that they do not hinge on a modeling choice of microscopic dynamics or update rules. Instead, they depend on migration asymmetry, which can be experimentally tuned and measured.
Collapse
Affiliation(s)
- Loïc Marrec
- Sorbonne Université, CNRS, Institut de Biologie Paris-Seine, Laboratoire Jean Perrin (UMR 8237), F-75005 Paris, France
| | - Irene Lamberti
- Sorbonne Université, CNRS, Institut de Biologie Paris-Seine, Laboratoire Jean Perrin (UMR 8237), F-75005 Paris, France
| | - Anne-Florence Bitbol
- Sorbonne Université, CNRS, Institut de Biologie Paris-Seine, Laboratoire Jean Perrin (UMR 8237), F-75005 Paris, France
- Institute of Bioengineering, School of Life Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland
- SIB Swiss Institute of Bioinformatics, CH-1015 Lausanne, Switzerland
| |
Collapse
|
12
|
Richter H. Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. J Math Biol 2021; 82:61. [PMID: 33993365 PMCID: PMC8126557 DOI: 10.1007/s00285-021-01609-y] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/18/2021] [Revised: 03/31/2021] [Accepted: 04/19/2021] [Indexed: 11/24/2022]
Abstract
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or becomes extinct. The outcome naturally depends on the fitness of the mutant and the rules by which mutants and residents may propagate on the network, but arguably the most determining factor is the network structure. Some structured networks are transient amplifiers. They increase for a certain fitness range the fixation probability of beneficial mutations as compared to a well-mixed population. We study a perturbation method for identifying transient amplifiers for death–birth updating. The method involves calculating the coalescence times of random walks on graphs and finding the vertex with the largest remeeting time. If the graph is perturbed by removing an edge from this vertex, there is a certain likelihood that the resulting perturbed graph is a transient amplifier. We test all pairwise nonisomorphic regular graphs up to a certain order and thus cover the whole structural range expressible by these graphs. For cubic and quartic regular graphs we find a sufficiently large number of transient amplifiers. For these networks we carry out a spectral analysis and show that the graphs from which transient amplifiers can be constructed share certain structural properties. Identifying spectral and structural properties may promote finding and designing such networks.
Collapse
Affiliation(s)
- Hendrik Richter
- HTWK Leipzig University of Applied Sciences, Leipzig, Germany.
| |
Collapse
|
13
|
Allen B, Sample C, Steinhagen P, Shapiro J, King M, Hedspeth T, Goncalves M. Fixation probabilities in graph-structured populations under weak selection. PLoS Comput Biol 2021; 17:e1008695. [PMID: 33529219 PMCID: PMC7880501 DOI: 10.1371/journal.pcbi.1008695] [Citation(s) in RCA: 8] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/14/2020] [Revised: 02/12/2021] [Accepted: 01/11/2021] [Indexed: 12/12/2022] Open
Abstract
A population's spatial structure affects the rate of genetic change and the outcome of natural selection. These effects can be modeled mathematically using the Birth-death process on graphs. Individuals occupy the vertices of a weighted graph, and reproduce into neighboring vertices based on fitness. A key quantity is the probability that a mutant type will sweep to fixation, as a function of the mutant's fitness. Graphs that increase the fixation probability of beneficial mutations, and decrease that of deleterious mutations, are said to amplify selection. However, fixation probabilities are difficult to compute for an arbitrary graph. Here we derive an expression for the fixation probability, of a weakly-selected mutation, in terms of the time for two lineages to coalesce. This expression enables weak-selection fixation probabilities to be computed, for an arbitrary weighted graph, in polynomial time. Applying this method, we explore the range of possible effects of graph structure on natural selection, genetic drift, and the balance between the two. Using exhaustive analysis of small graphs and a genetic search algorithm, we identify families of graphs with striking effects on fixation probability, and we analyze these families mathematically. Our work reveals the nuanced effects of graph structure on natural selection and neutral drift. In particular, we show how these notions depend critically on the process by which mutations arise.
Collapse
Affiliation(s)
- Benjamin Allen
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Christine Sample
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Patricia Steinhagen
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Julia Shapiro
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Matthew King
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Timothy Hedspeth
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Megan Goncalves
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| |
Collapse
|
14
|
Allen B, Sample C, Jencks R, Withers J, Steinhagen P, Brizuela L, Kolodny J, Parke D, Lippner G, Dementieva YA. Transient amplifiers of selection and reducers of fixation for death-Birth updating on graphs. PLoS Comput Biol 2020; 16:e1007529. [PMID: 31951612 PMCID: PMC6968840 DOI: 10.1371/journal.pcbi.1007529] [Citation(s) in RCA: 23] [Impact Index Per Article: 5.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/01/2019] [Accepted: 10/30/2019] [Indexed: 11/30/2022] Open
Abstract
The spatial structure of an evolving population affects the balance of natural selection versus genetic drift. Some structures amplify selection, increasing the role that fitness differences play in determining which mutations become fixed. Other structures suppress selection, reducing the effect of fitness differences and increasing the role of random chance. This phenomenon can be modeled by representing spatial structure as a graph, with individuals occupying vertices. Births and deaths occur stochastically, according to a specified update rule. We study death-Birth updating: An individual is chosen to die and then its neighbors compete to reproduce into the vacant spot. Previous numerical experiments suggested that amplifiers of selection for this process are either rare or nonexistent. We introduce a perturbative method for this problem for weak selection regime, meaning that mutations have small fitness effects. We show that fixation probability under weak selection can be calculated in terms of the coalescence times of random walks. This result leads naturally to a new definition of effective population size. Using this and other methods, we uncover the first known examples of transient amplifiers of selection (graphs that amplify selection for a particular range of fitness values) for the death-Birth process. We also exhibit new families of “reducers of fixation”, which decrease the fixation probability of all mutations, whether beneficial or deleterious. Natural selection is often thought of as “survival of the fittest”, but random chance plays a significant role in which mutations persist and which are eliminated. The balance of selection versus randomness is affected by spatial structure—how individuals are arranged within their habitat. Some structures amplify the effects of selection, so that only the fittest mutations are likely to persist. Others suppress the effects of selection, making the survival of genes primarily a matter of random chance. We study this question using a mathematical model called the “death-Birth process”. Previous studies have found that spatial structure rarely, if ever, amplifies selection for this process. Here we report that spatial structure can indeed amplify selection, at least for mutations with small fitness effects. We also identify structures that reduce the spread of any new mutation, whether beneficial or deleterious. Our work introduces new mathematical techniques for assessing how population structure affects natural selection.
Collapse
Affiliation(s)
- Benjamin Allen
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
- * E-mail:
| | - Christine Sample
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Robert Jencks
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - James Withers
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Patricia Steinhagen
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Lori Brizuela
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Joshua Kolodny
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Darren Parke
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| | - Gabor Lippner
- Department of Mathematics, Northeastern University, Boston, Massachusetts, United States of America
| | - Yulia A. Dementieva
- Department of Mathematics, Emmanuel College, Boston, Massachusetts, United States of America
| |
Collapse
|
15
|
Erovenko IV, Bauer J, Broom M, Pattni K, Rychtář J. The effect of network topology on optimal exploration strategies and the evolution of cooperation in a mobile population. Proc Math Phys Eng Sci 2019; 475:20190399. [PMID: 31736650 DOI: 10.1098/rspa.2019.0399] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/27/2019] [Accepted: 09/05/2019] [Indexed: 12/11/2022] Open
Abstract
We model a mobile population interacting over an underlying spatial structure using a Markov movement model. Interactions take the form of public goods games, and can feature an arbitrary group size. Individuals choose strategically to remain at their current location or to move to a neighbouring location, depending upon their exploration strategy and the current composition of their group. This builds upon previous work where the underlying structure was a complete graph (i.e. there was effectively no structure). Here, we consider alternative network structures and a wider variety of, mainly larger, populations. Previously, we had found when cooperation could evolve, depending upon the values of a range of population parameters. In our current work, we see that the complete graph considered before promotes stability, with populations of cooperators or defectors being relatively hard to replace. By contrast, the star graph promotes instability, and often neither type of population can resist replacement. We discuss potential reasons for this in terms of network topology.
Collapse
Affiliation(s)
- Igor V Erovenko
- Department of Mathematics and Statistics, University of North Carolina at Greensboro, Greensboro, NC 27402, USA
| | - Johann Bauer
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK
| | - Mark Broom
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK
| | - Karan Pattni
- Department of Mathematical Sciences, University of Liverpool, Liverpool L69 3BX, UK
| | - Jan Rychtář
- Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, Richmond, VA 23284-2014, USA
| |
Collapse
|
16
|
Abstract
Population structure affects the outcome of natural selection. These effects can be modeled using evolutionary games on graphs. Recently, conditions were derived for a trait to be favored under weak selection, on any weighted graph, in terms of coalescence times of random walks. Here we consider isothermal graphs, which have the same total edge weight at each node. The conditions for success on isothermal graphs take a simple form, in which the effects of graph structure are captured in the ‘effective degree’—a measure of the effective number of neighbors per individual. For two update rules (death-Birth and birth-Death), cooperative behavior is favored on a large isothermal graph if the benefit-to-cost ratio exceeds the effective degree. For two other update rules (Birth-death and Death-birth), cooperation is never favored. We relate the effective degree of a graph to its spectral gap, thereby linking evolutionary dynamics to the theory of expander graphs. Surprisingly, we find graphs of infinite average degree that nonetheless provide strong support for cooperation. The spatial structure of a population is often critical for the evolution of cooperation. Here, Allen and colleagues show that when spatial structure is represented by an isothermal graph, the effective number of neighbors per individual determines whether or not cooperation can evolve.
Collapse
|
17
|
Motion, fixation probability and the choice of an evolutionary process. PLoS Comput Biol 2019; 15:e1007238. [PMID: 31381556 PMCID: PMC6746388 DOI: 10.1371/journal.pcbi.1007238] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/15/2019] [Revised: 09/16/2019] [Accepted: 07/02/2019] [Indexed: 11/21/2022] Open
Abstract
Seemingly minor details of mathematical and computational models of evolution are known to change the effect of population structure on the outcome of evolutionary processes. For example, birth-death dynamics often result in amplification of selection, while death-birth processes have been associated with suppression. In many biological populations the interaction structure is not static. Instead, members of the population are in motion and can interact with different individuals at different times. In this work we study populations embedded in a flowing medium; the interaction network is then time dependent. We use computer simulations to investigate how this dynamic structure affects the success of invading mutants, and compare these effects for different coupled birth and death processes. Specifically, we show how the speed of the motion impacts the fixation probability of an invading mutant. Flows of different speeds interpolate between evolutionary dynamics on fixed heterogeneous graphs and well-stirred populations; this allows us to systematically compare against known results for static structured populations. We find that motion has an active role in amplifying or suppressing selection by fragmenting and reconnecting the interaction graph. While increasing flow speeds suppress selection for most evolutionary models, we identify characteristic responses to flow for the different update rules we test. In particular we find that selection can be maximally enhanced or suppressed at intermediate flow speeds. Whether a mutation spreads in a population or not is one of the most important questions in biology. The evolution of cancer and antibiotic resistance, for example, are mediated by invading mutants. Recent work has shown that population structure can have important consequences for the outcome of evolution. For instance, a mutant can have a higher or a lower chance of invasion than in unstructured populations. These effects can depend on seemingly minor details of the evolutionary model, such as the order of birth and death events. Many biological populations are in motion, for example due to external stirring. Experimentally this is known to be important; the performance of mutants in E. coli populations, for example, depends on the rate of mixing. Here, we focus on simulations of populations in a flowing medium, and compare the success of a mutant for different flow speeds. We contrast different evolutionary models, and identify what features of the evolutionary model affect mutant success for different speeds of the flow. We find that the chance of mutant invasion can be at its highest (or lowest) at intermediate flow speeds, depending on the order in which birth and death events occur in the evolutionary process.
Collapse
|
18
|
Möller M, Hindersin L, Traulsen A. Exploring and mapping the universe of evolutionary graphs identifies structural properties affecting fixation probability and time. Commun Biol 2019; 2:137. [PMID: 31044162 PMCID: PMC6478964 DOI: 10.1038/s42003-019-0374-x] [Citation(s) in RCA: 17] [Impact Index Per Article: 3.4] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/30/2018] [Accepted: 03/07/2019] [Indexed: 11/25/2022] Open
Abstract
Population structure can be modeled by evolutionary graphs, which can have a substantial influence on the fate of mutants. Individuals are located on the nodes of these graphs, competing to take over the graph via the links. Applications for this framework range from the ecology of river systems and cancer initiation in colonic crypts to biotechnological search for optimal mutations. In all these applications, both the probability of fixation and the associated time are of interest. We study this problem for all undirected and unweighted graphs up to a certain size. We devise a genetic algorithm to find graphs with high or low fixation probability and short or long fixation time and study their structure searching for common themes. Our work unravels structural properties that maximize or minimize fixation probability and time, which allows us to contribute to a first map of the universe of evolutionary graphs.
Collapse
Affiliation(s)
- Marius Möller
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, D-24306 Plön, Germany
- Complex Systems and Networks Research Group, School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London, E1 4NS UK
| | - Laura Hindersin
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, D-24306 Plön, Germany
| | - Arne Traulsen
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, D-24306 Plön, Germany
| |
Collapse
|
19
|
Richter H. Properties of network structures, structure coefficients, and benefit-to-cost ratios. Biosystems 2019; 180:88-100. [PMID: 30914346 DOI: 10.1016/j.biosystems.2019.03.005] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/17/2018] [Revised: 02/24/2019] [Accepted: 03/21/2019] [Indexed: 12/31/2022]
Abstract
In structured populations the spatial arrangement of cooperators and defectors on the interaction graph together with the structure of the graph itself determines the game dynamics and particularly whether or not fixation of cooperation (or defection) is favored. For networks described by regular graphs and for a single cooperator (and a single defector) the question of fixation can be addressed by a single parameter, the structure coefficient. This quantity is invariant with respect to the location of the cooperator on the graph and also does not vary over different networks. We may therefore consider it to be generic for regular graphs and call it the generic structure coefficient. For two and more cooperators (or several defectors) fixation properties can also be assigned by structure coefficients. These structure coefficients, however, depend on the arrangement of cooperators and defectors which we may interpret as a configuration of the game. Moreover, the coefficients are specific for a given interaction network modeled as a regular graph, which is why we may call them specific structure coefficients. In this paper, we study how specific structure coefficients vary over interaction graphs and analyze how spectral properties of interaction networks relate to specific structure coefficients. We also discuss implications for the benefit-to-cost ratios of donation games.
Collapse
Affiliation(s)
- Hendrik Richter
- HTWK Leipzig University of Applied Sciences, Faculty of Electrical Engineering and Information Technology, Postfach 301166, D-04251 Leipzig, Germany.
| |
Collapse
|
20
|
Richter H. Fixation properties of multiple cooperator configurations on regular graphs. Theory Biosci 2019; 138:261-275. [PMID: 30900107 DOI: 10.1007/s12064-019-00293-3] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/20/2018] [Accepted: 03/11/2019] [Indexed: 10/27/2022]
Abstract
Whether or not cooperation is favored in evolutionary games on graphs depends on the population structure and spatial properties of the interaction network. The population structure can be expressed as configurations. Such configurations extend scenarios with a single cooperator among defectors to any number of cooperators and any arrangement of cooperators and defectors on the network. For interaction networks modeled as regular graphs and for weak selection, the emergence of cooperation can be assessed by structure coefficients, which can be specified for each configuration and each regular graph. Thus, as a single cooperator can be interpreted as a lone mutant, the configuration-based structure coefficients also describe fixation properties of multiple mutants. We analyze the structure coefficients and particularly show that under certain conditions, the coefficients strongly correlate to the average shortest path length between cooperators on the evolutionary graph. Thus, for multiple cooperators fixation properties on regular evolutionary graphs can be linked to cooperator path lengths.
Collapse
Affiliation(s)
- Hendrik Richter
- Faculty of Electrical Engineering and Information Technology, HTWK Leipzig University of Applied Sciences, Postfach 301166, 04251, Leipzig, Germany.
| |
Collapse
|
21
|
Schimit PHT, Pattni K, Broom M. Dynamics of multiplayer games on complex networks using territorial interactions. Phys Rev E 2019; 99:032306. [PMID: 30999523 DOI: 10.1103/physreve.99.032306] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/03/2018] [Indexed: 06/09/2023]
Abstract
The modeling of evolution in structured populations has been significantly advanced by evolutionary graph theory, which incorporates pairwise relationships between individuals on a network. More recently, a new framework has been developed to allow for multiplayer interactions of variable size in more flexible and potentially changing population structures. While the theory within this framework has been developed and simple structures considered, there has been no systematic consideration of a large range of different population structures, which is the subject of this paper. We consider a large range of underlying graphical structures for the territorial raider model, the most commonly used model in the new structure, and consider a variety of important properties of our structures with the aim of finding factors that determine the fixation probability of mutants. We find that the graphical temperature and the average group size, as previously defined, are strong predictors of fixation probability, while all other properties considered are poor predictors, although the clustering coefficient is a useful secondary predictor when combined with either temperature or group size. The relationship between temperature or average group size and fixation probability is sometimes, however, nonmonotonic, with a directional reverse occurring around the temperature associated with what we term "completely mixed" populations in the case of the hawk-dove game, but not the public goods game.
Collapse
Affiliation(s)
- Pedro H T Schimit
- Informatics and Knowledge Management Graduate Program, Universidade Nove de Julho, Rua Vergueiro, 235/249, CEP 01504-000, São Paulo, São Paulo, Brazil
| | - Karan Pattni
- Department of Mathematical Sciences, University of Liverpool, Mathematical Sciences Building, Liverpool L69 7ZL, United Kingdom
| | - Mark Broom
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, United Kingdom
| |
Collapse
|
22
|
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Commun Biol 2018; 1:71. [PMID: 30271952 PMCID: PMC6123726 DOI: 10.1038/s42003-018-0078-7] [Citation(s) in RCA: 29] [Impact Index Per Article: 4.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/28/2018] [Accepted: 05/25/2018] [Indexed: 11/08/2022] Open
Abstract
Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures.
Collapse
Affiliation(s)
| | | | | | - Martin A Nowak
- Program for Evolutionary Dynamics, Department of Organismic and Evolutionary Biology, Department of Mathematics, Harvard University, Cambridge, MA, 02138, USA.
| |
Collapse
|
23
|
Herrerías-Azcué F, Pérez-Muñuzuri V, Galla T. Stirring does not make populations well mixed. Sci Rep 2018; 8:4068. [PMID: 29511246 PMCID: PMC5840425 DOI: 10.1038/s41598-018-22062-w] [Citation(s) in RCA: 16] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/17/2017] [Accepted: 02/09/2018] [Indexed: 12/02/2022] Open
Abstract
In evolutionary dynamics, the notion of a ‘well-mixed’ population is usually associated with all-to-all interactions at all times. This assumption simplifies the mathematics of evolutionary processes, and makes analytical solutions possible. At the same time the term ‘well-mixed’ suggests that this situation can be achieved by physically stirring the population. Using simulations of populations in chaotic flows, we show that in most cases this is not true: conventional well-mixed theories do not predict fixation probabilities correctly, regardless of how fast or thorough the stirring is. We propose a new analytical description in the fast-flow limit. This approach is valid for processes with global and local selection, and accurately predicts the suppression of selection as competition becomes more local. It provides a modelling tool for biological or social systems with individuals in motion.
Collapse
Affiliation(s)
- Francisco Herrerías-Azcué
- Theoretical Physics, School of Physics and Astronomy, The University of Manchester, M13 9PL, Manchester, United Kingdom.
| | - Vicente Pérez-Muñuzuri
- Group of Nonlinear Physics, Faculty of Physics, University of Santiago de Compostela, E-15782, Santiago de Compostela, Spain.
| | - Tobias Galla
- Theoretical Physics, School of Physics and Astronomy, The University of Manchester, M13 9PL, Manchester, United Kingdom.
| |
Collapse
|
24
|
Hu H. Competing opinion diffusion on social networks. ROYAL SOCIETY OPEN SCIENCE 2017; 4:171160. [PMID: 29291101 PMCID: PMC5717675 DOI: 10.1098/rsos.171160] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/16/2017] [Accepted: 10/02/2017] [Indexed: 05/14/2023]
Abstract
Opinion competition is a common phenomenon in real life, such as with opinions on controversial issues or political candidates; however, modelling this competition remains largely unexplored. To bridge this gap, we propose a model of competing opinion diffusion on social networks taking into account degree-dependent fitness or persuasiveness. We study the combined influence of social networks, individual fitnesses and attributes, as well as mass media on people's opinions, and find that both social networks and mass media act as amplifiers in opinion diffusion, the amplifying effect of which can be quantitatively characterized. We analytically obtain the probability that each opinion will ultimately pervade the whole society when there are no committed people in networks, and the final proportion of each opinion at the steady state when there are committed people in networks. The results of numerical simulations show good agreement with those obtained through an analytical approach. This study provides insight into the collective influence of individual attributes, local social networks and global media on opinion diffusion, and contributes to a comprehensive understanding of competing diffusion behaviours in the real world.
Collapse
Affiliation(s)
- Haibo Hu
- Department of Management Science and Engineering, East China University of Science and Technology, Shanghai, People’s Republic of China
| |
Collapse
|
25
|
Pattni K, Broom M, Rychtář J. Evolutionary dynamics and the evolution of multiplayer cooperation in a subdivided population. J Theor Biol 2017; 429:105-115. [PMID: 28666764 DOI: 10.1016/j.jtbi.2017.06.034] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/06/2016] [Revised: 06/22/2017] [Accepted: 06/26/2017] [Indexed: 11/27/2022]
Abstract
The classical models of evolution have been developed to incorporate structured populations using evolutionary graph theory and, more recently, a new framework has been developed to allow for more flexible population structures which potentially change through time and can accommodate multiplayer games with variable group sizes. In this paper we extend this work in three key ways. Firstly by developing a complete set of evolutionary dynamics so that the range of dynamic processes used in classical evolutionary graph theory can be applied. Secondly, by building upon previous models to allow for a general subpopulation structure, where all subpopulation members have a common movement distribution. Subpopulations can have varying levels of stability, represented by the proportion of interactions occurring between subpopulation members; in our representation of the population all subpopulation members are represented by a single vertex. In conjunction with this we extend the important concept of temperature (the temperature of a vertex is the sum of all the weights coming into that vertex; generally, the higher the temperature, the higher the rate of turnover of individuals at a vertex). Finally, we have used these new developments to consider the evolution of cooperation in a class of populations which possess this subpopulation structure using a multiplayer public goods game. We show that cooperation can evolve providing that subpopulations are sufficiently stable, with the smaller the subpopulations the easier it is for cooperation to evolve. We introduce a new concept of temperature, namely "subgroup temperature", which can be used to explain our results.
Collapse
Affiliation(s)
- Karan Pattni
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK.
| | - Mark Broom
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK.
| | - Jan Rychtář
- Department of Mathematics and Statistics, The University of North Carolina at Greensboro, Greensboro NC 27412, USA.
| |
Collapse
|
26
|
Amplification on Undirected Population Structures: Comets Beat Stars. Sci Rep 2017; 7:82. [PMID: 28250441 PMCID: PMC5427850 DOI: 10.1038/s41598-017-00107-w] [Citation(s) in RCA: 25] [Impact Index Per Article: 3.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/17/2017] [Accepted: 02/06/2017] [Indexed: 11/08/2022] Open
Abstract
The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.
Collapse
|
27
|
Richter H. Dynamic landscape models of coevolutionary games. Biosystems 2017; 153-154:26-44. [PMID: 28238940 DOI: 10.1016/j.biosystems.2017.02.002] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/06/2016] [Revised: 01/30/2017] [Accepted: 02/17/2017] [Indexed: 10/20/2022]
Abstract
Players of coevolutionary games may update not only their strategies but also their networks of interaction. Based on interpreting the payoff of players as fitness, dynamic landscape models are proposed. The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death-birth (DB) strategy updating. The main focus is on using dynamic fitness landscapes as a mathematical model of coevolutionary game dynamics. Hence, an alternative tool for analyzing coevolutionary games becomes available, and landscape measures such as modality, ruggedness and information content can be computed and analyzed. In addition, fixation properties of the games and quantifiers characterizing the interaction networks are calculated numerically. Relations are established between landscape properties expressed by landscape measures and quantifiers of coevolutionary game dynamics such as fixation probabilities, fixation times and network properties.
Collapse
Affiliation(s)
- Hendrik Richter
- HTWK Leipzig University of Applied Sciences, Faculty of Electrical Engineering and Information Technology, Postfach 301166, D-04251 Leipzig, Germany.
| |
Collapse
|