City Research Online

Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?

Pattni, K., Broom, M., Rychtar, J. & Silvers, L. J. (2015). Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 471(2182), article number 20150334. doi: 10.1098/rspa.2015.0334


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.

Publication Type: Article
Additional Information: Copyright The Royal Society 2015
Publisher Keywords: finite population, evolutionary dynamics, Moran process, fixation probability
Subjects: G Geography. Anthropology. Recreation > G Geography (General)
Q Science > QA Mathematics
Departments: School of Science & Technology > Mathematics
SWORD Depositor:
[thumbnail of PBRSFinal_Draft.pdf]
Text - Accepted Version
Download (442kB) | Preview


Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login