Evolutionary dynamics on any population structure

Evolutionary dynamics of behavioral motivations for cooperation

Human decision-making is shaped by underlying motivations, which reflect both subjective well-being and fundamental biological needs. Different needs are often prioritized and traded off against one another. Here we develop a theoretical framework to study the evolution of behavioral motivations, encompassing both philanthropic (cooperating after personal needs are met) and aspirational (cooperating to fulfill personal needs) motivations. Our findings show that when the ratio of benefits to costs for cooperation exceeds a critical threshold, individuals initially driven by aspirational motivations can transition to philanthropic motivations with a low reference point for cooperation, resulting in increased cooperation. Furthermore, the critical threshold depends on the structure of the underlying social network, with network modifications capable of reversing the evolutionary trajectory of motivations. Our results reveal the complex interplay between needs, motivations, social networks, and decision-making, offering insights into how evolution shapes not only cooperative behaviors but also the motivations behind them.

Spatial structure facilitates evolutionary rescue by drug resistance

Bacterial populations often have complex spatial structures, which can impact their evolution. Here, we study how spatial structure affects the evolution of antibiotic resistance in a bacterial population. We consider a minimal model of spatially structured populations where all demes (i.e., subpopulations) are identical and connected to each other by identical migration rates. We show that spatial structure can facilitate the survival of a bacterial population to antibiotic treatment, starting from a sensitive inoculum. Specifically, the bacterial population can be rescued if antibiotic resistant mutants appear and are present when drug is added, and spatial structure can impact the fate of these mutants and the probability that they are present. Indeed, the probability of fixation of neutral or deleterious mutations providing drug resistance is increased in smaller populations. This promotes local fixation of resistant mutants in the structured population, which facilitates evolutionary rescue by drug resistance in the rare mutation regime. Once the population is rescued by resistance, migrations allow resistant mutants to spread in all demes. Our main result that spatial structure facilitates evolutionary rescue by antibiotic resistance extends to more complex spatial structures, and to the case where there are resistant mutants in the inoculum.

Evolutionary dynamics of continuous public goods games in structured populations

Over the past few decades, many works have studied the evolutionary dynamics of continuous games. However, previous works have primarily focused on two-player games with pairwise interactions. Indeed, group interactions rather than pairwise interactions are usually found in real situations. The public goods game serves as a paradigm of multi-player interactions. Notably, various types of benefit functions are typically considered in public goods games, including linear, saturating, and sigmoid functions. Thus far, the evolutionary dynamics of cooperation in continuous public goods games with these benefit functions remain unknown in structured populations. In this paper, we consider the continuous public goods game in structured populations. By employing the pair approximation approach, we derive the analytical expressions for invasion fitness. Furthermore, we explore the adaptive dynamics of cooperative investments in the game with various benefit functions. First, for the linear public goods game, we find that there is no singular strategy, and the cooperative investments evolve to either the maximum or minimum depending on the benefit-to-cost ratio. Subsequently, we examine the game with saturating benefit functions and demonstrate the potential existence of an evolutionarily stable strategy (ESS). Additionally, for the game with the sigmoid benefit function, we observe that the evolutionary outcomes are closely related to the threshold value. When the threshold is small, a unique ESS emerges. For intermediate threshold values, both the ESS and repellor singular strategies can coexist. When the threshold value is large, a unique repellor displays. Finally, we perform individual-based simulations to validate our theoretical results.

Evolutionary dynamics in state-feedback public goods games with peer punishment

Public goods game serves as a valuable paradigm for studying the challenges of collective cooperation in human and natural societies. Peer punishment is often considered an effective incentive for promoting cooperation in such contexts. However, previous related studies have mostly ignored the positive feedback effect of collective contributions on individual payoffs. In this work, we explore global and local state-feedback, where the multiplication factor is positively correlated with the frequency of contributors in the entire population or within the game group, respectively. By using replicator dynamics in an infinite well-mixed population, we reveal that state-based feedback plays a crucial role in alleviating the cooperative dilemma by enhancing and sustaining cooperation compared to the feedback-free case. Moreover, when the feedback strength is sufficiently strong or the baseline multiplication factor is sufficiently high, the system with local state-feedback provides full cooperation, hence supporting the "think globally, act locally" principle. Besides, we show that the second-order free-rider problem can be partially mitigated under certain conditions when the state-feedback is employed. Importantly, these results remain robust with respect to variations in punishment cost and fine.

Evolutionary dynamics of cooperation driven by a mixed update rule in structured prisoner's dilemma games

How to understand the evolution of cooperation remains a scientific challenge. Individual strategy update rule plays an important role in the evolution of cooperation in a population. Previous works mainly assume that individuals adopt one single update rule during the evolutionary process. Indeed, individuals may adopt a mixed update rule influenced by different preferences such as payoff-driven and conformity-driven factors. It is still unclear how such mixed update rules influence the evolutionary dynamics of cooperation from a theoretical analysis perspective. In this work, in combination with the pairwise comparison rule and the conformity rule, we consider a mixed updating procedure into the evolutionary prisoner's dilemma game. We assume that individuals adopt the conformity rule for strategy updating with a certain probability in a structured population. By means of the pair approximation and mean-field approaches, we obtain the dynamical equations for the fraction of cooperators in the population. We prove that under weak selection, there exists one unique interior equilibrium point, which is stable, in the system. Accordingly, cooperators can survive with defectors under the mixed update rule in the structured population. In addition, we find that the stationary fraction of cooperators increases as the conformity strength increases, but is independent of the benefit parameter. Furthermore, we perform numerical calculations and computer simulations to confirm our theoretical predictions.

Repeated games with partner choice

Repetition is a classic mechanism for the evolution of cooperation. The standard way to study repeated games is to assume that there is an exogenous probability with which every interaction is repeated. If it is sufficiently likely that interactions are repeated, then reciprocity and cooperation can evolve together in repeated prisoner's dilemmas. Who individuals interact with can however also be under their control, or at least to some degree. If we change the standard model so that it allows for individuals to terminate the interaction with their current partner, and find someone else to play their prisoner's dilemmas with, then this limits the effectiveness of disciplining each other within the partnership, as one can always leave to escape punishment. The option to leave can however also be used to get away from someone who is not cooperating, which also has a disciplining effect. We find that the net effect of introducing the option to leave on cooperation is positive; with the option to leave, the average amount of cooperation that evolves in simulations is substantially higher than without. One of the reasons for this increase in cooperation is that partner choice creates endogenous phenotypic assortment. Compared to the standard models for the co-evolution of reciprocity and cooperation, and models of kin selection, our model thereby produces a better match with many forms of human cooperation in repeated settings. Individuals in our model end up interacting, not with random others that they cannot separate from, once matched, or with others that they are genetically related to, but with partners that they choose to stay with, and that are similarly dependable not to play defect as they are themselves.

