Evolutionary dynamics on any population structure

The role of habitat configuration in shaping animal population processes: a framework to generate quantitative predictions

By shaping where individuals move, habitat configuration can fundamentally structure animal populations. Yet, we currently lack a framework for generating quantitative predictions about the role of habitat configuration in modulating population outcomes. To address this gap, we propose a modelling framework inspired by studies using networks to characterize habitat connectivity. We first define animal habitat networks, explain how they can integrate information about the different configurational features of animal habitats, and highlight the need for a bottom–up generative model that can depict realistic variations in habitat potential connectivity. Second, we describe a model for simulating animal habitat networks (available in the R package AnimalHabitatNetwork), and demonstrate its ability to generate alternative habitat configurations based on empirical data, which forms the basis for exploring the consequences of alternative habitat structures. Finally, we lay out three key research questions and demonstrate how our framework can address them. By simulating the spread of a pathogen within a population, we show how transmission properties can be impacted by both local potential connectivity and landscape-level characteristics of habitats. Our study highlights the importance of considering the underlying habitat configuration in studies linking social structure with population-level outcomes.

Aspiration dynamics generate robust predictions in heterogeneous populations

Update rules, which describe how individuals adjust their behavior over time, affect the outcome of social interactions. Theoretical studies have shown that evolutionary outcomes are sensitive to model details when update rules are imitation-based but are robust when update rules are self-evaluation based. However, studies of self-evaluation based rules have focused on homogeneous population structures where each individual has the same number of neighbors. Here, we consider heterogeneous population structures represented by weighted networks. Under weak selection, we analytically derive the condition for strategy success, which coincides with the classical condition of risk-dominance. This condition holds for all weighted networks and distributions of aspiration levels, and for individualized ways of self-evaluation. Our findings recover previous results as special cases and demonstrate the universality of the robustness property under self-evaluation based rules. Our work thus sheds light on the intrinsic difference between evolutionary dynamics under self-evaluation based and imitation-based update rules.

Social interaction outcomes can depend on the type of information individuals possess and how it is used in decision-making. Here, Zhou et al. find that self-evaluation based decision-making rules lead to evolutionary outcomes that are robust to different population structures and ways of self-evaluation.

Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs

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.

Cooperative root graft networks benefit mangrove trees under stress

The occurrence of natural root grafts, the union of roots of the same or different trees, is common and shared across tree species. However, their significance for forest ecology remains little understood. While early research suggested negative effects of root grafting with the risk of pathogen transmission, recent evidence supports the hypothesis that it is an adaptive strategy that reduces stress by facilitating resource exchange. Here, by analysing mangrove root graft networks in a non-destructive way at stand level, we show further evidence of cooperation-associated benefits of root grafting. Grafted trees were found to dominate the upper canopy of the forest, and as the probability of grafting and the frequency of grafted groups increased with a higher environmental stress, the mean number of trees within grafted groups decreased. While trees do not actively 'choose' neighbours to graft to, our findings point to the existence of underlying mechanisms that regulate 'optimal group size' selection related to resource use within cooperating networks. This work calls for further studies to better understand tree interactions (i.e. network hydraulic redistribution) and their consequences for individual tree and forest stand resilience.

Evolutionary dynamics of higher-order interactions in social networks

We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in larger groups. Here, we study the evolutionary dynamics of a public goods game in social systems with higher-order interactions. First, we show that the game on uniform hypergraphs corresponds to the replicator dynamics in the well-mixed limit, providing a formal theoretical foundation to study cooperation in networked groups. Second, we unveil how the presence of hubs and the coexistence of interactions in groups of different sizes affects the evolution of cooperation. Finally, we apply the proposed framework to extract the actual dependence of the synergy factor on the size of a group from real-world collaboration data in science and technology. Our work provides a way to implement informed actions to boost cooperation in social groups.

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

Evolutionary graph theory derived from eco-evolutionary dynamics

A biologically motivated individual-based framework for evolution in network-structured populations is developed that can accommodate eco-evolutionary dynamics. This framework is used to construct a network birth and death model. The evolutionary graph theory model, which considers evolutionary dynamics only, is derived as a special case, highlighting additional assumptions that diverge from real biological processes. This is achieved by introducing a negative ecological feedback loop that suppresses ecological dynamics by forcing births and deaths to be coupled. We also investigate how fitness, a measure of reproductive success used in evolutionary graph theory, is related to the life-history of individuals in terms of their birth and death rates. In simple networks, these ecologically motivated dynamics are used to provide new insight into the spread of adaptive mutations, both with and without clonal interference. For example, the star network, which is known to be an amplifier of selection in evolutionary graph theory, can inhibit the spread of adaptive mutations when individuals can die naturally.

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.

