Counterintuitive properties of the fixation time in network-structured populations

Evolutionary graph theory beyond single mutation dynamics: on how network-structured populations cross fitness landscapes

Spatially resolved datasets are revolutionizing knowledge in molecular biology, yet are under-utilized for questions in evolutionary biology. To gain insight from these large-scale datasets of spatial organization, we need mathematical representations and modeling techniques that can both capture their complexity, but also allow for mathematical tractability. Evolutionary graph theory utilizes the mathematical representation of networks as a proxy for heterogeneous population structure and has started to reshape our understanding of how spatial structure can direct evolutionary dynamics. However, previous results are derived for the case of a single new mutation appearing in the population and the role of network structure in shaping fitness landscape crossing is still poorly understood. Here we study how network-structured populations cross fitness landscapes and show that even a simple extension to a two-mutational landscape can exhibit complex evolutionary dynamics that cannot be predicted using previous single-mutation results. We show how our results can be intuitively understood through the lens of how the two main evolutionary properties of a network, the amplification and acceleration factors, change the expected fate of the intermediate mutant in the population and further discuss how to link these models to spatially resolved datasets of cellular organization.

The speed of neutral evolution on graphs

The speed of evolution on structured populations is crucial for biological and social systems. The likelihood of invasion is key for evolutionary stability. But it makes little sense if it takes long. It is far from known what population structure slows down evolution. We investigate the absorption time of a single neutral mutant for all the 112 non-isomorphic undirected graphs of size 6. We find that about three-quarters of the graphs have an absorption time close to that of the complete graph, less than one-third are accelerators, and more than two-thirds are decelerators. Surprisingly, determining whether a graph has a long absorption time is too complicated to be captured by the joint degree distribution. Via the largest sojourn time, we find that echo-chamber-like graphs, which consist of two homogeneous graphs connected by few sparse links, are likely to slow down absorption. These results are robust for large graphs, mutation patterns as well as evolutionary processes. This work serves as a benchmark for timing evolution with complex interactions, and fosters the understanding of polarization in opinion formation.

Effect of the degree of an initial mutant in Moran processes in structured populations

We study effects of the mutant's degree on the fixation probability, extinction, and fixation times in Moran processes on Erdös-Rényi and Barabási-Albert graphs. We performed stochastic simulations and used mean-field-type approximations to obtain analytical formulas. We showed that the initial placement of a mutant has a significant impact on the fixation probability and extinction time, while it has no effect on the fixation time. In both types of graphs, an increase in the degree of an initial mutant results in a decreased fixation probability and a shorter time to extinction. Our results extend previous ones to arbitrary fitness values.

Mutant fixation in the presence of a natural enemy

The literature about mutant invasion and fixation typically assumes populations to exist in isolation from their ecosystem. Yet, populations are part of ecological communities, and enemy-victim (e.g. predator-prey or pathogen-host) interactions are particularly common. We use spatially explicit, computational pathogen-host models (with wild-type and mutant hosts) to re-visit the established theory about mutant fixation, where the pathogen equally attacks both wild-type and mutant individuals. Mutant fitness is assumed to be unrelated to infection. We find that pathogen presence substantially weakens selection, increasing the fixation probability of disadvantageous mutants and decreasing it for advantageous mutants. The magnitude of the effect rises with the infection rate. This occurs because infection induces spatial structures, where mutant and wild-type individuals are mostly spatially separated. Thus, instead of mutant and wild-type individuals competing with each other, it is mutant and wild-type "patches" that compete, resulting in smaller fitness differences and weakened selection. This implies that the deleterious mutant burden in natural populations might be higher than expected from traditional theory.

Eco-evolutionary dynamics in finite network-structured populations with migration