Replicator dynamics on heterogeneous networks

Networked evolutionary game theory is a well-established framework for modeling the evolution of social behavior in structured populations. Most of the existing studies in this field have focused on 2-strategy games on heterogeneous networks or n-strategy games on regular networks. In this paper, we consider n-strategy games on arbitrary networks under the pairwise comparison updating rule. We show that under the limit of weak selection, the short-run behavior of the stochastic evolutionary process can be approximated by replicator equations with a transformed payoff matrix that involves both the average value and the variance of the degree distribution. In particular, strongly heterogeneous networks can facilitate the evolution of the payoff-dominant strategy. We then apply our results to analyze the evolutionarily stable strategies in an n-strategy minimum-effort game and two variants of the prisoner's dilemma game. We show that the cooperative equilibrium becomes evolutionarily stable when the average degree of the network is low and the variance of the degree distribution is high. Agent-based simulations on quasi-regular, exponential, and scale-free networks confirm that the dynamic behaviors of the stochastic evolutionary process can be well approximated by the trajectories of the replicator equations.

Social dilemma for 30 years: Progress, framework, and future based on CiteSpace analysis

Social dilemmas have been a popular research topic in the past 30 years, yet there is still a lack of interdisciplinary reviews. This study represents the first attempt to conduct a bibliometric analysis of social dilemma research over the past 30 years, aiming to identify the research status, research hotspots, and future trends in this domain. We conduct an interdisciplinary analysis of 3630 articles from 1993 to 2023 using CiteSpace software. We find that: (1) this research domain exhibits a fluctuating upward trend and possesses evident interdisciplinary characteristics. (2) Collaboration among authors, institutional and regional, is much more prevalent, especially in the evolutionary dynamics of human behavior, cooperation, and reinforcement learning. (3) The current hot trend in this field of research is to investigate the influencing factors and solutions for social dilemmas. Researchers have shown great interest in value orientation, social norms, fairness, punishment, and rewards in promoting cooperation. (4) In the future, this field will cover different disciplines, develop theoretical frameworks grounded in bounded rationality, explore the boundary conditions of effective strategies, and integrate emerging technologies. This study serves as a valuable reference for scholars seeking to navigate social dilemma research while also providing insights for managers aiming to devise practical solutions to social dilemmas.

Density amplifiers of cooperation for spatial games

Spatial games provide a simple and elegant mathematical model to study the evolution of cooperation in networks. In spatial games, individuals reside in vertices, adopt simple strategies, and interact with neighbors to receive a payoff. Depending on their own and neighbors' payoffs, individuals can change their strategy. The payoff is determined by the Prisoners' Dilemma, a classical matrix game, where players cooperate or defect. While cooperation is the desired behavior, defection provides a higher payoff for a selfish individual. There are many theoretical and empirical studies related to the role of the network in the evolution of cooperation. However, the fundamental question of whether there exist networks that for low initial cooperation rate ensure a high chance of fixation, i.e., cooperation spreads across the whole population, has remained elusive for spatial games with strong selection. In this work, we answer this fundamental question in the affirmative by presenting network structures that ensure high fixation probability for cooperators in the strong selection regime. Besides, our structures have many desirable properties: (a) they ensure the spread of cooperation even for a low initial density of cooperation and high temptation of defection, (b) they have constant degrees, and (c) the number of steps, until cooperation spreads, is at most quadratic in the size of the network.

Social learning with complex contagion

Traditional models of social learning by imitation are based on simple contagion-where an individual may imitate a more successful neighbor following a single interaction. But real-world contagion processes are often complex, meaning that multiple exposures may be required before an individual considers changing their type. We introduce a framework that combines the concepts of simple payoff-biased imitation with complex contagion, to describe how social behaviors spread through a population. We formulate this model as a discrete time and state stochastic process in a finite population, and we derive its continuum limit as an ordinary differential equation that generalizes the replicator equation, a widely used dynamical model in evolutionary game theory. When applied to linear frequency-dependent games, social learning with complex contagion produces qualitatively different outcomes than traditional imitation dynamics: it can shift the Prisoner's Dilemma from a unique all-defector equilibrium to either a stable mixture of cooperators and defectors in the population, or a bistable system; it changes the Snowdrift game from a single to a bistable equilibrium; and it can alter the Coordination game from bistability at the boundaries to two internal equilibria. The long-term outcome depends on the balance between the complexity of the contagion process and the strength of selection that biases imitation toward more successful types. Our analysis intercalates the fields of evolutionary game theory with complex contagions, and it provides a synthetic framework to describe more realistic forms of behavioral change in social systems.

Value-behavior inconsistency is robust to promote cooperative behavior in structured populations

The evolution of cooperation is a theme commonly studied in biology, psychology, sociology, and economics. Mechanisms that promote cooperative behavior in structured populations have been intensively studied. However, individuals' values, specifically, their opinions have been rarely taken into account so far. Inspired by cognition dissonance theory, we assume that individuals pay the cost of guiltiness if the behavior is defection but the opinion deviates from defection, and pay the cost of regret if the behavior is cooperation but the opinion deviates from cooperation. For all general stochastic evolutionary dynamics on arbitrary static networks with multiple opinions, we prove in the weak selection limit that: (i) value-behavior inconsistency cost promotes cooperative behavior if and only if the average cost of regret is less than that of guiltiness; (ii) individuals with value-behavior consistency are more abundant than that with value-behavior inconsistency. This is in contrast with other mechanisms that are at work for cooperation for one population structure but not others. Furthermore, it is also validated on an empirical network and for non-weak selection intensity. The value-behavior inconsistency is thus a robust mechanism to promote cooperative behavior in structured populations. Our results shed light on the importance of the co-evolutionary dynamics of opinion and behavior, which opens an avenue for cooperation.