Fixation probabilities in graph-structured populations under weak selection

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.

The prevalence of dyads in social life

A salient objective feature of the social environment in which people find themselves is group size. Knowledge of group size is highly relevant to behavioural scientists given that humans spend considerable time in social settings and the number of others influences much of human behaviour. What size of group do people actually look for and encounter in everyday life? Here we report four survey studies and one experience-sampling study (total N = 4,398) which provide evidence for the predominance of the dyad in daily life. Relative to larger group sizes, dyads are most common across a wide range of activities (e.g., conversations, projects, holidays, movies, sports, bars) obtained from three time moments (past activities, present, and future activities), sampling both mixed-sex and same-sex groups, with three different methodological approaches (retrospective reports, real-time data capture, and preference measures) in the United States and the Netherlands. We offer four mechanisms that may help explain this finding: reciprocity, coordination, social exclusion, and reproduction. The present findings advance our understanding of how individuals organize themselves in everyday life.

On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs

The BC-subtree (a subtree in which any two leaves are at even distance apart) number index is the total number of non-empty BC-subtrees of a graph, and is defined as a counting-based topological index that incorporates the leaf distance constraint. In this paper, we provide recursive formulas for computing the BC-subtree generating functions of multi-fan and multi-wheel graphs. As an application, we obtain the BC-subtree numbers of multi-fan graphs, r multi-fan graphs, multi-wheel (wheel) graphs, and discuss the change of the BC-subtree numbers between different multi-fan or multi-wheel graphs. We also consider the behavior of the BC-subtree number in these structures through the study of extremal problems and BC-subtree density. Our study offers a new perspective on understanding new structural properties of cyclic graphs.

Autonomy promotes the evolution of cooperation in prisoner's dilemma

Population structure has been widely reported to foster cooperation in spatially structured populations, where individuals interact with all of their network neighbors defined by the spatial structure in each generation. However, most results rely on the assumption that individuals strictly interact with all of their neighbors during evolution. In reality, human beings, with sophisticated psychology, are willing to interact with some of their neighbors from time to time. Thus, individuals may not play games with all neighbors due to their psychological factors. Here we investigate how the autonomy, one of the basic psychological needs, affects the fate of cooperators in various social networks. By constructing a dynamical effective network, we find that the introduction of autonomy favors cooperative behavior. Further systematical studies by eliminating heterogeneity and the dynamic characteristics of the network reveal that autonomy plays a pivotal role in the evolution of cooperation. Moreover, we find that a moderate effective network degree, defined by the product of the original network degree and the level of autonomy, maximizes the cooperation on networks connecting individuals with fixed neighbors. Our results offer a possible way for organizations to improve individuals' cooperation and shed light on the importance of individuals' psychology on the evolution of cooperation.

The Moran process on 2-chromatic graphs

Resources are rarely distributed uniformly within a population. Heterogeneity in the concentration of a drug, the quality of breeding sites, or wealth can all affect evolutionary dynamics. In this study, we represent a collection of properties affecting the fitness at a given location using a color. A green node is rich in resources while a red node is poorer. More colors can represent a broader spectrum of resource qualities. For a population evolving according to the birth-death Moran model, the first question we address is which structures, identified by graph connectivity and graph coloring, are evolutionarily equivalent. We prove that all properly two-colored, undirected, regular graphs are evolutionarily equivalent (where “properly colored” means that no two neighbors have the same color). We then compare the effects of background heterogeneity on properly two-colored graphs to those with alternative schemes in which the colors are permuted. Finally, we discuss dynamic coloring as a model for spatiotemporal resource fluctuations, and we illustrate that random dynamic colorings often diminish the effects of background heterogeneity relative to a proper two-coloring.

Heterogeneity in environmental conditions can have profound effects on long-term evolutionary outcomes in structured populations. We consider a population evolving on a colored graph, wherein the color of a node represents the resources at that location. Using a combination of analytical and numerical methods, we quantify the effects of background heterogeneity on a population’s dynamics. In addition to considering the notion of an “optimal” coloring with respect to mutant invasion, we also study the effects of dynamic spatial redistribution of resources as the population evolves. Although the effects of static background heterogeneity can be quite striking, these effects are often attenuated by the movement (or “flow”) of the underlying resources.

Quantifying Information without Entropy: Identifying Intermittent Disturbances in Dynamical Systems