We consider the effect of network structure on the evolution of a population. Models of this kind typically consider a population of fixed size and distribution. Here we consider eco-evolutionary dynamics where population size and distribution can change through birth, death and migration, all of which are separate processes. This allows complex interaction and migration behaviours that are dependent on competition. For migration, we assume that the response of individuals to competition is governed by tolerance to their group members, such that less tolerant individuals are more likely to move away due to competition. We look at the success of a mutant in the rare mutation limit for the complete, cycle and star networks. Unlike models with fixed population size and distribution, the distribution of the individuals per site is explicitly modelled by considering the dynamics of the population. This in turn determines the mutant appearance distribution for each network. Where a mutant appears impacts its success as it determines the competition it faces. For low and high migration rates the complete and cycle networks have similar mutant appearance distributions resulting in similar success levels for an invading mutant. A higher migration rate in the star network is detrimental for mutant success because migration results in a crowded central site where a mutant is more likely to appear.

Heterogeneous contributions can jeopardize cooperation in the public goods game

When studying social dilemma games, a crucial question arises regarding the impact of general heterogeneity on cooperation, which has been shown to have positive effects in numerous studies. Here, we demonstrate that heterogeneity in the contribution value for the focal public goods game can jeopardize cooperation. We show that there is an optimal contribution value in the homogeneous case that most benefits cooperation depending on the lattice. In a heterogeneous scenario, where strategy and contribution coevolve, cooperators making contributions higher than the optimal value end up harming those who contribute less. This effect is notably detrimental to cooperation in the square lattice with von Neumann neighborhood, while it can have no impact in other lattices. Furthermore, in parameter regions where a higher-contributing cooperator cannot normally survive alone, the exploitation of lower-value contribution cooperators allows their survival, resembling a parasitic behavior. To obtain these results, we examined the effect of various distributions for the contribution values in the initial condition and we conducted Monte Carlo simulations.

Counterintuitive properties of evolutionary measures: A stochastic process study in cyclic population structures with periodic environments

Local environmental interactions are a major factor in determining the success of a new mutant in structured populations. Spatial variations in the concentration of genotype-specific resources change the fitness of competing strategies locally and thus can drastically change the outcome of evolutionary processes in unintuitive ways. The question is how such local environmental variations in network population structures change the condition for selection and fixation probability of an advantageous (or deleterious) mutant. We consider linear graph structures and focus on the case where resources have a spatial periodic pattern. This is the simplest model with two parameters, length scale and fitness scales, representing heterogeneity. We calculate fixation probability and fixation times for a constant population birth-death process as fitness heterogeneity and period vary. Fixation probability is affected by not only the level of fitness heterogeneity but also spatial scale of resources variations set by period of distribution T. We identify conditions for which a previously a deleterious mutant (in a uniform environment) becomes beneficial as fitness heterogeneity is increased. We observe cases where the fixation probability of both mutant and resident types are more than their neutral value, 1/N, simultaneously. This coincides with exponential increase in time to fixation which points to potential coexistence of resident and mutant types. Finally, we discuss the effect of the 'fitness shift' where the fitness function of two types has a phase difference. We observe significant increases (or decreases) in the fixation probability of the mutant as a result of such phase shift.

Categorizing update mechanisms for graph-structured metapopulations

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.

The role of spatial structures of tissues in cancer initiation dynamics

It is widely believed that biological tissues evolved to lower the risks of cancer development. One of the specific ways to minimize the chances of tumor formation comes from proper spatial organization of tissues. However, the microscopic mechanisms of underlying processes remain not fully understood. We present a theoretical investigation on the role of spatial structures in cancer initiation dynamics. In our approach, the dynamics of single mutation fixations are analyzed using analytical calculations and computer simulations by mapping them to Moran processes on graphs with different connectivity that mimic various spatial structures. It is found that while the fixation probability is not affected by modifying the spatial structures of the tissues, the fixation times can change dramatically. The slowest dynamics is observed in "quasi-one-dimensional" structures, while the fastest dynamics is observed in "quasi-three-dimensional" structures. Theoretical calculations also suggest that there is a critical value of the degree of graph connectivity, which mimics the spatial dimension of the tissue structure, above which the spatial structure of the tissue has no effect on the mutation fixation dynamics. An effective discrete-state stochastic model of cancer initiation is utilized to explain our theoretical results and predictions. Our theoretical analysis clarifies some important aspects on the role of the tissue spatial structures in the cancer initiation processes.