Evolutionary dynamics of stochastic games in set-structured populations

In structured populations, the ecology of games may vary over neighborhoods. The effect of the ecological variations on population dynamics remains largely unknown. We here incorporate the ecological variations into the set-structured populations to explore the coevolutionary dynamics of the ecology and cooperation. Individuals of a population are distributed over sets. Interactions occur in the form of evolutionary games. When two individuals share more common sets, they play the weak prisoner's dilemma. Otherwise, they play the strong prisoner's dilemma. Both the set memberships and the strategy update in the evolutionary process. Changes in set memberships hold sway over the games to be played, which, in turn, influences the performance of strategies. Combining evolutionary set theory and random walks on graphs, we derived the conditions for cooperation to be selected under the weak selection limit. We find that a denser set-structured population increases the probability of individuals participating in a weak prisoner's dilemma, and thereby promoting the spread of cooperation. Properly modulating the population structure and the payoff feedback can further lower the critical benefit-cost ratio required for cooperation to be selected. Our results may help better understand the effects of ecological variations in enhancing cooperative behavior in set-structured populations.

Competition for resources can reshape the evolutionary properties of spatial structure

Many evolving ecosystems have spatial structures that can be conceptualized as networks, with nodes representing individuals or homogeneous subpopulations and links the patterns of spread between them. Prior models of evolution on networks do not take ecological niche differences and eco-evolutionary interplay into account. Here, we combine a resource competition model with evolutionary graph theory to study how heterogeneous topological structure shapes evolutionary dynamics under global frequency-dependent ecological interactions. We find that the addition of ecological competition for resources can produce a reversal of roles between amplifier and suppressor networks for deleterious mutants entering the population. We show that this effect is a nonlinear function of ecological niche overlap and discuss intuition for the observed dynamics using simulations and analytical approximations. We use these theoretical results together with spatial representations from imaging data to show that, for ductal carcinoma, where tumor growth is highly spatially constrained, with cells confined to a tree-like network of ducts, the topological structure can lead to higher rates of deleterious mutant hitchhiking with metabolic driver mutations, compared to tumors characterized by different spatial topologies.

Spontaneous symmetry breaking of cooperation between species

In mutualistic associations, two species cooperate by exchanging goods or services with members of another species for their mutual benefit. At the same time, competition for reproduction primarily continues with members of their own species. In intra-species interactions, the prisoner's dilemma is the leading mathematical metaphor to study the evolution of cooperation. Here we consider inter-species interactions in the spatial prisoner's dilemma, where members of each species reside on one lattice layer. Cooperators provide benefits to neighbouring members of the other species at a cost to themselves. Hence, interactions occur across layers but competition remains within layers. We show that rich and complex dynamics unfold when varying the cost-to-benefit ratio of cooperation, r. Four distinct dynamical domains emerge that are separated by critical phase transitions, each characterized by diverging fluctuations in the frequency of cooperation: (i) for large r cooperation is too costly and defection dominates; (ii) for lower r cooperators survive at equal frequencies in both species; (iii) lowering r further results in an intriguing, spontaneous symmetry breaking of cooperation between species with increasing asymmetry for decreasing r; (iv) finally, for small r, bursts of mutual defection appear that increase in size with decreasing r and eventually drive the populations into absorbing states. Typically, one species is cooperating and the other defecting and hence establish perfect asymmetry. Intriguingly and despite the symmetrical model set-up, natural selection can nevertheless favour the spontaneous emergence of asymmetric evolutionary outcomes where, on average, one species exploits the other in a dynamical equilibrium.

Temporal interaction and its role in the evolution of cooperation

This research investigates the impact of dynamic, time-varying interactions on cooperative behavior in social dilemmas. Traditional research has focused on deterministic rules governing pairwise interactions, yet the impact of interaction frequency and synchronization in groups on cooperation remains underexplored. Addressing this gap, our work introduces two temporal interaction mechanisms to model the stochastic or periodic participation of individuals in public goods games, acknowledging real-life variances due to exogenous temporal factors and geographical time differences. We consider that the interaction state significantly influences both game payoff calculations and the strategy updating process, offering new insights into the emergence and sustainability of cooperation. Our results indicate that maximum game participation frequency is suboptimal under a stochastic interaction mechanism. Instead, an intermediate activation probability maximizes cooperation, suggesting a vital balance between interaction frequency and inactivity security. Furthermore, local synchronization of interactions within specific areas is shown to be beneficial, as time differences hinder the spread of cross-structures but promote the formation of dense cooperative clusters with smoother boundaries. We also note that stronger clustering in networks, larger group sizes, and lower noise increase cooperation. This research contributes to understanding the role of node-based temporality and probabilistic interactions in social dilemmas, offering insights into fostering cooperation.

Persistence in repeated games encourages the evolution of spite

Social behavior is divided into four types: altruism, spite, mutualism, and selfishness. The former two are costly to the actor; therefore, from the perspective of natural selection, their existence can be regarded as mysterious. One potential setup which encourages the evolution of altruism and spite is repeated interaction. Players can behave conditionally based on their opponent's previous actions in the repeated interaction. On the one hand, the retaliatory strategy (who behaves altruistically when their opponent behaved altruistically and behaves non-altruistically when the opponent player behaved non-altruistically) is likely to evolve when players choose altruistic or selfish behavior in each round. On the other hand, the anti-retaliatory strategy (who is spiteful when the opponent was not spiteful and is not spiteful when the opponent player was spiteful) is likely to evolve when players opt for spiteful or mutualistic behavior in each round. These successful conditional behaviors can be favored by natural selection. Here, we notice that information on opponent players' actions is not always available. When there is no such information, players cannot determine their behavior according to their opponent's action. By investigating the case of altruism, a previous study (Kurokawa, 2017, Mathematical Biosciences, 286, 94-103) found that persistent altruistic strategies, which choose the same action as the own previous action, are favored by natural selection. How, then, should a spiteful conditional strategy behave when the player does not know what their opponent did? By studying the repeated game, we find that persistent spiteful strategies, which choose the same action as the own previous action, are favored by natural selection. Altruism and spite differ concerning whether retaliatory or anti-retaliatory strategies are favored by natural selection; however, they are identical concerning whether persistent strategies are favored by natural selection.

The coalescent in finite populations with arbitrary, fixed structure

