1
|
Brewster DA, Nowak MA, Tkadlec J. Fixation times on directed graphs. PLoS Comput Biol 2024; 20:e1012299. [PMID: 39024375 PMCID: PMC11288448 DOI: 10.1371/journal.pcbi.1012299] [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: 04/12/2024] [Revised: 07/30/2024] [Accepted: 07/04/2024] [Indexed: 07/20/2024] Open
Abstract
Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate r which invades a population of residents. We say that the fixation time is "fast" if it is at most a polynomial function in terms of the population size N. Here we study fixation times of advantageous mutants (r > 1) and neutral mutants (r = 1) on directed graphs, which are those graphs that have at least some one-way connections. We obtain three main results. First, we prove that for any directed graph the fixation time is fast, provided that r is sufficiently large. Second, we construct an efficient algorithm that gives an upper bound for the fixation time for any graph and any r ≥ 1. Third, we identify a broad class of directed graphs with fast fixation times for any r ≥ 1. This class includes previously studied amplifiers of selection, such as Superstars and Metafunnels. We also show that on some graphs the fixation time is not a monotonically declining function of r; in particular, neutral fixation can occur faster than fixation for small selective advantages.
Collapse
Affiliation(s)
- David A. Brewster
- John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts, United States of America
| | - Martin A. Nowak
- Department of Mathematics, Harvard University, Cambridge, Massachusetts, United States of America
- Department of Organismic and Evolutionary Biology, Harvard University, Cambridge, Massachusetts, United States of America
| | - Josef Tkadlec
- Department of Mathematics, Harvard University, Cambridge, Massachusetts, United States of America
- Computer Science Institute, Charles University, Prague, Czech Republic
| |
Collapse
|
2
|
Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. Evolutionary dynamics of mutants that modify population structure. J R Soc Interface 2023; 20:20230355. [PMID: 38016637 PMCID: PMC10684346 DOI: 10.1098/rsif.2023.0355] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/23/2023] [Accepted: 11/01/2023] [Indexed: 11/30/2023] Open
Abstract
Natural selection is usually studied between mutants that differ in reproductive rate, but are subject to the same population structure. Here we explore how natural selection acts on mutants that have the same reproductive rate, but different population structures. In our framework, population structure is given by a graph that specifies where offspring can disperse. The invading mutant disperses offspring on a different graph than the resident wild-type. We find that more densely connected dispersal graphs tend to increase the invader's fixation probability, but the exact relationship between structure and fixation probability is subtle. We present three main results. First, we prove that if both invader and resident are on complete dispersal graphs, then removing a single edge in the invader's dispersal graph reduces its fixation probability. Second, we show that for certain island models higher invader's connectivity increases its fixation probability, but the magnitude of the effect depends on the exact layout of the connections. Third, we show that for lattices the effect of different connectivity is comparable to that of different fitness: for large population size, the invader's fixation probability is either constant or exponentially small, depending on whether it is more or less connected than the resident.
Collapse
Affiliation(s)
- Josef Tkadlec
- Department of Mathematics, Harvard University, Cambridge, MA 02138, USA
- Computer Science Institute, Charles University, Prague, Czech Republic
| | - Kamran Kaveh
- Department of Applied Mathematics, University of Washington, Seattle, WA 98195, USA
| | - Krishnendu Chatterjee
- Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria
| | - Martin A. Nowak
- Department of Mathematics, Harvard University, Cambridge, MA 02138, USA
- Department of Organismic and Evolutionary Biology, Harvard University, Cambridge, MA 02138, USA
| |
Collapse
|
3
|
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
|
4
|
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
|
5
|
Sharma N, Traulsen A. Suppressors of fixation can increase average fitness beyond amplifiers of selection. Proc Natl Acad Sci U S A 2022; 119:e2205424119. [PMID: 36067304 PMCID: PMC9478682 DOI: 10.1073/pnas.2205424119] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/28/2022] [Accepted: 08/03/2022] [Indexed: 11/18/2022] Open
Abstract
Evolutionary dynamics on graphs has remarkable features: For example, it has been shown that amplifiers of selection exist that-compared to an unstructured population-increase the fixation probability of advantageous mutations, while they decrease the fixation probability of disadvantageous mutations. So far, the theoretical literature has focused on the case of a single mutant entering a graph-structured population, asking how the graph affects the probability that a mutant takes over a population and the time until this typically happens. For continuously evolving systems, the more relevant case is that mutants constantly arise in an evolving population. Typically, such mutations occur with a small probability during reproduction events. We thus focus on the low mutation rate limit. The probability distribution for the fitness in this process converges to a steady state at long times. Intuitively, amplifiers of selection are expected to increase the population's mean fitness in the steady state. Similarly, suppressors of selection are expected to decrease the population's mean fitness in the steady state. However, we show that another set of graphs, called suppressors of fixation, can attain the highest population mean fitness. The key reason behind this is their ability to efficiently reject deleterious mutants. This illustrates the importance of the deleterious mutant regime for the long-term evolutionary dynamics, something that seems to have been overlooked in the literature so far.
Collapse
Affiliation(s)
- Nikhil Sharma
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, 24306 Plön, Germany
| | - Arne Traulsen
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, 24306 Plön, Germany
| |
Collapse
|
6
|
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
|
7
|
Monk T, van Schaik A. Martingales and the characteristic functions of absorption time on bipartite graphs. ROYAL SOCIETY OPEN SCIENCE 2021; 8:210657. [PMID: 34703620 PMCID: PMC8527206 DOI: 10.1098/rsos.210657] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/15/2021] [Accepted: 09/15/2021] [Indexed: 05/14/2023]
Abstract
Evolutionary graph theory investigates how spatial constraints affect processes that model evolutionary selection, e.g. the Moran process. Its principal goals are to find the fixation probability and the conditional distributions of fixation time, and show how they are affected by different graphs that impose spatial constraints. Fixation probabilities have generated significant attention, but much less is known about the conditional time distributions, even for simple graphs. Those conditional time distributions are difficult to calculate, so we consider a close proxy to it: the number of times the mutant population size changes before absorption. We employ martingales to obtain the conditional characteristic functions (CCFs) of that proxy for the Moran process on the complete bipartite graph. We consider the Moran process on the complete bipartite graph as an absorbing random walk in two dimensions. We then extend Wald's martingale approach to sequential analysis from one dimension to two. Our expressions for the CCFs are novel, compact, exact, and their parameter dependence is explicit. We show that our CCFs closely approximate those of absorption time. Martingales provide an elegant framework to solve principal problems of evolutionary graph theory. It should be possible to extend our analysis to more complex graphs than we show here.
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
|
8
|
Yagoobi S, Traulsen A. Fixation probabilities in network structured meta-populations. Sci Rep 2021; 11:17979. [PMID: 34504152 PMCID: PMC8429422 DOI: 10.1038/s41598-021-97187-6] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/16/2021] [Accepted: 08/23/2021] [Indexed: 02/07/2023] Open
Abstract
The effect of population structure on evolutionary dynamics is a long-lasting research topic in evolutionary ecology and population genetics. Evolutionary graph theory is a popular approach to this problem, where individuals are located on the nodes of a network and can replace each other via the links. We study the effect of complex network structure on the fixation probability, but instead of networks of individuals, we model a network of sub-populations with a probability of migration between them. We ask how the structure of such a meta-population and the rate of migration affect the fixation probability. Many of the known results for networks of individuals carry over to meta-populations, in particular for regular networks or low symmetric migration probabilities. However, when patch sizes differ we find interesting deviations between structured meta-populations and networks of individuals. For example, a two patch structure with unequal population size suppresses selection for low migration probabilities.
Collapse
Affiliation(s)
- Sedigheh Yagoobi
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, 24306, Plön, Germany.
| | - Arne Traulsen
- Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, 24306, Plön, Germany
| |
Collapse
|
9
|
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
|
10
|
Whigham PA, Spencer HG. Graph-structured populations and the Hill-Robertson effect. ROYAL SOCIETY OPEN SCIENCE 2021; 8:201831. [PMID: 33959343 PMCID: PMC8074956 DOI: 10.1098/rsos.201831] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 10/12/2020] [Accepted: 02/23/2021] [Indexed: 05/27/2023]
Abstract
The Hill-Robertson effect describes how, in a finite panmictic diploid population, selection at one diallelic locus reduces the fixation probability of a selectively favoured allele at a second, linked diallelic locus. Here we investigate the influence of population structure on the Hill-Robertson effect in a population of size N. We model population structure as a network by assuming that individuals occupy nodes on a graph connected by edges that link members who can reproduce with each other. Three regular networks (fully connected, ring and torus), two forms of scale-free network and a star are examined. We find that (i) the effect of population structure on the probability of fixation of the favourable allele is invariant for regular structures, but on some scale-free networks and a star, this probability is greatly reduced; (ii) compared to a panmictic population, the mean time to fixation of the favoured allele is much greater on a ring, torus and linear scale-free network, but much less on power-2 scale-free and star networks; (iii) the likelihood with which each of the four possible haplotypes eventually fix is similar across regular networks, but scale-free populations and the star are consistently less likely and much faster to fix the optimal haplotype; (iv) increasing recombination increases the likelihood of fixing the favoured haplotype across all structures, whereas the time to fixation of that haplotype usually increased, and (v) star-like structures were overwhelmingly likely to fix the least fit haplotype and did so significantly more rapidly than other populations. Last, we find that small (N < 64) panmictic populations do not exhibit the scaling property expected from Hill & Robertson (1966 Genet. Res. 8, 269-294. (doi:10.1017/S0016672300010156)).
Collapse
Affiliation(s)
- Peter A. Whigham
- Department of Information Science, University of Otago, PO Box 56, Dunedin 9054, New Zealand
| | - Hamish G. Spencer
- Department of Zoology, University of Otago, PO Box 56, Dunedin 9054, New Zealand
| |
Collapse
|
11
|
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
|
12
|
Monk T, van Schaik A. Wald’s martingale and the conditional distributions of absorption time in the Moran process. Proc Math Phys Eng Sci 2020. [DOI: 10.1098/rspa.2020.0135] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Many models of evolution are stochastic processes, where some quantity of interest fluctuates randomly in time. One classic example is the Moranbirth–death process, where that quantity is the number of mutants in a population. In such processes, we are often interested in their absorption (i.e. fixation) probabilities and the conditional distributions of absorption time. Those conditional time distributions can be very difficult to calculate, even for relatively simple processes like the Moran birth–death model. Instead of considering the time to absorption, we consider a closely related quantity: the number of mutant population size changes before absorption. We use Wald’s martingale to obtain the conditional characteristic functions of that quantity in the Moran process. Our expressions are novel, analytical and exact, and their parameter dependence is explicit. We use our results to approximate the conditional characteristic functions of absorption time. We state the conditions under which that approximation is particularly accurate. Martingales are an elegant framework to solve principal problems of evolutionary stochastic processes. They do not require us to evaluate recursion relations, so when they are applicable, we can quickly and tractably obtain absorption probabilities and times of evolutionary models.
Collapse
Affiliation(s)
- Travis Monk
- International Centre for Neuromorphic Engineering, MARCS Institute, Western Sydney University, Werrington, NSW 2747, Australia
| | - André van Schaik
- International Centre for Neuromorphic Engineering, MARCS Institute, Western Sydney University, Werrington, NSW 2747, Australia
| |
Collapse
|
13
|
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. PLoS Comput Biol 2020; 16:e1007494. [PMID: 31951609 PMCID: PMC6968837 DOI: 10.1371/journal.pcbi.1007494] [Citation(s) in RCA: 24] [Impact Index Per Article: 6.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/03/2019] [Accepted: 10/18/2019] [Indexed: 12/29/2022] Open
Abstract
The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process. Extensive literature exists on amplifiers of natural selection for the Birth-death Moran process, but no amplifiers are known for the death-Birth Moran process. Here we show that if amplifiers exist under death-Birth updating, they must be bounded and transient. Boundedness implies weak amplification, and transience implies amplification for only a limited range of the mutant fitness advantage. These results demonstrate that amplification depends on the specific mechanisms of the evolutionary process.
Collapse
Affiliation(s)
| | | | | | - Martin A. Nowak
- Program for Evolutionary Dynamics, Department of Organismic and Evolutionary Biology, Department of Mathematics, Harvard University, Cambridge, Massachusetts, United States of America
- * E-mail:
| |
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
|
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
|