Game-theoretical approach for opinion dynamics on social networks

Opinion dynamics on social networks have received considerable attentions in recent years. Nevertheless, just a few works have theoretically analyzed the condition in which a certain opinion can spread in the whole structured population. In this article, we propose an evolutionary game approach for a binary opinion model to explore the conditions for an opinion's spreading. Inspired by real-life observations, we assume that an agent's choice to select an opinion is not random but is based on a score rooted from both public knowledge and the interactions with neighbors. By means of coalescing random walks, we obtain a condition in which opinion A can be favored to spread on social networks in the weak selection limit. We find that the successfully spreading condition of opinion A is closely related to the basic scores of binary opinions, the feedback scores on opinion interactions, and the structural parameters including the edge weights, the weighted degrees of vertices, and the average degree of the network. In particular, when individuals adjust their opinions based solely on the public information, the vitality of opinion A depends exclusively on the difference of basic scores of A and B. When there are no negative (positive) feedback interactions between connected individuals, we find that the success of opinion A depends on the ratio of the obtained positive (negative) feedback scores of competing opinions. To complete our study, we perform computer simulations on fully connected, small-world, and scale-free networks, respectively, which support and confirm our theoretical findings.

Martingales and the fixation time of evolutionary graphs with arbitrary dimensionality

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.

Toward a Universal Model for Spatially Structured Populations

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.

Martingales and the characteristic functions of absorption time on bipartite graphs

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.

Fixation probabilities in network structured meta-populations

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.

Fast and strong amplifiers of natural selection

Selection and random drift determine the probability that novel mutations fixate in a population. Population structure is known to affect the dynamics of the evolutionary process. Amplifiers of selection are population structures that increase the fixation probability of beneficial mutants compared to well-mixed populations. Over the past 15 years, extensive research has produced remarkable structures called strong amplifiers which guarantee that every beneficial mutation fixates with high probability. But strong amplification has come at the cost of considerably delaying the fixation event, which can slow down the overall rate of evolution. However, the precise relationship between fixation probability and time has remained elusive. Here we characterize the slowdown effect of strong amplification. First, we prove that all strong amplifiers must delay the fixation event at least to some extent. Second, we construct strong amplifiers that delay the fixation event only marginally as compared to the well-mixed populations. Our results thus establish a tight relationship between fixation probability and time: Strong amplification always comes at a cost of a slowdown, but more than a marginal slowdown is not needed.

Graph-structured populations and the Hill-Robertson effect

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)).

Fixation probabilities in evolutionary dynamics under weak selection

In evolutionary dynamics, a key measure of a mutant trait's success is the probability that it takes over the population given some initial mutant-appearance distribution. This "fixation probability" is difficult to compute in general, as it depends on the mutation's effect on the organism as well as the population's spatial structure, mating patterns, and other factors. In this study, we consider weak selection, which means that the mutation's effect on the organism is small. We obtain a weak-selection perturbation expansion of a mutant's fixation probability, from an arbitrary initial configuration of mutant and resident types. Our results apply to a broad class of stochastic evolutionary models, in which the size and spatial structure are arbitrary (but fixed). The problem of whether selection favors a given trait is thereby reduced from exponential to polynomial complexity in the population size, when selection is weak. We conclude by applying these methods to obtain new results for evolutionary dynamics on graphs.

Wald’s martingale and the conditional distributions of absorption time in the Moran process

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.

Limits on amplifiers of natural selection under death-Birth updating

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.

Transient amplifiers of selection and reducers of fixation for death-Birth updating on graphs

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.

Close spatial arrangement of mutants favors and disfavors fixation