The coalescent is a stochastic process representing ancestral lineages in a population undergoing neutral genetic drift. Originally defined for a well-mixed population, the coalescent has been adapted in various ways to accommodate spatial, age, and class structure, along with other features of real-world populations. To further extend the range of population structures to which coalescent theory applies, we formulate a coalescent process for a broad class of neutral drift models with arbitrary - but fixed - spatial, age, sex, and class structure, haploid or diploid genetics, and any fixed mating pattern. Here, the coalescent is represented as a random sequence of mappings [Formula: see text] from a finite set G to itself. The set G represents the "sites" (in individuals, in particular locations and/or classes) at which these alleles can live. The state of the coalescent, Ct:G→G, maps each site g∈G to the site containing g's ancestor, t time-steps into the past. Using this representation, we define and analyze coalescence time, coalescence branch length, mutations prior to coalescence, and stationary probabilities of identity-by-descent and identity-by-state. For low mutation, we provide a recipe for computing identity-by-descent and identity-by-state probabilities via the coalescent. Applying our results to a diploid population with arbitrary sex ratio r, we find that measures of genetic dissimilarity, among any set of sites, are scaled by 4r(1-r) relative to the even sex ratio case.

The rules of multiplayer cooperation in networks of communities

Community organisation permeates both social and biological complex systems. To study its interplay with behaviour emergence, we model mobile structured populations with multiplayer interactions. We derive general analytical methods for evolutionary dynamics under high home fidelity when populations self-organise into networks of asymptotically isolated communities. In this limit, community organisation dominates over the network structure and emerging behaviour is independent of network topology. We obtain the rules of multiplayer cooperation in networks of communities for different types of social dilemmas. The success of cooperation is a result of the benefits shared among communal cooperators outperforming the benefits reaped by defectors in mixed communities. Under weak selection, cooperation can evolve and be stable for any size (Q) and number (M) of communities if the reward-to-cost ratio (V/K) of public goods is higher than a critical value. Community organisation is a solid mechanism for sustaining the evolution of cooperation under public goods dilemmas, particularly when populations are organised into a higher number of smaller communities. Contrary to public goods dilemmas relating to production, the multiplayer Hawk-Dove (HD) dilemma is a commons dilemma focusing on the fair consumption of preexisting resources. This game yields mixed results but tends to favour cooperation under larger communities, highlighting that the two types of social dilemmas might lead to solid differences in the behaviour adopted under community structure.

The evolution of social behaviors and risk preferences in settings with uncertainty

Humans update their social behavior in response to past experiences and changing environments. Behavioral decisions are further complicated by uncertainty in the outcome of social interactions. Faced with uncertainty, some individuals exhibit risk aversion while others seek risk. Attitudes toward risk may depend on socioeconomic status; and individuals may update their risk preferences over time, which will feedback on their social behavior. Here, we study how uncertainty and risk preferences shape the evolution of social behaviors. We extend the game-theoretic framework for behavioral evolution to incorporate uncertainty about payoffs and variation in how individuals respond to this uncertainty. We find that different attitudes toward risk can substantially alter behavior and long-term outcomes, as individuals seek to optimize their rewards from social interactions. In a standard setting without risk, for example, defection always overtakes a well-mixed population engaged in the classic Prisoner's Dilemma, whereas risk aversion can reverse the direction of evolution, promoting cooperation over defection. When individuals update their risk preferences along with their strategic behaviors, a population can oscillate between periods dominated by risk-averse cooperators and periods of risk-seeking defectors. Our analysis provides a systematic account of how risk preferences modulate, and even coevolve with, behavior in an uncertain social world.

Fixation times on directed graphs

Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate r which invades a population of residents. We say that the fixation time is "fast" if it is at most a polynomial function in terms of the population size N. Here we study fixation times of advantageous mutants (r > 1) and neutral mutants (r = 1) on directed graphs, which are those graphs that have at least some one-way connections. We obtain three main results. First, we prove that for any directed graph the fixation time is fast, provided that r is sufficiently large. Second, we construct an efficient algorithm that gives an upper bound for the fixation time for any graph and any r ≥ 1. Third, we identify a broad class of directed graphs with fast fixation times for any r ≥ 1. This class includes previously studied amplifiers of selection, such as Superstars and Metafunnels. We also show that on some graphs the fixation time is not a monotonically declining function of r; in particular, neutral fixation can occur faster than fixation for small selective advantages.

Evolutionary dynamics of any multiplayer game on regular graphs

Multiplayer games on graphs are at the heart of theoretical descriptions of key evolutionary processes that govern vital social and natural systems. However, a comprehensive theoretical framework for solving multiplayer games with an arbitrary number of strategies on graphs is still missing. Here, we solve this by drawing an analogy with the Balls-and-Boxes problem, based on which we show that the local configuration of multiplayer games on graphs is equivalent to distributing k identical co-players among n distinct strategies. We use this to derive the replicator equation for any n-strategy multiplayer game under weak selection, which can be solved in polynomial time. As an example, we revisit the second-order free-riding problem, where costly punishment cannot truly resolve social dilemmas in a well-mixed population. Yet, in structured populations, we derive an accurate threshold for the punishment strength, beyond which punishment can either lead to the extinction of defection or transform the system into a rock-paper-scissors-like cycle. The analytical solution also qualitatively agrees with the phase diagrams that were previously obtained for non-marginal selection strengths. Our framework thus allows an exploration of any multi-strategy multiplayer game on regular graphs.

Tale of two emergent games: Opinion dynamics in dynamical directed networks

Unidirectional social interactions are ubiquitous in real social networks whereas undirected interactions are intensively studied. We establish a voter model in a dynamical directed network. We analytically obtain the degree distribution of the evolving network at any given time. Furthermore, we find that the average degree is captured by an emergent game. However, we find that the fate of opinions is captured by another emergent game. Beyond expectation, the two emergent games are typically different due to the unidirectionality of the evolving networks. The Nash equilibrium analysis of the two games facilitates us to give the criterion under which the minority opinion with few disciples initially takes over the population eventually for in-group bias. Our work fosters the understanding of opinion dynamics ranging from methodology to research content.

A theory of evolutionary dynamics on any complex population structure reveals stem cell niche architecture as a spatial suppressor of selection

