Approximating Fixation Probabilities in the Generalized Moran Process

We consider the Moran process, as generalized by Lieberman et al. (Nature 433:312–316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at random with probability proportional to its assigned “fitness” value. It reproduces, placing a copy of itself on a neighbouring vertex chosen uniformly at random, replacing the individual that was there. The initial population consists of a single mutant of fitness r>0 placed uniformly at random, with every other vertex occupied by an individual of fitness 1. The main quantities of interest are the probabilities that the descendants of the initial mutant come to occupy the whole graph (fixation) and that they die out (extinction); almost surely, these are the only possibilities. In general, exact computation of these quantities by standard Markov chain techniques requires solving a system of linear equations of size exponential in the order of the graph so is not feasible. We show that, with high probability, the number of steps needed to reach fixation or extinction is bounded by a polynomial in the number of vertices in the graph. This bound allows us to construct fully polynomial randomized approximation schemes (FPRAS) for the probability of fixation (when r≥1) and of extinction (for all r>0).

[1]  M. Broom,et al.  Two results on evolutionary processes on general non-directed graphs , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[2]  M. Nowak Evolutionary Dynamics: Exploring the Equations of Life , 2006 .

[3]  L. Imhof The long-run behavior of the stochastic replicator dynamics , 2005, math/0503529.

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

[5]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[6]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

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

[8]  Josef Hofbauer,et al.  Evolutionary Games and Population Dynamics , 1998 .

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

[10]  R. Rob,et al.  Learning, Mutation, and Long Run Equilibria in Games , 1993 .

[11]  Martin A Nowak,et al.  Evolutionary games on cycles , 2006, Proceedings of the Royal Society B: Biological Sciences.

[12]  Elchanan Mossel,et al.  Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..

[13]  R. Durrett Lecture notes on particle systems and percolation , 1988 .

[14]  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.

[15]  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.

[16]  Peter Secretan Learning , 1965, Mental Health.

[17]  Mark Broom,et al.  Evolutionary dynamics on small-order graphs , 2009 .

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

[19]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[21]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[22]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[23]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[24]  J. Neveu,et al.  Discrete Parameter Martingales , 1975 .

[25]  Dana Randall,et al.  Markov chain algorithms for planar lattice structures , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  J. Kingman A FIRST COURSE IN STOCHASTIC PROCESSES , 1967 .

[27]  E. Todeva Networks , 2007 .

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

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

[30]  B. Hajek Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[31]  T M Li Ge Te Interacting Particle Systems , 2013 .

[32]  Herbert Gintis,et al.  Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction - Second Edition , 2009 .

[33]  Stefan Grosskinsky Warwick,et al.  Interacting Particle Systems , 2016 .

[34]  M. Nowak,et al.  A symmetry of fixation times in evoultionary dynamics. , 2006, Journal of theoretical biology.

[35]  William H. Sandholm,et al.  Population Games And Evolutionary Dynamics , 2010, Economic learning and social evolution.

[36]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[37]  H. Peyton Young,et al.  Stochastic Evolutionary Game Dynamics , 1990 .

[38]  Brian Stadler,et al.  Evolutionary Dynamics on Small-World Networks , 2008 .