Cooperation is ubiquitous across all levels of biological systems ranging from microbial communities to human societies. It, however, seemingly contradicts the evolutionary theory, since cooperators are exploited by free-riders and thus are disfavored by natural selection. Many studies based on evolutionary game theory have tried to solve the puzzle and figure out the reason why cooperation exists and how it emerges. Network reciprocity is one of the mechanisms to promote cooperation, where nodes refer to individuals and links refer to social relationships. The spatial arrangement of mutant individuals, which refers to the clustering of mutants, plays a key role in network reciprocity. Besides, many other mechanisms supporting cooperation suggest that the clustering of mutants plays an important role in the expansion of mutants. However, the clustering of mutants and the game dynamics are typically coupled. It is still unclear how the clustering of mutants alone alters the evolutionary dynamics. To this end, we employ a minimal model with frequency independent fitness on a circle. It disentangles the clustering of mutants from game dynamics. The distance between two mutants on the circle is adopted as a natural indicator for the clustering of mutants or assortment. We find that the assortment is an amplifier of the selection for the connected mutants compared with the separated ones. Nevertheless, as mutants are separated, the more dispersed mutants are, the greater the chance of invasion is. It gives rise to the non-monotonic effect of clustering, which is counterintuitive. On the other hand, we find that less assortative mutants speed up fixation. Our model shows that the clustering of mutants plays a non-trivial role in fixation, which has emerged even if the game interaction is absent.

Evolutionary dynamics on networks are key for biological and social evolution. Typically, the clustering mutants on networks can dramatically alter the direction of selection. Previous studies on the assortment of mutants assume that individuals interact in a frequency-dependent way. It is hard to tell how assortment alone alters the evolutionary fate. We establish a minimal network model to disentangle the assortment from the game interaction. We find that for weak selection limit, the assortment of mutants plays little role in fixation probability. For strong selection limit, connected mutants, i.e., the maximum assortment, are best for fixation. When the mutants are separated by only one wild-type individual, it is worse off than that separated by more than one wild-type individual in fixation probability. Our results show the nontrivial yet fundamental effect of the clustering on fixation. Noteworthily, it has already arisen, even if the game interaction is absent.

Motion, fixation probability and the choice of an evolutionary process

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.

A Modeling Approach that Integrates Individual Behavior, Social Networks, and Cross-Cultural Variation

How do psychological traits shape social networks? How does this relationship influence the spread of behavior? In a recent paper, Muthukrishna and Schaller (Pers. Soc. Psychol. Rev., 2019) use a modeling approach to explore these questions. In doing so, they illustrate the value of using a multilevel approach to study human behavior.

Computation and Simulation of Evolutionary Game Dynamics in Finite Populations

The study of evolutionary dynamics increasingly relies on computational methods, as more and more cases outside the range of analytical tractability are explored. The computational methods for simulation and numerical approximation of the relevant quantities are diverging without being compared for accuracy and performance. We thoroughly investigate these algorithms in order to propose a reliable standard. For expositional clarity we focus on symmetric 2 × 2 games leading to one-dimensional processes, noting that extensions can be straightforward and lessons will often carry over to more complex cases. We provide time-complexity analysis and systematically compare three families of methods to compute fixation probabilities, fixation times and long-term stationary distributions for the popular Moran process. We provide efficient implementations that substantially improve wall times over naive or immediate implementations. Implications are also discussed for the Wright-Fisher process, as well as structured populations and multiple types.

Population structure determines the tradeoff between fixation probability and fixation time

The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization.

Exploring and mapping the universe of evolutionary graphs identifies structural properties affecting fixation probability and time

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.

Fixation time in evolutionary graphs: A mean-field approach

Using an analytical method we calculate average conditional fixation time of mutants in a general graph-structured population of two types of species. The method is based on Markov chains and uses a mean-field approximation to calculate the corresponding transition matrix. Analytical results are compared with the results of simulation of the Moran process on a number of network structures.

Fixation properties of multiple cooperator configurations on regular graphs

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.

Invasion and effective size of graph-structured populations