How the spatial arrangement of a population shapes its evolutionary dynamics has been of long-standing interest in population genetics. Most previous studies assume a small number of demes or symmetrical structures that, most often, act as well-mixed populations. Other studies use network theory to study more heterogeneous spatial structures, however they usually assume small, regular networks, or strong constraints on the strength of selection considered. Here we build network generation algorithms, conduct evolutionary simulations and derive general analytic approximations for probabilities of fixation in populations with complex spatial structure. We build a unifying evolutionary theory across network families and derive the relevant selective parameter, which is a combination of network statistics, predictive of evolutionary dynamics. We also illustrate how to link this theory with novel datasets of spatial organization and use recent imaging data to build the cellular spatial networks of the stem cell niches of the bone marrow. Across a wide variety of parameters, we find these networks to be strong suppressors of selection, delaying mutation accumulation in this tissue. We also find that decreases in stem cell population size also decrease the suppression strength of the tissue spatial structure.

Deterministic theory of evolutionary games on temporal networks

Recent empirical studies have revealed that social interactions among agents in realistic networks merely exist intermittently and occur in a particular sequential order. However, it remains unexplored how to theoretically describe evolutionary dynamics of multiple strategies on temporal networks. Herein, we develop a deterministic theory for studying evolutionary dynamics of any [Formula: see text] pairwise games in structured populations where individuals are connected and organized by temporally activated edges. In the limit of weak selection, we derive replicator-like equations with a transformed payoff matrix characterizing how the mean frequency of each strategy varies over time, and then obtain critical conditions for any strategy to be evolutionarily stable on temporal networks. Interestingly, the re-scaled payoff matrix is a linear combination of the original payoff matrix with an additional one describing local competitions between any pair of different strategies, whose weights are solely determined by network topology and selection intensity. As a particular example, we apply the deterministic theory to analysing the impacts of temporal networks in the mini-ultimatum game, and find that temporally networked population structures result in the emergence of fairness. Our work offers theoretical insights into the subtle effects of network temporality on evolutionary game dynamics.

Modeling spatial evolution of multi-drug resistance under drug environmental gradients

Multi-drug combinations to treat bacterial populations are at the forefront of approaches for infection control and prevention of antibiotic resistance. Although the evolution of antibiotic resistance has been theoretically studied with mathematical population dynamics models, extensions to spatial dynamics remain rare in the literature, including in particular spatial evolution of multi-drug resistance. In this study, we propose a reaction-diffusion system that describes the multi-drug evolution of bacteria based on a drug-concentration rescaling approach. We show how the resistance to drugs in space, and the consequent adaptation of growth rate, is governed by a Price equation with diffusion, integrating features of drug interactions and collateral resistances or sensitivities to the drugs. We study spatial versions of the model where the distribution of drugs is homogeneous across space, and where the drugs vary environmentally in a piecewise-constant, linear and nonlinear manner. Although in many evolution models, per capita growth rate is a natural surrogate for fitness, in spatially-extended, potentially heterogeneous habitats, fitness is an emergent property that potentially reflects additional complexities, from boundary conditions to the specific spatial variation of growth rates. Applying concepts from perturbation theory and reaction-diffusion equations, we propose an analytical metric for characterization of average mutant fitness in the spatial system based on the principal eigenvalue of our linear problem, λ1. This enables an accurate translation from drug spatial gradients and mutant antibiotic susceptibility traits to the relative advantage of each mutant across the environment. Our approach allows one to predict the precise outcomes of selection among mutants over space, ultimately from comparing their λ1 values, which encode a critical interplay between growth functions, movement traits, habitat size and boundary conditions. Such mathematical understanding opens new avenues for multi-drug therapeutic optimization.

Explosive Cooperation in Social Dilemmas on Higher-Order Networks

Understanding how cooperative behaviors can emerge from competitive interactions is an open problem in biology and social sciences. While interactions are usually modeled as pairwise networks, the units of many real-world systems can also interact in groups of three or more. Here, we introduce a general framework to extend pairwise games to higher-order networks. By studying social dilemmas on hypergraphs with a tunable structure, we find an explosive transition to cooperation triggered by a critical number of higher-order games. The associated bistable regime implies that an initial critical mass of cooperators is also required for the emergence of prosocial behavior. Our results show that higher-order interactions provide a novel explanation for the survival of cooperation.

Competition for resources can reshape the evolutionary properties of spatial structure

Many evolving ecosystems have spatial structures that can be conceptualized as networks, with nodes representing individuals or homogeneous subpopulations and links the patterns of interaction and replacement between them. Prior models of evolution on networks do not take ecological niche differences and eco-evolutionary interplay into account. Here, we combine a resource competition model with evolutionary graph theory to study how heterogeneous topological structure shapes evolutionary dynamics under global frequency-dependent ecological interactions. We find that the addition of ecological competition for resources can produce a reversal of roles between amplifier and suppressor networks for deleterious mutants entering the population. Moreover, we show that this effect is a non-linear function of ecological niche overlap and discuss intuition for the observed dynamics using simulations and analytical approximations.

Dynamics of collective cooperation under personalised strategy updates

Collective cooperation is essential for many social and biological systems, yet understanding how it evolves remains a challenge. Previous investigations report that the ubiquitous heterogeneous individual connections hinder cooperation by assuming individuals update strategies at identical rates. Here we develop a general framework by allowing individuals to update strategies at personalised rates, and provide the precise mathematical condition under which universal cooperation is favoured. Combining analytical and numerical calculations on synthetic and empirical networks, we find that when individuals' update rates vary inversely with their number of connections, heterogeneous connections actually outperform homogeneous ones in promoting cooperation. This surprising property undercuts the conventional wisdom that heterogeneous structure is generally antagonistic to cooperation and, further helps develop an efficient algorithm OptUpRat to optimise collective cooperation by designing individuals' update rates in any population structure. Our findings provide a unifying framework to understand the interplay between structural heterogeneity, behavioural rhythms, and cooperation.

Strategy evolution on higher-order networks