A system’s response to disturbances in an internal or external driving signal can be characterized as performing an implicit computation, where the dynamics of the system are a manifestation of its new state holding some memory about those disturbances. Identifying small disturbances in the response signal requires detailed information about the dynamics of the inputs, which can be challenging. This paper presents a new method called the Information Impulse Function (IIF) for detecting and time-localizing small disturbances in system response data. The novelty of IIF is its ability to measure relative information content without using Boltzmann’s equation by modeling signal transmission as a series of dissipative steps. Since a detailed expression of the informational structure in the signal is achieved with IIF, it is ideal for detecting disturbances in the response signal, i.e., the system dynamics. Those findings are based on numerical studies of the topological structure of the dynamics of a nonlinear system due to perturbated driving signals. The IIF is compared to both the Permutation entropy and Shannon entropy to demonstrate its entropy-like relationship with system state and its degree of sensitivity to perturbations in a driving signal.

Multi-agent evolutionary game in the recycling utilization of construction waste

The recycling utilization of construction waste (CW) is of great importance to reduce waste discharge and protect natural resources. This study investigated the evolutionary decision making process and stable strategies among three stakeholders, including the government agency (GA), waste recycler (WR) and waste producer (WP), involved in CW recycling industry based on the game theory. The main factors that affected the strategies of the stakeholders were analyzed and the tripartite evolutionary game model is provided. The evolutionary stability strategy and stability conditions were analyzed subsequently. A numerical simulation illustrated the effectiveness of the proposed method, with which the evolutionary decision making process and stable strategies among the three stakeholders are simulated. It is shown that the GA plays different roles in different stages of the development of CW recycling industry. In the early stage, the supervision and policies of the GA are critical to improve the proportion of enterprises that implement the recycling strategy. With the mature of the CW recycling industry, it is profitable for enterprises to implement waste recycling, and a high proportion of enterprises choose to implement recycling strategy. Under this circumstance, the GA will gradually decrease their interventions to enterprises, and finally evolve into no supervision. Besides, it also concludes that low penalties and subsidies are not conducive to the evolution of the optimal strategy among the three participants, and excessive supervision costs will reduce the regulatory willingness of the GA, hindering the enthusiasm of WRs and WPs to implement the recycling strategy.

Potential syntrophic associations in anaerobic naphthenic acids biodegrading consortia inferred with microbial interactome networks

Naphthenic acids (NAs) can be syntrophically metabolized by indigenous microbial communities in pristine sediments beneath oil sands tailings ponds. Syntrophy is an essential determinant of the microbial interactome, however, the interactome network in anaerobic NAs-degrading consortia has not been previously addressed due to complexity and resistance of NAs. To evaluate the impact of electron acceptors on topology of interactome networks, we inferred two microbial interactome networks for anaerobic NAs-degrading consortia under nitrate- and sulfate-reducing conditions. The complexity of the network was higher under sulfate-reducing conditions than nitrate-reducing conditions. Differences in the taxonomic composition between the two modules implies that different potential syntrophic interactions exist in each network. We inferred the presence of the same syntrophic microorganisms, from genera Bellilinea, Longilinea, and Litorilinea, initiating the metabolism in both networks, but within each network, we predicted unique syntrophic associations that have not been reported. Electron acceptor has a large effect on the interactome networks for anaerobic NAs-degrading consortia, offers insight into an unrecognized dimension of these consortia. These results provide a novel approach for exploring potential syntrophic relationships in biodegrading processes to help cost-effectively remove NAs in oil sands tailings ponds.

Evolution of Cooperation in Social Dilemmas with Assortative Interactions

Cooperation in social dilemmas plays a pivotal role in the formation of systems at all levels of complexity, from replicating molecules to multi-cellular organisms to human and animal societies. In spite of its ubiquity, the origin and stability of cooperation pose an evolutionary conundrum, since cooperation, though beneficial to others, is costly to the individual cooperator. Thus natural selection would be expected to favor selfish behavior in which individuals reap the benefits of cooperation without bearing the costs of cooperating themselves. Many proximate mechanisms have been proposed to account for the origin and maintenance of cooperation, including kin selection, direct reciprocity, indirect reciprocity, and evolution in structured populations. Despite the apparent diversity of these approaches they all share a unified underlying logic: namely, each mechanism results in assortative interactions in which individuals using the same strategy interact with a higher probability than they would at random. Here we study the evolution of cooperation in both discrete strategy and continuous strategy social dilemmas with assortative interactions. For the sake of tractability, assortativity is modeled by an individual interacting with another of the same type with probability r and interacting with a random individual in the population with probability 1−r, where r is a parameter that characterizes the degree of assortativity in the system. For discrete strategy social dilemmas we use both a generalization of replicator dynamics and individual-based simulations to elucidate the donation, snowdrift, and sculling games with assortative interactions, and determine the analogs of Hamilton’s rule, which govern the evolution of cooperation in these games. For continuous strategy social dilemmas we employ both a generalization of deterministic adaptive dynamics and individual-based simulations to study the donation, snowdrift, and tragedy of the commons games, and determine the effect of assortativity on the emergence and stability of cooperation.

