An extension of the Moran process using type-specific connection graphs



Melissourgos, Themistoklis, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2022) An extension of the Moran process using type-specific connection graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 124. pp. 77-96.

[img] Text
JCSSMoran2021.pdf - Author Accepted Manuscript

Download (692kB) | Preview

Abstract

The Moran process, as studied by Lieberman, Hauert and Nowak (2005) [1], is a birth-death process that models the spread of mutations in two-type populations (residents-mutants) whose structure is defined by a digraph. The process' central notion is the probability that a randomly placed mutant will occupy the whole vertex set (fixation probability). We extend this model by considering type-specific graphs, and consequently present results on the fundamental problems related to the fixation probability and its computation. Finally, we view the resident-mutant competing forces as players that choose digraphs and indicate that the mutant's complete graph is a dominant strategy.

Item Type: Article
Uncontrolled Keywords: Moran process, Fixation probability, Evolutionary dynamics
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 02 Aug 2021 10:17
Last Modified: 18 Jan 2023 21:35
DOI: 10.1016/j.jcss.2021.07.007
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3131307