Cooperation is key to prosperity in human societies. Population structure is well understood as a catalyst for cooperation, where research has focused on pairwise interactions. But cooperative behaviors are not simply dyadic, and they often involve coordinated behavior in larger groups. Here we develop a framework to study the evolution of behavioral strategies in higher-order population structures, which include pairwise and multi-way interactions. We provide an analytical treatment of when cooperation will be favored by higher-order interactions, accounting for arbitrary spatial heterogeneity and nonlinear rewards for cooperation in larger groups. Our results indicate that higher-order interactions can act to promote the evolution of cooperation across a broad range of networks, in public goods games. Higher-order interactions consistently provide an advantage for cooperation when interaction hyper-networks feature multiple conjoined communities. Our analysis provides a systematic account of how higher-order interactions modulate the evolution of prosocial traits.

Nonlinear social evolution and the emergence of collective action

Organisms from microbes to humans engage in a variety of social behaviors, which affect fitness in complex, often nonlinear ways. The question of how these behaviors evolve has consequences ranging from antibiotic resistance to human origins. However, evolution with nonlinear social interactions is challenging to model mathematically, especially in combination with spatial, group, and/or kin assortment. We derive a mathematical condition for natural selection with synergistic interactions among any number of individuals. This result applies to populations with arbitrary (but fixed) spatial or network structure, group subdivision, and/or mating patterns. In this condition, nonlinear fitness effects are ascribed to collectives, and weighted by a new measure of collective relatedness. For weak selection, this condition can be systematically evaluated by computing branch lengths of ancestral trees. We apply this condition to pairwise games between diploid relatives, and to dilemmas of collective help or harm among siblings and on spatial networks. Our work provides a rigorous basis for extending the notion of "actor", in the study of social evolution, from individuals to collectives.

Can institutions foster cooperation by wealth redistribution?

Theoretical models prescribe how institutions can promote cooperation in a population by imposing appropriate punishments or rewards on individuals. However, many real-world institutions are not sophisticated or responsive enough to ensure cooperation by calibrating their policies. Or, worse yet, an institution might selfishly exploit the population it governs for its own benefit. Here, we study the evolution of cooperation in the presence of an institution that is autonomous, in the sense that it has its own interests that may or may not align with those of the population. The institution imposes a tax on the population and redistributes a portion of the tax revenue to cooperators, withholding the remaining revenue for itself. The institution adjusts its rates of taxation and redistribution to optimize its own long-term, discounted utility. We consider three types of institutions with different goals, embodied in their utility functions. We show that a prosocial institution, whose goal is to maximize the average payoff of the population, can indeed promote cooperation-but only if it is sufficiently forward-looking. On the other hand, an institution that seeks to maximize welfare among cooperators alone will successfully promote collective cooperation even if it is myopic. Remarkably, even a selfish institution, which seeks to maximize the revenue it withholds for itself, can nonetheless promote cooperation. The average payoff of the population increases when a selfish institution is more forward-looking, so that a population under a selfish regime can sometimes fare better than under anarchy. Our analysis highlights the potential benefits of institutional wealth redistribution, even when an institution does not share the interests of the population it governs.

Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating

Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network. Whether or not a network is an amplifier depends on the choice of the random process that governs the evolutionary dynamics. Two popular choices are Moran process with Birth-death updating and Moran process with death-Birth updating. Interestingly, while some networks are amplifiers under Birth-death updating and other networks are amplifiers under death-Birth updating, so far no spatial structures have been found that function as an amplifier under both types of updating simultaneously. In this work, we identify networks that act as amplifiers of selection under both versions of the Moran process. The amplifiers are robust, modular, and increase fixation probability for any mutant fitness advantage in a range r ∈ (1, 1.2). To complement this positive result, we also prove that for certain quantities closely related to fixation probability, it is impossible to improve them simultaneously for both versions of the Moran process. Together, our results highlight how the two versions of the Moran process differ and what they have in common.

Genetic Diversity and DNA Barcoding of Thrips in Bangladesh

Thrips are economically important pests, and some species transmit plant viruses that are widely distributed and can damage vegetables and cash crops. Although few studies on thrips species have been conducted in Bangladesh, the variation and genetic diversity of thrips species remain unknown. In this study, we collected thrips samples from 16 geographical locations throughout the country and determined the nucleotide sequences of the mitochondrial cytochrome c oxidase subunit 1 (mtCOI) gene in 207 thrips individuals. Phylogenetic analysis revealed ten genera (Thrips, Haplothrips, Megalothrips, Scirtothrips, Frankliniella, Dendrothripoides, Astrothrips, Microcephalothrips, Ayyaria, and Bathrips) and 19 species of thrips to inhabit Bangladesh. Among these, ten species had not been previously reported in Bangladesh. Intraspecific genetic variation was diverse for each species. Notably, Thrips palmi was the most genetically diverse species, containing 14 haplotypes. The Mantel test revealed no correlation between genetic and geographical distances. This study revealed that thrips species are expanding their host ranges and geographical distributions, which provides valuable insights into monitoring the diversity of and control strategies for these pests.

Linked selection and the evolution of altruism in family-structured populations

Much research on the evolution of altruism via kin selection, group selection, and reciprocity focuses on the role of a single locus or quantitative trait. Very few studies have explored how linked selection, or selection at loci neighboring an altruism locus, impacts the evolution of altruism. While linked selection can decrease the efficacy of selection at neighboring loci, it might have other effects including promoting selection for altruism by increasing relatedness in regions of low recombination. Here, we used population genetic simulations to study how negative selection at linked loci, or background selection, affects the evolution of altruism. When altruism occurs between full siblings, we found that background selection interfered with selection on the altruistic allele, increasing its fixation probability when the altruistic allele was disfavored and reducing its fixation when the allele was favored. In other words, background selection has the same effect on altruistic genes in family-structured populations as it does on other, nonsocial, genes. This contrasts with prior research showing that linked selective sweeps can favor the evolution of cooperation, and we discuss possibilities for resolving these contrasting results.

Hamming distance as a measure of spatial chaos in evolutionary games

From a context of evolutionary dynamics, social games can be studied as complex systems that may converge to a Nash equilibrium. Nonetheless, they can behave in an unpredictable manner when looking at the spatial patterns formed by the agents' strategies. This is known in the literature as spatial chaos. In this paper we analyze the problem for a deterministic prisoner's dilemma and a public goods game and calculate the Hamming distance that separates two solutions that start at very similar initial conditions for both cases. The rapid growth of this distance indicates the high sensitivity to initial conditions, which is a well-known indicator of chaotic dynamics.

Imitation dynamics on networks with incomplete information

