Strong bounds for evolution in networks
作者：
Highlights：
• We consider the fixation probability with respect to the initial mutant vertex.
• We aim in finding graphs with many “strong starts” or “weak starts” of the mutant.
• We introduce the notions of selective amplifiers and selective suppressors.
• We prove the existence of strong selective amplifiers and suppressors.
• We provide almost tight lower bounds for the fixation probability (Thermal Theorem).
摘要
•We consider the fixation probability with respect to the initial mutant vertex.•We aim in finding graphs with many “strong starts” or “weak starts” of the mutant.•We introduce the notions of selective amplifiers and selective suppressors.•We prove the existence of strong selective amplifiers and suppressors.•We provide almost tight lower bounds for the fixation probability (Thermal Theorem).
论文关键词：Evolutionary dynamics,Undirected graphs,Fixation probability,Lower bound,Markov chain
论文评审过程：Received 20 November 2014, Revised 23 November 2017, Accepted 27 April 2018, Available online 8 May 2018, Version of Record 13 August 2018.
论文官网地址：https://doi.org/10.1016/j.jcss.2018.04.004
