Publication Date:
2015-05-27
Description:
Evolutionary models on graphs, as an extension of the Moran process, have two major implementations: birth–death (BD) models (or the invasion process) and death–birth (DB) models (or voter models). The isothermal theorem states that the fixation probability of mutants in a large group of graph structures (known as isothermal graphs, which include regular graphs) coincides with that for the mixed population. This result has been proved by Lieberman et al. (2005 Nature 433, 312–316. ( doi:10.1038/nature03204 )) in the case of BD processes, where mutants differ from the wild-types by their birth rate (and not by their death rate). In this paper, we discuss to what extent the isothermal theorem can be formulated for DB processes, proving that it only holds for mutants that differ from the wild-type by their death rate (and not by their birth rate). For more general BD and DB processes with arbitrary birth and death rates of mutants, we show that the fixation probabilities of mutants are different from those obtained in the mass-action populations. We focus on spatial lattices and show that the difference between BD and DB processes on one- and two-dimensional lattices is non-small even for large population sizes. We support these results with a generating function approach that can be generalized to arbitrary graph structures. Finally, we discuss several biological applications of the results.
Keywords:
computational biology
Electronic ISSN:
2054-5703
Topics:
Natural Sciences in General
Permalink