Topological constraints in early multicellularity favor reproductive division of labor

Reproductive division of labor (e.g. germ-soma specialization) is a hallmark of the evolution of multicellularity, signifying the emergence of a new type of individual and facilitating the evolution of increased organismal complexity. A large body of work from evolutionary biology, economics, and ecology has shown that specialization is beneficial when further division of labor produces an accelerating increase in absolute productivity (i.e. productivity is a convex function of specialization). Here we show that reproductive specialization is qualitatively different from classical models of resource sharing, and can evolve even when the benefits of specialization are saturating (i.e. productivity is a concave function of specialization). Through analytical theory and evolutionary individual-based simulations, we demonstrate that reproductive specialization is strongly favored in sparse networks of cellular interactions that reflect the morphology of early, simple multicellular organisms, highlighting the importance of restricted social interactions in the evolution of reproductive specialization.

Mutant Evolution in Spatially Structured and Fragmented Expanding Populations

Mutant evolution in spatially structured systems is important for a range of biological systems, but aspects of it still require further elucidation. Adding to previous work, we provide a simple derivation of growth laws that characterize the number of mutants of different relative fitness in expanding populations in spatial models of different dimensionalities. These laws are universal and independent of "microscopic" modeling details. We further study the accumulation of mutants and find that, with advantageous and neutral mutants, more of them are present in spatially structured, compared to well-mixed colonies of the same size. The behavior of disadvantageous mutants is subtle: if they are disadvantageous through a reduction in division rates, the result is the same, and it is the opposite if the disadvantage is due to a death rate increase. Finally, we show that in all cases, the same results are observed in fragmented, nonspatial patch models. This suggests that the patterns observed are the consequence of population fragmentation, and not spatial restrictions per se We provide an intuitive explanation for the complex dependence of disadvantageous mutant evolution on spatial restriction, which relies on desynchronized dynamics in different locations/patches, and plays out differently depending on whether the disadvantage is due to a lower division rate or a higher death rate. Implications for specific biological systems, such as the evolution of drug-resistant cell mutants in cancer or bacterial biofilms, are discussed.

Network Engineering Using Autonomous Agents Increases Cooperation in Human Groups

Cooperation in human groups is challenging, and various mechanisms are required to sustain it, although it nevertheless usually decays over time. Here, we perform theoretically informed experiments involving networks of humans (1,024 subjects in 64 networks) playing a public-goods game to which we sometimes added autonomous agents (bots) programmed to use only local knowledge. We show that cooperation can not only be stabilized, but even promoted, when the bots intervene in the partner selections made by the humans, re-shaping social connections locally within a larger group. Cooperation rates increased from 60.4% at baseline to 79.4% at the end. This network-intervention strategy outperformed other strategies, such as adding bots playing tit-for-tat. We also confirm that even a single bot can foster cooperation in human groups by using a mixed strategy designed to support the development of cooperative clusters. Simple artificial intelligence can increase the cooperation of groups.

Evolution of cooperation in an epithelium

Cooperation is prevalent in nature, not only in the context of social interactions within the animal kingdom but also on the cellular level. In cancer, for example, tumour cells can cooperate by producing growth factors. The evolution of cooperation has traditionally been studied for well-mixed populations under the framework of evolutionary game theory, and more recently for structured populations using evolutionary graph theory (EGT). The population structures arising due to cellular arrangement in tissues, however, are dynamic and thus cannot be accurately represented by either of these frameworks. In this work, we compare the conditions for cooperative success in an epithelium modelled using EGT, to those in a mechanical model of an epithelium—the Voronoi tessellation (VT) model. Crucially, in this latter model, cells are able to move, and birth and death are not spatially coupled. We calculate fixation probabilities in the VT model through simulation and an approximate analytic technique and show that this leads to stronger promotion of cooperation in comparison with the EGT model.

Evolution of cooperation on temporal networks

