Back to Search
Start Over
Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?
- Publication Year :
- 2015
-
Abstract
- Evolution in finite populations is often modelled using the classical Moran process. Over the last 10 years, this methodology has been extended to structured populations using evolutionary graph theory. An important question in any such population is whether a rare mutant has a higher or lower chance of fixating (the fixation probability) than the Moran probability, i.e. that from the original Moran model, which represents an unstructured population. As evolutionary graph theory has developed, different ways of considering the interactions between individuals through a graph and an associated matrix of weights have been considered, as have a number of important dynamics. In this paper, we revisit the original paper on evolutionary graph theory in light of these extensions to consider these developments in an integrated way. In particular, we find general criteria for when an evolutionary graph with general weights satisfies the Moran probability for the set of six common evolutionary dynamics.
- Subjects :
- education.field_of_study
Theoretical computer science
General Mathematics
Population
General Engineering
General Physics and Astronomy
Combinatorics
Fixation (population genetics)
Evolutionary graph theory
G1
Moran process
Graph (abstract data type)
Quantitative Biology::Populations and Evolution
Evolutionary dynamics
education
QA
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 13645021
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....069a637d568c7a1cfe0a669616cb8f0f