Abstract

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.

Highlights

  • The isothermal theorem states that the fixation probability of mutants in a large group of graph structures coincides with that for the mixed population. This result has been proved by Lieberman et al (2005 Nature 433, 312–316.) in the case of BD processes, where mutants differ from the wild-types by their birth rate

  • 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

  • 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

Read more

Summary

Summary

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). Another variation of BD models on a graph is considered by van Baalen & Rand [29], where each of the elementary events can be either a birth or a death or a migration (see [18,30]) It has been observed by Maruyama [3,4] and later generalized by Lieberman et al [5] that in the case of the BD process, selection dynamics are not affected by regular and symmetric structures (or more generally isothermal graphs). In this paper, we study the connection between DB and BD processes on spatial lattices and explore the extent to which the order of birth and death events influences the probability of mutant fixation.

Death–birth and birth–death processes on a graph
The complete network including ‘self’
The birth–death process
The death–birth process
Conclusions for the complete graph scenario
Exact results for fixation probability in one dimension
The death–birth model
Comparison of one-dimensional death–birth and birth–death processes
Comparing the birth–death and death–birth processes to each other
Neutrality of the mutants
Approximate results for fixation probability in two dimensions
Discussion
Mixed population in weak selection
Findings
Evolutionary graph models in weak selection
One-dimensional solutions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call