Population structure can strongly affect evolutionary dynamics. The most general way to describe population structures are graphs. An important observable on evolutionary graphs is the probability that a novel mutation spreads through the entire population. But what drives this spread of a mutation towards fixation? Here, we propose a novel way to understand the forces driving fixation by borrowing techniques from evolutionary demography to quantify the invasion fitness and the effective population size for different graphs. Our method is very general and even applies to weighted graphs with node dependent fitness. However, we focus on analytical results for undirected graphs with node independent fitness. The method will allow to conceptually integrate evolutionary graph theory with theoretical genetics of structured populations.

Evolving populations, companies, social circles are networks in which genes, resources and ideas circulate. Imagine a useful novelty is introduced in the network: a favorable mutation, a new product concept or a smart idea. Will this novelty be retained and propagated through the network or rather lost? Using tools originally devised for demographic research, we model the dynamics of the very initial spread of a useful novelty in a network. The network structure has a strong impact on these dynamics by affecting the effective network size through random effects. This effective network size, which correlates with the probability that a novelty spreads and is different from the actual size (i.e. number of nodes), varies with network structure. The effective size can even become independent of the actual network size and thus remain very small even for huge networks.

The effect of spatial randomness on the average fixation time of mutants

The mean conditional fixation time of a mutant is an important measure of stochastic population dynamics, widely studied in ecology and evolution. Here, we investigate the effect of spatial randomness on the mean conditional fixation time of mutants in a constant population of cells, N. Specifically, we assume that fitness values of wild type cells and mutants at different locations come from given probability distributions and do not change in time. We study spatial arrangements of cells on regular graphs with different degrees, from the circle to the complete graph, and vary assumptions on the fitness probability distributions. Some examples include: identical probability distributions for wild types and mutants; cases when only one of the cell types has random fitness values while the other has deterministic fitness; and cases where the mutants are advantaged or disadvantaged. Using analytical calculations and stochastic numerical simulations, we find that randomness has a strong impact on fixation time. In the case of complete graphs, randomness accelerates mutant fixation for all population sizes, and in the case of circular graphs, randomness delays mutant fixation for N larger than a threshold value (for small values of N, different behaviors are observed depending on the fitness distribution functions). These results emphasize fundamental differences in population dynamics under different assumptions on cell connectedness. They are explained by the existence of randomly occurring “dead zones” that can significantly delay fixation on networks with low connectivity; and by the existence of randomly occurring “lucky zones” that can facilitate fixation on networks of high connectivity. Results for death-birth and birth-death formulations of the Moran process, as well as for the (haploid) Wright Fisher model are presented.

We study the influence of randomness on evolutionary dynamics, assuming that a newly arising mutant may experience a different set of environments compared to the wild type. We calculate the mean conditional fixation time of the mutant under different assumptions on spatial interactions, and show that randomness has a strong impact on the fixation time. In particular, it delays the fixation of mutants on 1D circles and accelerates it on complete graphs (the so called mass action, or complete mixing, model). This result holds for advantageous, disadvantageous, and neutral (on average) mutants. The reason for this pattern is quite intuitive: in a rigid, 1D structure, randomness can by chance put a “roadblock” and disrupt mutant spread, causing significant delay. In higher dimensions, there are many ways for a mutant to spread, and it is difficult to block all of them by chance; on the other hand, randomness can enhance fixation by providing an “easier” path. The effects of a random environment are important in biological models such as bacterial growth or cancer initiation/progression.

Competing opinion diffusion on social networks

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.

Genotype by random environmental interactions gives an advantage to non-favored minor alleles

Fixation probability, the probability that the frequency of a newly arising mutation in a population will eventually reach unity, is a fundamental quantity in evolutionary genetics. Here we use a number of models (several versions of the Moran model and the haploid Wright-Fisher model) to examine fixation probabilities for a constant size population where the fitness is a random function of both allelic state and spatial position, despite neither allele being favored on average. The concept of fitness varying with respect to both genotype and environment is important in models of cancer initiation and progression, bacterial dynamics, and drug resistance. Under our model spatial heterogeneity redefines the notion of neutrality for a newly arising mutation, as such mutations fix at a higher rate than that predicted under neutrality. The increased fixation probability appears to be due to rare alleles having an advantage. The magnitude of this effect can be large, and is an increasing function of the spatial variance and skew in fitness. The effect is largest when the fitness values of the mutants and wild types are anti-correlated across environments. We discuss results for both a spatial ring geometry of cells (such as that of a colonic crypt), a 2D lattice and a mass-action (complete graph) arrangement.