Imitation is an important learning heuristic in animal and human societies. Previous explorations report that the fate of individuals with cooperative strategies is sensitive to the protocol of imitation, leading to a conundrum about how different styles of imitation quantitatively impact the evolution of cooperation. Here, we take a different perspective on the personal and external social information required by imitation. We develop a general model of imitation dynamics with incomplete information in networked systems, which unifies classical update rules including the death-birth and pairwise-comparison rule on complex networks. Under pairwise interactions, we find that collective cooperation is most promoted if individuals neglect personal information. If personal information is considered, cooperators evolve more readily with more external information. Intriguingly, when interactions take place in groups on networks with low degrees of clustering, using more personal and less external information better facilitates cooperation. Our unifying perspective uncovers intuition by examining the rate and range of competition induced by different information situations.

Modeling spatial evolution of multi-drug resistance under drug environmental gradients

Multi-drug combinations to treat bacterial populations are at the forefront of approaches for infection control and prevention of antibiotic resistance. Although the evolution of antibiotic resistance has been theoretically studied with mathematical population dynamics models, extensions to spatial dynamics remain rare in the literature, including in particular spatial evolution of multi-drug resistance. In this study, we propose a reaction-diffusion system that describes the multi-drug evolution of bacteria, based on a rescaling approach (Gjini and Wood, 2021). We show how the resistance to drugs in space, and the consequent adaptation of growth rate is governed by a Price equation with diffusion. The covariance terms in this equation integrate features of drug interactions and collateral resistances or sensitivities to the drugs. We study spatial versions of the model where the distribution of drugs is homogeneous across space, and where the drugs vary environmentally in a piecewise-constant, linear and nonlinear manner. Applying concepts from perturbation theory and reaction-diffusion equations, we propose an analytical characterization of average mutant fitness in the spatial system based on the principal eigenvalue of our linear problem. This enables an accurate translation from drug spatial gradients and mutant antibiotic susceptibility traits, to the relative advantage of each mutant across the environment. Such a mathematical understanding allows to predict the precise outcomes of selection over space, ultimately from the fundamental balance between growth and movement traits, and their diversity in a population.

Vacancies in growing habitats promote the evolution of cooperation

We study evolutionary game dynamics in a growing habitat with vacancies. Fitness is determined by the global effect of the environment and a local prisoner's dilemma among neighbors. We study population growth on a one-dimensional lattice and analyze how the environment affects evolutionary competition. As the environment becomes harsh, an absorbing phase transition from growing populations to extinction occurs. The transition point depends on which strategies are present in the population. In particular, we find a 'cooperative window' in parameter space, where only cooperators can survive. A mutant defector in a cooperative community might briefly proliferate, but over time naturally occurring vacancies separate cooperators from defectors, thereby driving defectors to extinction. Our model reveals that vacancies provide a strong boost for cooperation by spatial selection.

Evolutionary dynamics of mutants that modify population structure

Natural selection is usually studied between mutants that differ in reproductive rate, but are subject to the same population structure. Here we explore how natural selection acts on mutants that have the same reproductive rate, but different population structures. In our framework, population structure is given by a graph that specifies where offspring can disperse. The invading mutant disperses offspring on a different graph than the resident wild-type. We find that more densely connected dispersal graphs tend to increase the invader's fixation probability, but the exact relationship between structure and fixation probability is subtle. We present three main results. First, we prove that if both invader and resident are on complete dispersal graphs, then removing a single edge in the invader's dispersal graph reduces its fixation probability. Second, we show that for certain island models higher invader's connectivity increases its fixation probability, but the magnitude of the effect depends on the exact layout of the connections. Third, we show that for lattices the effect of different connectivity is comparable to that of different fitness: for large population size, the invader's fixation probability is either constant or exponentially small, depending on whether it is more or less connected than the resident.

Symmetry in models of natural selection

Symmetry arguments are frequently used-often implicitly-in mathematical modelling of natural selection. Symmetry simplifies the analysis of models and reduces the number of distinct population states to be considered. Here, I introduce a formal definition of symmetry in mathematical models of natural selection. This definition applies to a broad class of models that satisfy a minimal set of assumptions, using a framework developed in previous works. In this framework, population structure is represented by a set of sites at which alleles can live, and transitions occur via replacement of some alleles by copies of others. A symmetry is defined as a permutation of sites that preserves probabilities of replacement and mutation. The symmetries of a given selection process form a group, which acts on population states in a way that preserves the Markov chain representing selection. Applying classical results on group actions, I formally characterize the use of symmetry to reduce the states of this Markov chain, and obtain bounds on the number of states in the reduced chain.

Evolution as a result of resource flow in ecosystems: Ecological dynamics can drive evolution

To see how the flow of energy across ecosystems can derive evolution, I introduce a framework in which individuals interact with their peers and environment to accumulate resources, and use the resources to pay for their metabolic costs, grow and reproduce. I show that two conservation principles determine the system's equilibrium state: conservation of resources- a physical principle stating that in the equilibrium, resource production and consumption should balance, and payoff equality- an economic principle, stating that the payoffs of different types in equilibrium should equal. Besides the equilibrium state, the system shows non-equilibrium fluctuations derived by the exponential growth of the individuals in which the payoff equality principle does not hold. A simple gradient-ascend dynamical mean-field equation predicts the onset of non-equilibrium fluctuations. As an example, I study the evolution of cooperation in public goods games. In both mixed and structured populations, cooperation evolves naturally in resource-poor environments but not in resource-rich environments. Population viscosity facilitates cooperation in poor environments but can be detrimental to cooperation in rich environments. In addition, cooperators and defectors show different life-history strategies: Cooperators live shorter lives and reproduce more than defectors. Both population structure and, more significantly, population viscosity reduce lifespan and life history differences between cooperators and defectors.

Aspiration-driven co-evolution of cooperation with individual behavioral diversity

