Living Reference Work Entry

Encyclopedia of Algorithms

pp 1-6

Date: Latest Version

Approximating Fixation Probabilities in the Generalized Moran Process

  • George B. MertziosAffiliated withSchool of Engineering and Computing Sciences Durham University Email author 


Evolutionary dynamics Moran process Fixation probability Markov-chain Monte Carlo Approximation algorithm

Years and Authors of Summarized Original Work

2014; Diaz, Goldberg, Mertzios, Richerby, Serna, Spirakis

Problem Definition

Population and evolutionary dynamics have been extensively studied, usually with the assumption that the evolving population has no spatial structure. One of the main models in this area is the Moran process [17]. The initial population contains a single “mutant” with fitness r > 0, with all other individuals having fitness 1. At each step of the process, an individual is chosen at random, with probability proportional to its fitness. This individual reproduces, replacing a second individual, chosen uniformly at random, with a copy of itself.

Lieberman, Hauert, and Nowak introduced a generalization of the Moran process, where the members of the population are placed on the vertices of a connected graph which is, in general, directed [13, 19]. In this model, the initial population again consists of a single mutant of fitness r > 0 placed on a vertex chosen uniformly at ...

This is an excerpt from the content