Absorption time of the Moran process

The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to become extinct. It is known that the expected absorption time for an advantageous mutation is O(n^4) on an n-vertex undirected graph, which allows the behaviour of the process on undirected graphs to be analysed using the Markov chain Monte Carlo method. We show that this does not extend to directed graphs by exhibiting an infinite family of directed graphs for which the expected absorption time is exponential in the number of vertices. However, for regular directed graphs, we show that the expected absorption time is Omega(n log n) and O(n^2). We exhibit families of graphs matching these bounds and give improved bounds for other families of graphs, based on isoperimetric number. Our results are obtained via stochastic dominations which we demonstrate by establishing a coupling in a related continuous-time model. The coupling also implies several natural domination results regarding the fixation probability of the original (discrete-time) process, resolving a conjecture of Shakarian, Roos and Johnson.

[1]  L. A. Goldberg,et al.  Approximating Fixation Probabilities in the Generalized Moran Process , 2011, Algorithmica.

[2]  Paul G. Spirakis,et al.  On the fixation probability of superstars , 2013, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[3]  Rense Corten,et al.  Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction (Second Edition) by Herbert Gintis , 2009, J. Artif. Soc. Soc. Simul..

[4]  Sandip Roy,et al.  The influence model , 2001 .

[5]  Béla Bollobás,et al.  The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[6]  Eli Berger.  Dynamic Monopolies of Constant Size , 2001, J. Comb. Theory, Ser. B.

[7]  G. Grimmett,et al.  Probability and random processes , 2002 .

[8]  Rick Durrett,et al.  Some features of the spread of epidemics and information on a random graph , 2010, Proceedings of the National Academy of Sciences.

[9]  Paulo Shakarian,et al.  A review of evolutionary graph theory with applications to game theory , 2012, Biosyst..

[10]  Paul G. Spirakis,et al.  Natural models for evolution on networks , 2011, Theor. Comput. Sci..

[11]  Pei-Ai Zhang,et al.  FIXATION TIME FOR EVOLUTIONARY GRAPHS , 2010 .

[12]  Paul G. Spirakis,et al.  Approximating Fixation Probabilities in the Generalized Moran Process , 2011, Algorithmica.

[13]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[14]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[15]  Bahram Houchmandzadeh,et al.  The fixation probability of a beneficial mutation in a geographically structured population , 2011 .

[16]  Drew Fudenberg,et al.  Evolutionary game dynamics in finite populations , 2004, Bulletin of mathematical biology.

[17]  Paul G. Spirakis,et al.  Strong Bounds for Evolution in Networks , 2013, ICALP.

[18]  M. Broom,et al.  An analysis of the fixation probability of a mutant on special classes of non-directed graphs , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[19]  P. Buser.  Cubic graphs and the first eigenvalue of a Riemann surface , 1978 .

[20]  Christoph Hauert,et al.  Fixation probabilities on superstars, revisited and revised. , 2013, Journal of theoretical biology.

[21]  T. Liggett,et al.  Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .

[22]  P. Roos,et al.  Fast and deterministic computation of fixation probability in evolutionary graphs , 2011 .

[23]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[24]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[25]  M. Cemil Azizoglu,et al.  The bisection width and the isoperimetric number of arrays , 2004, Discret. Appl. Math..

[26]  P. A. P. Moran,et al.  Random processes in genetics , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[27]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[28]  Maria J. Serna,et al.  Absorption time of the Moran process , 2016, Random Struct. Algorithms.

[29]  Martin A. Nowak,et al.  Evolutionary dynamics on graphs , 2005, Nature.

[30]  M. Broom,et al.  Evolutionary games on graphs and the speed of the evolutionary process , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[31]  T. Antal,et al.  Fixation of Strategies for an Evolutionary Game in Finite Populations , 2005, Bulletin of mathematical biology.