Takeover times for a simple model of network infection

We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many time steps T does it take to completely infect a network of N nodes, starting from a single infected node? An analogy to the classic "coupon collector" problem of probability theory reveals that the takeover time T is dominated by extremal behavior, either when there are only a few infected nodes near the start of the process or a few susceptible nodes near the end. We show that for N≫1, the takeover time T is distributed as a Gumbel distribution for the star graph, as the convolution of two Gumbel distributions for a complete graph and an Erdős-Rényi random graph, as a normal for a one-dimensional ring and a two-dimensional lattice, and as a family of intermediate skewed distributions for d-dimensional lattices with d≥3 (these distributions approach the convolution of two Gumbel distributions as d approaches infinity). Connections to evolutionary dynamics, cancer, incubation periods of infectious diseases, first-passage percolation, and other spreading phenomena in biology and physics are discussed.

Amplification on Undirected Population Structures: Comets Beat Stars

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.

Evolutionary games on cycles with strong selection

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the well-mixed case, can act as amplifiers or suppressors of selection by increasing or decreasing the fixation probability of a beneficial mutant. Properties of the associated mean fixation times can be more intricate, especially when selection is strong. The intuition is that fixation of a beneficial mutant happens fast in a dominance game, that fixation takes very long in a coexistence game, and that strong selection eliminates demographic noise. Here we show that these intuitions can be misleading in structured populations. We analyze mean fixation times on the cycle graph under strong frequency-dependent selection for two different microscopic evolutionary update rules (death-birth and birth-death). We establish exact analytical results for fixation times under strong selection and show that there are coexistence games in which fixation occurs in time polynomial in population size. Depending on the underlying game, we observe inherence of demographic noise even under strong selection if the process is driven by random death before selection for birth of an offspring (death-birth update). In contrast, if selection for an offspring occurs before random removal (birth-death update), then strong selection can remove demographic noise almost entirely.

Should tissue structure suppress or amplify selection to minimize cancer risk?

Background

It has been frequently argued that tissues evolved to suppress the accumulation of growth enhancing cancer inducing mutations. A prominent example is the hierarchical structure of tissues with high cell turnover, where a small number of tissue specific stem cells produces a large number of specialized progeny during multiple differentiation steps. Another well known mechanism is the spatial organization of stem cell populations and it is thought that this organization suppresses fitness enhancing mutations. However, in small populations the suppression of advantageous mutations typically also implies an increased accumulation of deleterious mutations. Thus, it becomes an important question whether the suppression of potentially few advantageous mutations outweighs the combined effects of many deleterious mutations.

Results

We argue that the distribution of mutant fitness effects, e.g. the probability to hit a strong driver compared to many deleterious mutations, is crucial for the optimal organization of a cancer suppressing tissue architecture and should be taken into account in arguments for the evolution of such tissues.

Conclusion

We show that for systems that are composed of few cells reflecting the typical organization of a stem cell niche, amplification or suppression of selection can arise from subtle changes in the architecture. Moreover, we discuss special tissue structures that can suppress most types of non-neutral mutations simultaneously.

Reviewers

This article was reviewed by Benjamin Allen, Andreas Deutsch and Ignacio Rodriguez-Brenes. For the full reviews, please go to the Reviewers’ comments section.

Structural symmetry in evolutionary games