Population structure is a key determinant in fostering cooperation among naturally self-interested individuals in microbial populations, social insect groups, and human societies. Traditional research has focused on static structures, and yet most real interactions are finite in duration and changing in time, forming a temporal network. This raises the question of whether cooperation can emerge and persist despite an intrinsically fragmented population structure. Here we develop a framework to study the evolution of cooperation on temporal networks. Surprisingly, we find that network temporality actually enhances the evolution of cooperation relative to comparable static networks, despite the fact that bursty interaction patterns generally impede cooperation. We resolve this tension by proposing a measure to quantify the amount of temporality in a network, revealing an intermediate level that maximally boosts cooperation. Our results open a new avenue for investigating the evolution of cooperation and other emergent behaviours in more realistic structured populations.

Population structure enables emergence of cooperation among individuals, but the impact of the dynamic nature of real interaction networks is not understood. Here, the authors study the evolution of cooperation on temporal networks and find that temporality enhances the evolution of cooperation.

Spatial reciprocity in the evolution of cooperation

Cooperation is key to the survival of all biological systems. The spatial structure of a system constrains who interacts with whom (interaction partner) and who acquires new traits from whom (role model). Understanding when and to what degree a spatial structure affects the evolution of cooperation is an important and challenging topic. Here, we provide an analytical formula to predict when natural selection favours cooperation where the effects of a spatial structure are described by a single parameter. We find that a spatial structure promotes cooperation (spatial reciprocity) when interaction partners overlap role models. When they do not, spatial structure inhibits cooperation even without cooperation dilemmas. Furthermore, a spatial structure in which individuals interact with their role models more often shows stronger reciprocity. Thus, imitating individuals with frequent interactions facilitates cooperation. Our findings are applicable to both pairwise and group interactions and show that strong social ties might hinder, while asymmetric spatial structures for interaction and trait dispersal could promote cooperation.

Self-regulation versus social influence for promoting cooperation on networks

Cooperation is a relevant and controversial phenomenon in human societies. Indeed, although it is widely recognized essential for tackling social dilemmas, finding suitable policies for promoting cooperation can be arduous and expensive. More often, it is driven by pre-established schemas based on norms and punishments. To overcome this paradigm, we highlight the interplay between the influence of social interactions on networks and spontaneous self-regulating mechanisms on individuals behavior. We show that the presence of these mechanisms in a prisoner's dilemma game, may oppose the willingness of individuals to defect, thus allowing them to behave cooperatively, while interacting with others and taking conflicting decisions over time. These results are obtained by extending the Evolutionary Game Equations over Networks to account for self-regulating mechanisms. Specifically, we prove that players may partially or fully cooperate whether self-regulating mechanisms are sufficiently stronger than social pressure. The proposed model can explain unconditional cooperation (strong self-regulation) and unconditional defection (weak self-regulation). For intermediate self-regulation values, more complex behaviors are observed, such as mutual defection, recruiting (cooperate if others cooperate), exploitation of cooperators (defect if others cooperate) and altruism (cooperate if others defect). These phenomena result from dynamical transitions among different game structures, according to changes of system parameters and cooperation of neighboring players. Interestingly, we show that the topology of the network of connections among players is crucial when self-regulation, and the associated costs, are reasonably low. In particular, a population organized on a random network with a Scale-Free distribution of connections is more cooperative than on a network with an Erdös-Rényi distribution, and, in turn, with a regular one. These results highlight that social diversity, encoded within heterogeneous networks, is more effective for promoting cooperation.

Direct Reciprocity and Model-Predictive Strategy Update Explain the Network Reciprocity Observed in Socioeconomic Networks

Network reciprocity has been successfully put forward (since M. A. Nowak and R. May’s, 1992, influential paper) as the simplest mechanism—requiring no strategical complexity—supporting the evolution of cooperation in biological and socioeconomic systems. The mechanism is actually the network, which makes agents’ interactions localized, while network reciprocity is the property of the underlying evolutionary process to favor cooperation in sparse rather than dense networks. In theoretical models, the property holds under imitative evolutionary processes, whereas cooperation disappears in any network if imitation is replaced by the more rational best-response rule of strategy update. In social experiments, network reciprocity has been observed, although the imitative behavior did not emerge. What did emerge is a form of conditional cooperation based on direct reciprocity—the propensity to cooperate with neighbors who previously cooperated. To resolve this inconsistency, network reciprocity has been recently shown in a model that rationally confronts the two main behaviors emerging in experiments—reciprocal cooperation and unconditional defection—with rationality introduced by extending the best-response rule to a multi-step predictive horizon. However, direct reciprocity was implemented in a non-standard way, by allowing cooperative agents to temporarily cut the interaction with defecting neighbors. Here, we make this result robust to the way cooperators reciprocate, by implementing direct reciprocity with the standard tit-for-tat strategy and deriving similar results.

A novel route to cyclic dominance in voluntary social dilemmas

