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

Abstract

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

arXiv comment11 pages, 13 figures

References in corpus (15)

• Emergence of scaling in random networks
• Random graphs with arbitrary degree distributions and their applications
• Mean-field theory for scale-free random networks
• Voter Models on Heterogeneous Networks
• Fixation of strategies for an evolutionary game in finite populations
• Evolutionary dynamics on degree-heterogeneous graphs
• Most undirected random graphs are amplifiers of selection for Birth-death dynamics, but suppressors of selection for death-Birth dynamics
• Fixation probabilities in evolutionary dynamics under weak selection
• Counterintuitive properties of the fixation time in network-structured populations
• Limits on amplifiers of natural selection under death-Birth updating
• Reproductive Value in Graph-structured Populations
• Transient amplifiers of selection and reducers of fixation for death-Birth updating on graphs
• Approximating Fixation Probabilities in the Generalized Moran Process
• Fitness dependence of the fixation-time distribution for evolutionary dynamics on graphs
• Fast and asymptotic computation of the fixation probability for Moran processes on graphs