title: Counterintuitive properties of the fixation time in network-structured populations.
abstract: Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type individuals. Remarkably, the fixation probability of a single mutant is the same on all regular networks. But non-regular networks can increase or decrease the fixation probability. While the time until fixation formally depends on the same transition probabilities as the fixation probabilities, there is no obvious relation between them. For example, an amplifier of selection, which increases the fixation probability and thus decreases the number of mutations needed until one of them is successful, can at the same time slow down the process of fixation. Based on small networks, we show analytically that (i) the time to fixation can decrease when links are removed from the network and (ii) the node providing the best starting conditions in terms of the shortest fixation time depends on the fitness of the mutant. Our results are obtained analytically on small networks, but numerical simulations show that they are qualitatively valid even in much larger populations.
authors.affiliation: Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, Plön, Germany.
authors.forename: Laura
authors.initials: L
authors.lastname: Hindersin
authors.affiliation: Department of Evolutionary Theory, Max Planck Institute for Evolutionary Biology, Plön, Germany traulsen@evolbio.mpg.de.
authors.forename: Arne
authors.initials: A
authors.lastname: Traulsen
mesh_terms: D005075:Biological Evolution; D003198:Computer Simulation; D005828:Genetics, Population; D008954:Models, Biological; D009154:Mutation / Q000235:genetics*; D012641:Selection, Genetic; D013997:Time Factors
keywords: evolution on static networks; evolutionary graph theory; fixation time