Cooperation is the backbone of modern human societies, making it a priority to understand how successful cooperation-sustaining mechanisms operate. Cyclic dominance, a non-transitive set-up comprising at least three strategies wherein the first strategy overrules the second, which overrules the third, which, in turn, overrules the first strategy, is known to maintain biodiversity, drive competition between bacterial strains, and preserve cooperation in social dilemmas. Here, we present a novel route to cyclic dominance in voluntary social dilemmas by adding to the traditional mix of cooperators, defectors and loners, a fourth player type, risk-averse hedgers, who enact tit-for-tat upon paying a hedging cost to avoid being exploited. When this cost is sufficiently small, cooperators, defectors and hedgers enter a loop of cyclic dominance that preserves cooperation even under the most adverse conditions. By contrast, when the hedging cost is large, hedgers disappear, consequently reverting to the traditional interplay of cooperators, defectors, and loners. In the interim region of hedging costs, complex evolutionary dynamics ensues, prompting transitions between states with two, three or four competing strategies. Our results thus reveal that voluntary participation is but one pathway to sustained cooperation via cyclic dominance.

Parent-preferred dispersal promotes cooperation in structured populations

Dispersal is a key process for the emergence of social and biological behaviours. Yet, little attention has been paid to dispersal's effects on the evolution of cooperative behaviour in structured populations. To address this issue, we propose two new dispersal modes, parent-preferred and offspring-preferred dispersal, incorporate them into the birth-death update rule, and consider the resultant strategy evolution in the prisoner's dilemma on random-regular, small-world, and scale-free networks, respectively. We find that parent-preferred dispersal favours the evolution of cooperation in these different types of population structures, while offspring-preferred dispersal inhibits the evolution of cooperation in homogeneous populations. On scale-free networks when the strength of parent-preferred dispersal is weak, cooperation can be enhanced at intermediate strengths of offspring-preferred dispersal, and cooperators can coexist with defectors at high strengths of offspring-preferred dispersal. Moreover, our theoretical analysis based on the pair-approximation method corroborates the evolutionary outcomes on random-regular networks. We also incorporate the two new dispersal modes into three other update rules (death-birth, imitation, and pairwise comparison updating), and find that similar results about the effects of parent-preferred and offspring-preferred dispersal can again be observed in the aforementioned different types of population structures. Our work, thus, unveils robust effects of preferential dispersal modes on the evolution of cooperation in different interactive environments.

Collaboration leads to cooperation on sparse networks

For almost four decades, cooperation has been studied through the lens of the prisoner’s dilemma game, with cooperation modelled as the play of a specific strategy. However, an alternative approach to cooperative behavior has recently been proposed. Known as collaboration, the new approach considers mutualistic strategic choice and can be applied to any game. Here, we bring these approaches together and study the effect of collaboration on cooperative dynamics in the standard prisoner’s dilemma setting. It turns out that, from a baseline of zero cooperation in the absence of collaboration, even relatively rare opportunities to collaborate can support material, and robust, levels of cooperation. This effect is mediated by the interaction structure, such that collaboration leads to greater levels of cooperation when each individual strategically interacts with relatively few other individuals, matching well-known characteristics of human interaction networks. Conversely, collaboratively induced cooperation vanishes from dense networks, thus placing environmental limits on collaboration’s successful role in cooperation.

It is traditional in game theory to model cooperation as the play of a given strategy in a social dilemma. This approach is subject to the criticism that cooperation has to be separately defined for each new situation in which it is considered. Recently, collaboration—the ability to participate in collective decision making and optimization, has been proposed as an alternative approach to cooperative behavior. Collaboration has the benefit that it can be defined independently of any game. We bring these two approaches together, showing that even relatively rare opportunities for collaboration can support robust levels of cooperation, especially when interaction networks are sparse. This result is significant as human networks are often sparse and so our results support the wide distribution and persistence of cooperation across human populations.

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.

Evolutionary dynamics with game transitions

The environment has a strong influence on a population's evolutionary dynamics. Driven by both intrinsic and external factors, the environment is subject to continual change in nature. To capture an ever-changing environment, we consider a model of evolutionary dynamics with game transitions, where individuals' behaviors together with the games that they play in one time step influence the games to be played in the next time step. Within this model, we study the evolution of cooperation in structured populations and find a simple rule: Weak selection favors cooperation over defection if the ratio of the benefit provided by an altruistic behavior, b, to the corresponding cost, c, exceeds [Formula: see text], where k is the average number of neighbors of an individual and [Formula: see text] captures the effects of the game transitions. Even if cooperation cannot be favored in each individual game, allowing for a transition to a relatively valuable game after mutual cooperation and to a less valuable game after defection can result in a favorable outcome for cooperation. In particular, small variations in different games being played can promote cooperation markedly. Our results suggest that simple game transitions can serve as a mechanism for supporting prosocial behaviors in highly connected populations.