In evolutionary game, aspiration-driven updates and imitation updates are the two dominant game models, and individual behavior patterns are mainly categorized into two types: node player and link player. In more recent studies, the mixture strategy of different types of players has been proven to improve cooperation substantially. Motivated by such a co-evolution mechanism, we combine aspiration dynamics with individual behavioral diversity, where self-assessed aspirations are used to update imitation strategies. In this study, the node players and the link players are capable to transform into each other autonomously, which introduces new features to cooperation in a diverse population as well. In addition, by driving all the players to form specific behavior patterns, the proposed mechanism achieves a survival environment optimization of the cooperators. As expected, the interaction between node players and link players allows the cooperator to avoid the invasion of the defector. Based on the experimental evaluation, the proposed work has demonstrated that the co-evolution mechanism has facilitated the emergence of cooperation by featuring mutual transformation between different players. We hope to inspire a new way of thinking for a promising solution to social dilemmas.

Strategy evolution on dynamic networks

Models of strategy evolution on static networks help us understand how population structure can promote the spread of traits like cooperation. One key mechanism is the formation of altruistic spatial clusters, where neighbors of a cooperative individual are likely to reciprocate, which protects prosocial traits from exploitation. However, most real-world interactions are ephemeral and subject to exogenous restructuring, so that social networks change over time. Strategic behavior on dynamic networks is difficult to study, and much less is known about the resulting evolutionary dynamics. Here we provide an analytical treatment of cooperation on dynamic networks, allowing for arbitrary spatial and temporal heterogeneity. We show that transitions among a large class of network structures can favor the spread of cooperation, even if each individual social network would inhibit cooperation when static. Furthermore, we show that spatial heterogeneity tends to inhibit cooperation, whereas temporal heterogeneity tends to promote it. Dynamic networks can have profound effects on the evolution of prosocial traits, even when individuals have no agency over network structures.

Impact of misinformation in the evolution of collective cooperation on networks

Human societies are organized and developed through collective cooperative behaviours. Based on the information in their environment, individuals can form collective cooperation by strategically changing unfavourable surroundings and imitating superior behaviours. However, facing the rampant proliferation and spreading of misinformation, we still lack systematic investigations into the impact of misinformation on the evolution of collective cooperation. Here, we study this problem by classical evolutionary game theory. We find that the existence of misinformation generally impedes the emergence of collective cooperation on networks, although the level of cooperation is slightly higher for weak social cooperative dilemma below a proven threshold. We further show that this possible advantage diminishes as social connections become denser, suggesting that the detrimental effect of misinformation further increases when 'social viscosity' is low. Our results uncover the quantitative effect of misinformation on suppressing collective cooperation, and pave the way for designing possible mechanisms to improve collective cooperation.

Fixation dynamics on hypergraphs

Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals. In the present study, we propose and analyze evolutionary dynamics on hypergraphs, in which each node takes one of the two types of different but constant fitness values. For the corresponding dynamics on conventional networks, under the birth-death process and uniform initial conditions, most networks are known to be amplifiers of natural selection; amplifiers by definition enhance the difference in the strength of the two competing types in terms of the probability that the mutant type fixates in the population. In contrast, we provide strong computational evidence that a majority of hypergraphs are suppressors of selection under the same conditions by combining theoretical and numerical analyses. We also show that this suppressing effect is not explained by one-mode projection, which is a standard method for expressing hypergraph data as a conventional network. Our results suggest that the modeling framework for structured populations in addition to the specific network structure is an important determinant of evolutionary dynamics, paving a way to studying fixation dynamics on higher-order networks including hypergraphs.

How can blockchain technology promote food safety in agricultural market?-an evolutionary game analysis

The governance of agricultural food safety issues is closely linked to social interests. To promote food safety supervision in the Chinese agricultural markets under the background of blockchain application, this paper develops a partnership comprising vendors, consumers, and the government. Using the theory of evolutionary game combined with the actual situation of China, the evolutionary process simulations of three participants prove that the tripartite subjects can realize a stable state under the specific relationship. Impact investigation results of typical influential factors indicate the following: (1) The behavior of vendors depends on the government's supervision and consumers' reporting attitude. Limiting the penalty amount for vendors to 66.7% of speculative gains can shorten the processing time for vendors to comply with the law. (2) Consumers play a vital role in food safety supervision of the agricultural market. The penalty for consumers should be limited to 1/3 of the reward amount. (3) The government's incentive-oriented and punishment-inhibited policies can promote blockchain technology in supervision. Punishment-inhibited and key influencing parameters can cooperate in obtaining the maximum regulatory benefits. The results of this study have certain reference values for promoting policy formulation and implementing blockchain technology in agricultural food safety supervision.

Evolutionary dynamics on sequential temporal networks

Population structure is a well-known catalyst for the evolution of cooperation and has traditionally been considered to be static in the course of evolution. Conversely, real-world populations, such as microbiome communities and online social networks, frequently show a progression from tiny, active groups to huge, stable communities, which is insufficient to be captured by constant structures. Here, we propose sequential temporal networks to characterize growing networked populations, and we extend the theory of evolutionary games to these temporal networks with arbitrary structures and growth rules. We derive analytical rules under which a sequential temporal network has a higher fixation probability for cooperation than its static counterpart. Under neutral drift, the rule is simply a function of the increment of nodes and edges in each time step. But if the selection is weak, the rule is related to coalescence times on networks. In this case, we propose a mean-field approximation to calculate fixation probabilities and critical benefit-to-cost ratios with lower calculation complexity. Numerical simulations in empirical datasets also prove the cooperation-promoting effect of population growth. Our research stresses the significance of population growth in the real world and provides a high-accuracy approximation approach for analyzing the evolution in real-life systems.

Perturbation theory for evolution of cooperation on networks

Network structure is a mechanism for promoting cooperation in social dilemma games. In the present study, we explore graph surgery, i.e., to slightly perturb the given network, towards a network that better fosters cooperation. To this end, we develop a perturbation theory to assess the change in the propensity of cooperation when we add or remove a single edge to/from the given network. Our perturbation theory is for a previously proposed random-walk-based theory that provides the threshold benefit-to-cost ratio, [Formula: see text], which is the value of the benefit-to-cost ratio in the donation game above which the cooperator is more likely to fixate than in a control case, for any finite networks. We find that [Formula: see text] decreases when we remove a single edge in a majority of cases and that our perturbation theory captures at a reasonable accuracy which edge removal makes [Formula: see text] small to facilitate cooperation. In contrast, [Formula: see text] tends to increase when we add an edge, and the perturbation theory is not good at predicting the edge addition that changes [Formula: see text] by a large amount. Our perturbation theory significantly reduces the computational complexity for calculating the outcome of graph surgery.