Urn Models, Replicator Processes, and Random Genetic Drift

To understand the relative importance of natural selection and random genetic drift in finite but growing populations, the asymptotic behavior of a class of generalized Polya urns is studied using the method of ordinary differential equation (ODE). Of particular interest is the replicator process: two balls (individuals) are chosen from an urn (the population) at random with replacement and balls of the same colors (strategies) are added or removed according to probabilities that depend only on the colors of the chosen balls. Under the assumption that the expected number of balls being added always exceeds the expected number of balls being removed whenever balls are in the urn, the probability of nonextinction is shown to be positive. On the event of nonextinction, three results are proven: (i) the number of balls increases asymptotically at a linear rate, (ii) the distribution x(n) of strategies at the nth update is a "noisy" Cauchy-Euler approximation to the mean limit ODE of the process, and (iii) the limit set of x(n) is almost surely a connected internally chain recurrent set for the mean limit ODE. Under a stronger set of assumptions, it is shown that for any attractor of the mean limit ODE there is a positive probability that the limit set for x(n) lies in this attractor. Theoretical and numerical estimates for the probabilities of nonextinction and convergence to an attractor suggest that random genetic drift is more likely to overcome natural selection in small populations for which pairwise interactions lead to highly variable outcomes, and is less likely to overcome natural selection in large populations with the potential for rapid growth.

[1]  Chain recurrence in surface flows , 1994 .

[2]  R. Punnett,et al.  The Genetical Theory of Natural Selection , 1930, Nature.

[3]  B. Sinervo,et al.  The rock–paper–scissors game and the evolution of alternative male strategies , 1996, Nature.

[4]  Martin Posch,et al.  Cycling in a stochastic learning algorithm for normal form games , 1997 .

[5]  J. Hofbauer,et al.  Stable periodic solutions for the hypercycle system , 1991 .

[6]  W. Ewens Mathematical Population Genetics , 1980 .

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

[8]  M. Hirsch,et al.  Asymptotic pseudotrajectories and chain recurrent flows, with applications , 1996 .

[9]  R. Pemantle,et al.  Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations , 1990 .

[10]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[11]  J. M. Smith,et al.  The Logic of Animal Conflict , 1973, Nature.

[12]  D. E. Matthews Evolution and the Theory of Games , 1977 .

[13]  R. Durrett Probability: Theory and Examples , 1993 .

[14]  Yu. M. Ermol’ev,et al.  A generalized URN problem and its applications , 1983 .

[15]  T. Nagylaki Models and approximations for random genetic drift. , 1990 .

[16]  M. Benaïm,et al.  Ergodic Properties of Weak Asymptotic Pseudotrajectories for Semiflows , 2000 .

[17]  Michel Bena,et al.  Asymptotic Pseudotrajectories and Chain Recurrent Flows, with Applications , 1996 .

[18]  L. Perko Differential Equations and Dynamical Systems , 1991 .

[19]  Robert C. Elston,et al.  Mathematical population genetics, Biomathematics. , 1981 .

[20]  J. M. Smith The theory of games and the evolution of animal conflicts. , 1974, Journal of theoretical biology.

[21]  John Maynard Smith Did Darwin get it Right , 1993 .

[22]  M. Benaïm A Dynamical System Approach to Stochastic Approximations , 1996 .

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

[24]  C. Conley Isolated Invariant Sets and the Morse Index , 1978 .

[25]  S. Wright,et al.  Evolution in Mendelian Populations. , 1931, Genetics.

[26]  William D. Sudderth,et al.  A Strong Law for Some Generalized Urn Processes , 1980 .

[27]  M. Hirsch,et al.  Dynamics of Morse-Smale urn processes , 1995, Ergodic Theory and Dynamical Systems.

[28]  M. Benaïm Dynamics of stochastic approximation algorithms , 1999 .

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

[30]  William Feller,et al.  Diffusion Processes in Genetics , 1951 .