Evolutionary games on isothermal graphs

Population structure affects the outcome of natural selection. These effects can be modeled using evolutionary games on graphs. Recently, conditions were derived for a trait to be favored under weak selection, on any weighted graph, in terms of coalescence times of random walks. Here we consider isothermal graphs, which have the same total edge weight at each node. The conditions for success on isothermal graphs take a simple form, in which the effects of graph structure are captured in the ‘effective degree’—a measure of the effective number of neighbors per individual. For two update rules (death-Birth and birth-Death), cooperative behavior is favored on a large isothermal graph if the benefit-to-cost ratio exceeds the effective degree. For two other update rules (Birth-death and Death-birth), cooperation is never favored. We relate the effective degree of a graph to its spectral gap, thereby linking evolutionary dynamics to the theory of expander graphs. Surprisingly, we find graphs of infinite average degree that nonetheless provide strong support for cooperation.

The spatial structure of a population is often critical for the evolution of cooperation. Here, Allen and colleagues show that when spatial structure is represented by an isothermal graph, the effective number of neighbors per individual determines whether or not cooperation can evolve.

Heterogeneous cooperative leadership structure emerging from random regular graphs

This paper investigates the evolution of cooperation and the emergence of hierarchical leadership structure in random regular graphs. It is found that there exist different learning patterns between cooperators and defectors, and cooperators are able to attract more followers and hence more likely to become leaders. Hence, the heterogeneous distributions of reputation and leadership can emerge from homogeneous random graphs. The important directed game-learning skeleton is then studied, revealing some important structural properties, such as the heavy-tailed degree distribution and the positive in-in degree correlation.

Diffusion-driven enhancement of the antibiotic resistance selection window

The current crisis of antimicrobial resistance in clinically relevant pathogens has highlighted our limited understanding of the ecological and evolutionary forces that drive drug resistance adaptation. For instance, although human tissues are highly heterogeneous, most of our mechanistic understanding about antibiotic resistance evolution is based on constant and well-mixed environmental conditions. A consequence of considering spatial heterogeneity is that, even if antibiotics are prescribed at high dosages, the penetration of drug molecules through tissues inevitably produces antibiotic gradients, exposing bacterial populations to a range of selective pressures and generating a dynamic fitness landscape that changes in space and time. In this paper, we will use a combination of mathematical modelling and computer simulations to study the population dynamics of susceptible and resistant strains competing for resources in a network of micro-environments with varying degrees of connectivity. Our main result is that highly connected environments increase diffusion of drug molecules, enabling resistant phenotypes to colonize a larger number of spatial locations. We validated this theoretical result by culturing fluorescently labelled Escherichia coli in 3D-printed devices that allow us to control the rate of diffusion of antibiotics between neighbouring compartments and quantify the spatio-temporal distribution of resistant and susceptible bacterial cells.

Genetic rescue by distant trees mitigates qualitative pollen limitation imposed by fine-scale spatial genetic structure

Restricted seed dispersal frequently leads to fine-scale spatial genetic structure (i.e., FSGS) within plant populations. Depending on its spatial extent and the mobility of pollinators, this inflated kinship at the immediate neighbourhood can critically impoverish pollen quality. Despite the common occurrence of positive FSGS within plant populations, our knowledge regarding the role of long-distance pollination preventing reproductive failure is still limited. Using microsatellite markers, we examined the existence of positive FSGS in two low-density populations of the tree Pyrus bourgaeana. We also designed controlled crosses among trees differing in their kinship to investigate the effects of increased local kinship on plant reproduction. We used six pollination treatments and fully monitored fruit production, fruit and seed weight, proportion of mature seeds per fruit, and seed germination. Our results revealed positive FSGS in both study populations and lower fruit initiation in flowers pollinated with pollen from highly-genetically related individuals within the neighbourhood, with this trend intensifying as the fruit development progressed. Besides, open-pollinated flowers exhibited lower performance compared to those pollinated by distant pollen donors, suggesting intense qualitative pollen limitation in natural populations. We found positive fine-scale spatial genetic structure is translated into impoverished pollen quality from nearby pollen donors which negatively impacts the reproductive success of trees in low-density populations. Under this scenario of intrapopulation genetic rescue by distant pollen donors, the relevance of highly-mobile pollinators for connecting spatially and genetically distant patches of trees may be crucial to safeguarding population recruitment.

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.

