Strong Bounds for Evolution in Networks



Mertzios, George and Spirakis, PG ORCID: 0000-0001-5396-3749
(2018) Strong Bounds for Evolution in Networks. Journal of Computer and System Sciences, 97. pp. 60-82.

[img] Text
Amplifiers-JCSS-2018.pdf - Author Accepted Manuscript

Download (504kB)

Abstract

This work studies the generalized Moran process, as introduced by Lieberman et al. (2005) [20]. We introduce the parameterized notions of selective amplifiers and selective suppressors of evolution, i.e. of networks (graphs) with many “strong starts” and many “weak starts” for the mutant, respectively. We first prove the existence of strong selective amplifiers and of (quite) strong selective suppressors. Furthermore we provide strong upper bounds and almost tight lower bounds (by proving the “Thermal Theorem”) for the traditional notion of fixation probability of Lieberman et al., i.e. assuming a random initial placement of the mutant.

Item Type: Article
Uncontrolled Keywords: Evolutionary dynamics, Undirected graphs, Fixation probability, Lower bound, Markov chain
Depositing User: Symplectic Admin
Date Deposited: 01 May 2018 15:07
Last Modified: 19 Jan 2023 06:34
DOI: 10.1016/j.jcss.2018.04.004
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3020808