2012/11/11 by George B. Mertzios, Mertzios, George B., Paul G. Spirakis +1
Mathematics · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #E.1 #Evolutionary Game Theory and Cooperation #FOS: Computer and information sciences #FOS: Mathematics #G.3 #Probability (math.PR) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.1211.2384
openalex publication_date 2012/11/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work studies the generalized Moran process, as introduced by Lieberman et al. [Nature, 433:312-316, 2005]. 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.