Community Detection on Networks with Ricci Flow

Many complex networks in the real world have community structures - groups of well-connected nodes with important functional roles. It has been well recognized that the identification of communities bears numerous practical applications. While existing approaches mainly apply statistical or graph theoretical/combinatorial methods for community detection, in this paper, we present a novel geometric approach which  enables us to borrow powerful classical geometric methods and properties. By considering networks as geometric objects and communities in a network as a geometric decomposition, we apply curvature and discrete Ricci flow, which have been used to decompose smooth manifolds with astonishing successes in mathematics, to break down communities in networks. We  tested our method on networks with ground-truth community structures, and experimentally confirmed the effectiveness of this geometric approach.

Synergistic third-party rewarding and punishment in the public goods game

We study the evolution of cooperation in the spatial public goods game in the presence of third-party rewarding and punishment. The third party executes public intervention, punishing groups where cooperation is weak and rewarding groups where cooperation is strong. We consider four different scenarios to determine what works best for cooperation, in particular, neither rewarding nor punishment, only rewarding, only punishment or both rewarding and punishment. We observe strong synergistic effects when rewarding and punishment are simultaneously applied, which are absent if neither of the two incentives or just each individual incentive is applied by the third party. We find that public cooperation can be sustained at comparatively low third-party costs under adverse conditions, which is impossible if just positive or negative incentives are applied. We also examine the impact of defection tolerance and application frequency, showing that the higher the tolerance and the frequency of rewarding and punishment, the more cooperation thrives. Phase diagrams and characteristic spatial distributions of strategies are presented to corroborate these results, which will hopefully prove useful for more efficient public policies in support of cooperation in social dilemmas.

Conflict and convention in dynamic networks

An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models.

Benefits of asynchronous exclusion for the evolution of cooperation in stochastic evolutionary optional public goods games

Mechanisms and conditions for the spontaneous emergence of cooperation in multi-player social dilemma games remain an open question. This paper focuses on stochastic evolutionary optional public goods games with different exclusion strategies. We introduce four strategy types in the population, namely, cooperation, defection, loner and exclusion. Synchronous and asynchronous exclusion forms have been compared in finite-sized, well-mixed and structured populations. In addition, we verify that the asynchronous exclusion mechanism is indeed better than the synchronous exclusion mechanism in all cases. The benefits of the asynchronous exclusion are measured by comparing the probability that the system chooses the cooperative states in the two situations. In the well-mixed population cases, only when the investment amplification factor is small and the probability of exclusion success is high will the asynchronous exclusion mechanism have a relatively large advantage in promoting cooperation. However, in the structured population cases, the range of the investment amplification factor, in which the asynchronous exclusion mechanism has relatively large advantages in promoting cooperation, is somewhat different and is mainly in the middle of the interval under our parameters. Our study further corroborated that when non-participation and exclusion strategies exist, a structured population does not necessarily promote cooperation compared with a well-mixed population for some parameter combinations. Thus, we acquire a good understanding of the emergence of cooperation under different exclusion mechanisms.

Cooperation dynamics in networked geometric Brownian motion

Recent works suggest that pooling and sharing may constitute a fundamental mechanism for the evolution of cooperation in well-mixed fluctuating environments. The rationale is that, by reducing the amplitude of fluctuations, pooling and sharing increases the steady-state growth rate at which individuals self-reproduce. However, in reality interactions are seldom realized in a well-mixed structure, and the underlying topology is in general described by a complex network. Motivated by this observation, we investigate the role of the network structure on the cooperative dynamics in fluctuating environments, by developing a model for networked pooling and sharing of resources undergoing a geometric Brownian motion. The study reveals that, while in general cooperation increases the individual steady state growth rates (i.e., is evolutionary advantageous), the interplay with the network structure may yield large discrepancies in the observed individual resource endowments. We comment possible biological and social implications and discuss relations to econophysics.

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.

Repulsive synchronization in complex networks

Synchronization in complex networks characterizes what happens when an ensemble of oscillators in a complex autonomous system become phase-locked. We study the Kuramoto model with a tunable phase-lag parameter α in the coupling term to determine how phase shifts influence the synchronization transition. The simulation results show that the phase frustration parameter leads to desynchronization. We find two global synchronization regions for α∈[0,2π) when the coupling is sufficiently large and detect a relatively rare network synchronization pattern in the frustration parameter near α=π. We call this frequency-locking configuration as "repulsive synchronization," because it is induced by repulsive coupling. Since the repulsive synchronization cannot be described by the usual order parameter r, the parameter frequency dispersion is introduced to detect synchronization.