In evolutionary game theory, an important measure of a mutant trait (strategy) is its ability to invade and take over an otherwise-monomorphic population. Typically, one quantifies the success of a mutant strategy via the probability that a randomly occurring mutant will fixate in the population. However, in a structured population, this fixation probability may depend on where the mutant arises. Moreover, the fixation probability is just one quantity by which one can measure the success of a mutant; fixation time, for instance, is another. We define a notion of homogeneity for evolutionary games that captures what it means for two single-mutant states, i.e. two configurations of a single mutant in an otherwise-monomorphic population, to be 'evolutionarily equivalent' in the sense that all measures of evolutionary success are the same for both configurations. Using asymmetric games, we argue that the term 'homogeneous' should apply to the evolutionary process as a whole rather than to just the population structure. For evolutionary matrix games in graph-structured populations, we give precise conditions under which the resulting process is homogeneous. Finally, we show that asymmetric matrix games can be reduced to symmetric games if the population structure possesses a sufficient degree of symmetry.

Speed of evolution on graphs

The likelihood that a mutant fixates in the wild population, i.e., fixation probability, has been intensively studied in evolutionary game theory, where individuals' fitness is frequency dependent. However, it is of limited interest when it takes long to take over. Thus the speed of evolution becomes an important issue. In general, it is still unclear how fixation times are affected by the population structure, although the fixation times have already been addressed in the well-mixed populations. Here we theoretically address this issue by pair approximation and diffusion approximation on regular graphs. It is shown (i) that under neutral selection, both unconditional and conditional fixation time are shortened by increasing the number of neighbors; (ii) that under weak selection, for the simplified prisoner's dilemma game, if benefit-to-cost ratio exceeds the degree of the graph, then the unconditional fixation time of a single cooperator is slower than that in the neutral case; and (iii) that under weak selection, for the conditional fixation time, limited neighbor size dilutes the counterintuitive stochastic slowdown which was found in well-mixed populations. Interestingly, we find that all of our results can be interpreted as that in the well-mixed population with a transformed payoff matrix. This interpretation is also valid for both death-birth and birth-death processes on graphs. This interpretation bridges the fixation time in the structured population and that in the well-mixed population. Thus it opens the avenue to investigate the challenging fixation time in structured populations by the known results in well-mixed populations.

Most Undirected Random Graphs Are Amplifiers of Selection for Birth-Death Dynamics, but Suppressors of Selection for Death-Birth Dynamics

We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of selection are graphs for which the fixation probability is increased for advantageous mutants and decreased for disadvantageous mutants. A few examples of such amplifiers have been developed, but so far it is unclear how many such structures exist and how to construct them. Here, we show that almost any undirected random graph is an amplifier of selection for Birth-death updating, where an individual is selected to reproduce with probability proportional to its fitness and one of its neighbors is replaced by that offspring at random. If we instead focus on death-Birth updating, in which a random individual is removed and its neighbors compete for the empty spot, then the same ensemble of graphs consists of almost only suppressors of selection for which the fixation probability is decreased for advantageous mutants and increased for disadvantageous mutants. Thus, the impact of population structure on evolutionary dynamics is a subtle issue that will depend on seemingly minor details of the underlying evolutionary process.

Evolutionary dynamics describes the spread of individuals with different features within a population. This spreading process can be strongly influenced by the population structure—if a highly successful individual can only displace a few neighbors, it may take more time to spread than an individual that can displace all other individuals from the population. In particular, a population structure can also amplify the evolutionary success of a type. We show that almost all random population structures lead to such an amplification. However, if we change a presumably minor detail of the evolutionary model, almost all random population structures have the opposite effect and suppress the evolutionary success of a type. Thus, it is crucial to consider the underlying assumptions of such models when discussing their possible implications for real biological systems.

Analytical calculation of average fixation time in evolutionary graphs

The ability of a mutant individual to overtake the whole of a population is one of the fundamental problems in evolutionary dynamics. Fixation probability and Average Fixation Time (AFT) are two important parameters to quantify this ability. In this paper we introduce an analytical approach for exact calculation of AFT. Using this method we obtain AFT for two types of evolutionary graphs: cycle graph, as a highly homogeneous graph and star graph, as a highly heterogeneous graph. We use symmetries of these graphs to calculate AFT. Analytical results are confirmed with simulation. We also examine the effect of adding some random edges to each of these structures.

Amplifiers of selection

When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement—that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two.