We study two of the simple rules on finite graphs under the deathbirth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502-505]. Each rule specifies a payoff-ratio cutoff point for the magnitude of fixation probabilities of the underlying evolutionary game between cooperators and defectors. We view the Markov chains associated with the two updating mechanisms as voter model perturbations. Then we present a first-order approximation for fixation probabilities of general voter model perturbations on finite graphs subject to small perturbation in terms of the voter model fixation probabilities. In the context of regular graphs, we obtain algebraically explicit firstorder approximations for the fixation probabilities of cooperators distributed as certain uniform distributions. These approximations lead to a rigorous proof that both of the rules of Ohtsuki et al. are valid and are sharp.
Population structure and spatial heterogeneity are integral components of evolutionary dynamics, in general, and of evolution of cooperation, in particular. Structure can promote the emergence of cooperation in some populations and suppress it in others. Here, we provide results for weak selection to favor cooperation on regular graphs for any configuration, meaning any arrangement of cooperators and defectors. Our results extend previous work on fixation probabilities of rare mutants. We find that for any configuration cooperation is never favored for birth-death (BD) updating. In contrast, for death-birth (DB) updating, we derive a simple, computationally tractable formula for weak selection to favor cooperation when starting from any configuration containing any number of cooperators. This formula elucidates two important features: (i) the takeover of cooperation can be enhanced by the strategic placement of cooperators and (ii) adding more cooperators to a configuration can sometimes suppress the evolution of cooperation. These findings give a formal account for how selection acts on all transient states that appear in evolutionary trajectories. They also inform the strategic design of initial states in social networks to maximally promote cooperation. We also derive general results that characterize the interaction of any two strategies, not only cooperation and defection.
We present an elementary model of random size varying population given by a stationary continuous state branching process. For this model we compute the joint distribution of: the time to the most recent common ancestor, the size of the current population and the size of the population just before the most recent common ancestor (MRCA). In particular we show a natural mild bottleneck effect as the size of the population just before the MRCA is stochastically smaller than the size of the current population. We also compute the number of old families which corresponds to the number of individuals involved in the last coalescent event of the genealogical tree. By studying more precisely the genealogical structure of the population, we get asymptotics for the number of ancestors just before the current time. We give explicit computations in the case of the quadratic branching mechanism. In this case, the size of the population at the MRCA is, in mean, less by 1/3 than size of the current population size. We also provide in this case the fluctuations for the renormalized number of ancestors
We study voter models defined on large sets. Through a perspective emphasizing the martingale property of voter density processes, we prove that in general, their convergence to the Wright-Fisher diffusion only involves certain averages of the voter models over a small number of spatial locations. This enables us to identify suitable mixing conditions on the underlying voting kernels, one of which may just depend on their eigenvalues in some contexts, to obtain the convergence of density processes. Our examples show that these conditions are satisfied by a large class of voter models on growing finite graphs.2000 Mathematics Subject Classification. Primary: 60K35, 82C22, Secondary: 60F05, 60J60.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.