DOCSLIB.ORG

Mathematical Models in Evolutionary Dynamics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mathematical Models in Evolutionary Dynamics c 2016 by Meghan Galiardi. All rights reserved. MATHEMATICAL MODELS IN EVOLUTIONARY DYNAMICS BY MEGHAN GALIARDI DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate College of the University of Illinois at Urbana-Champaign, 2016 Urbana, Illinois Doctoral Committee: Professor Zoi Rapti, Chair Professor Lee DeVille, Director of Research Professor Renming Song Professor Vadim Zharnitsky Abstract We consider two mathematical models in evolutionary dynamics. The first model is an extension of an evolutionary game theory model proposed by Martin Nowak [50]. We consider both a mean field deterministic approach and a weak noise stochastic approach, but the focus is on latter which is an uncommon approach for this type of model. The second model is an extension of a competitive exclusion model studied by DeVille et. al. [7]. We again consider both a mean field deterministic approach and a weak noise stochastic approach, this time with the focus on the former where we are able to prove numerous global stability results. ii To Bumpa, who gave me my math brain. iii Acknowledgments This project would not have been possible without the support of many people. First I thank my advisor Lee DeVille who provided me with much guidance and many helpful insights without which I would not have gotten this far. I thank my committee members Zoi Rapti, Renming Song and Vadim Zharnitsky. I also thank many staff members at Sandia National Laboratories for all their support and guidance, especially my mentors Eric Vugrin and Steve Verzi. I am very appreciative of all the financial support I have received over the years: National Science Foundation grant DMS 08-38434 \EMSW21-MCTP: Research Experience for Graduate Students" for funding my summers during my first few years, National Science Foundation grant DMS 1345032 \MCTP: PI4: Program for Interdisciplinary and Industrial Internships at Illinois" for providing travel support for my trips to Albuquerque, and Sandia National Laboratories for funding my last two summers and last three semesters which enabled me to focus more on my research. Lastly, I would like to thank my cat Solo for always sitting by my side though all the research and writing. iv Table of Contents List of Figures . viii List of Abbreviations . x List of Symbols . xi Chapter 1 Introduction . 1 1.1 Early History . .1 1.2 Evolutionary Game Theory . .3 1.3 Competitive Exclusion . .6 1.4 Layout of Dissertation . .9 Chapter 2 Finite{Size Effects and Switching Times for Moran Dynamics with Mutation 10 2.1 Introduction . 10 2.2 Model . 11 2.2.1 Definition . 11 2.2.2 Parameter Regimes . 13 2.2.3 Simulation Results . 14 2.2.4 Connection to Prisoner's Dilemma Dynamics . 14 2.3 Deterministic Bifurcation Analysis . 17 2.3.1 Case 1.1 | a + b = c + d with a > d and b < c ...................... 17 2.3.2 Case 2 | a + b > c + d ................................... 19 2.4 Stochastic Analysis . 20 2.4.1 Diffusion Approximation (See Appendix E.2.1) . 22 2.4.2 WKB Approximation (See Appendix E.3) . 26 2.4.3 Comparison of Quasipotentials . 26 2.5 Simulation Results . 28 2.5.1 Comparison Between van Kampen Approximation and Deterministic System . 28 2.5.2 Comparison of MFPT . 29 2.6 Discussion . 30 Chapter 3 Lowering the Cooperation Threshold Using Tit{for{Tat . 33 3.1 Introduction . 33 3.2 Model . 33 3.2.1 Three Strategies . 33 3.2.2 Four Strategies . 34 3.3 Deterministic Equation . 35 3.3.1 Three Strategies . 35 3.3.2 Four Strategies . 36 3.4 Quasistationary Distribution and Mean First{Passage Times (See Appendix D.5.3) . 36 3.5 Analysis of Examples with AllC, AllD, TFT, and WSLS . 38 3.5.1 Three{Strategy Game between AllC, AllD, and TFT . 40 v 3.5.2 Three{Strategy Game between AllC, AllD, and WSLS . 40 3.5.3 Four{Strategy Game between AllC, AllD, TFT, and WSLS . 44 3.6 Discussion . 46 Chapter 4 Global Stability of a Trait{Based Competitive Exclusion Model with Mutation 49 4.1 Introduction . 49 4.2 Model . 50 4.3 Deterministic Analysis . 51 4.3.1 Spectrum of Hamming Matrices . 52 4.3.2 Linear Stability Analysis . 54 4.3.3 Global Stability Analysis . 55 4.4 Stochastic Analysis . 66 4.5 Simulation Results . 69 4.6 Discussion . 69 Chapter 5 Algorithms . 74 5.1 Numerical Solutions of Differential Equations . 74 5.1.1 Adaptive Time Step for Competitive Exclusion . 74 5.1.2 Parallelization Performance Model . 76 5.2 Stochastic Simulations of Markov Processes . 82 5.3 Simulations of Stochastic Differential Equations . 83 5.4 Quasipotential in Multidimensions . 83 Chapter 6 Concluding Remarks . 86 Appendix A Stability of Differential Equations . 87 A.1 Definitions . 87 A.2 Stability of Linear Equations . 87 A.3 Stability of Non-Linear Equations . 88 Appendix B Background on Markov Processes . 90 B.1 Stochastic Process . 90 B.2 Markov Process . 91 B.3 Chapman{Kolmogorov Equation . 91 B.4 Differential Chapman{Kolmogorov Equation . 92 B.4.1 Interpretation of Conditions (1)-(3) . 96 B.4.2 Diffusion Process . 101 B.5 Example | Ornstein{Uhlenbeck Process . 102 Appendix C Stochastic Differential Equations . 105 C.1 It^oStochastic Integral . 105 C.1.1 dW n(t)............................................ 106 C.1.2 Mean-Value and Correlation . 107 C.2 Stochastic Differential Equations . 108 C.2.1 Existence and Uniqueness . 109 C.2.2 It^o'sChange of Variables Formula . 109 C.2.3 Relationship between SDEs and the Fokker{Planck Equation . 110 C.3 Example | Ornstein{Uhlenbeck Process . 111 C.4 Small Noise Expansions for SDEs . 113 C.5 Multidimensional SDEs . 122 C.5.1 It^o'sChange of Variables Formula . 122 C.5.2 Relationship between SDEs and the Fokker{Planck Equation . 122 vi Appendix D The Fokker{Planck Equation . 123 D.1 Forward Fokker{Planck Equation . 123 D.1.1 Boundary Conditions . ..
Load more

Recommended publications
  • A Stochastic Differential Equation Derived from Evolutionary Game Theory
    U.U.D.M. Project Report 2019:5 A stochastic differential equation derived from evolutionary game theory Brian Treacy Examensarbete i matematik, 15 hp Handledare: Ingemar Kaj Examinator: Denis Gaidashev Februari 2019 Department of Mathematics Uppsala University Abstract Evolutionary game theory models population dynamics of species when a concept of fit- ness is introduced. Initally ordinary differential equation models were the primary tool but these fail to capture inherent randomness in sufficiently small finite populations. There- fore stochastic models were created to capture the stochasticity in these populations. This thesis connects these two modeling paradigms. It does this by defining a stochastic process model for fitness-dependent population dynamics and deriving its associated in- finitesimal generator. This is followed by linking the finite population stochastic process model to the infinite population ordinary differential equation model by taking the limit of the total population which results in a stochastic differential equation. The behaviour of this stochastic differential equation is analyzed, showing how certain parameters af- fect how closely this stochastic differential equation mimics the behaviour of the ordinary differential equation. The thesis concludes by providing graphical evidence that the one- third rule holds with this stochastic differential equation. 3 Contents Introduction 5 1 Moran Process 6 1.1 Payoff ....................................6 1.2 Fitness . .7 1.3 Transition Probabilities . .7 1.4 Fixation Probabilities and Times . .8 2 Infinitesimal Generator 9 2.1 Infinitesimal Generator for alternative fitness function . 10 3 Stochastic Differential Equations 11 3.1 Heuristics . 11 3.2 Existence and Uniqueness . 11 3.3 Infinitesimal Generator . 12 4 Analysis 13 4.1 Analysis of deterministic component .
    [Show full text]
  • Populations in Environments with a Soft Carrying Capacity Are Eventually
    Populations in environments with a soft carrying capacity are eventually extinct † Peter Jagers∗ Sergei Zuyev∗ August 5, 2020 Abstract Consider a population whose size changes stepwise by its members reproducing or dying (disappearing), but is otherwise quite general. Denote the initial (non-random) size by Z0 and the size of the nth change by Cn, n = 1,2,.... Population sizes hence develop successively as Z1 = Z0 +C1, Z2 = Z1 +C2 and so on, indefinitely or until there are no further size changes, due to extinction. Extinction is thus assumed final, so that Zn = 0 implies that Zn+1 = 0, without there being any other finite absorbing class of population sizes. We make no assumptions about the time durations between the successive changes. In the real world, or more specific models, those may be of varying length, depending upon individual life span distributions and their interdepen- dencies, the age-distribution at hand and intervening circumstances. We could con- sider toy models of Galton-Watson type generation counting or of the birth-and-death type, with one individual acting per change, until extinction, or the most general multi- type CMJ branching processes with, say, population size dependence of reproduction. Changes may have quite varying distributions. The basic assumption is that there is a carrying capacity, i.e. a non-negative number K such that the conditional expectation of the change, given the complete past history, is non-positive whenever the population exceeds the carrying capacity. Further, to avoid unnecessary technicalities, we assume that the change Cn equals -1 (one individual dying) with a conditional (given the past) probability uniformly bounded away from 0.
    [Show full text]
  • An Ergodic Theorem for Fleming-Viot Models in Random Environments
    An Ergodic Theorem for Fleming-Viot Models in Random Environments 1 Arash Jamshidpey 2 2016 Abstract The Fleming-Viot (FV) process is a measure-valued diffusion that models the evolution of type frequencies in a countable population which evolves under resampling (genetic drift), mutation, and selection. In the classic FV model the fitness (strength) of types is given by a measurable function. In this paper, we introduce and study the Fleming-Viot process in random environment (FVRE), when by random environment we mean the fitness of types is a stochastic process with c`adl`ag paths. We identify FVRE as the unique solution to a so called quenched martingale problem and derive some of its properties via martingale and duality methods. We develop the duality methods for general time-inhomogeneous and quenched martingale problems. In fact, some important aspects of the duality relations only appears for time-inhomogeneous (and quenched) martingale problems. For example, we see that duals evolve backward in time with respect to the main Markov process whose evolution is forward in time. Using a family of function-valued dual processes for FVRE, we prove that, as the number eN of individuals N tends to ∞, the measure-valued Moran process µN (with fitness process eN ) e converges weakly in Skorokhod topology of c`adl`ag functions to the FVRE process µ (with fitness process e), if eN → e a.s. in Skorokhod topology of c`adl`ag functions. We also study e the long-time behaviour of FVRE process (µt )t≥0 joint with its fitness process e =(et)t≥0 and e prove that the joint FV-environment process (µt ,et)t≥0 is ergodic under the assumption of weak ergodicity of e.
    [Show full text]
  • An Extended Moran Process That Captures the Struggle for Fitness
    An extended Moran process that captures the struggle for fitness a, b c Marthe M˚aløy ⇤, Frode M˚aløy, Rafael Lahoz-Beltr´a , Juan Carlos Nu˜no , Antonio Brud aDepartment of Mathematics and Statistics, The Arctic University of Norway. bDepartment of Biodiversity, Ecology and Evolution, Complutense University of Madrid, Spain. cDepartamento de Matem´atica Aplicada a los Recursos Naturales, Universidad Polit´ecnica de Madrid, Spain dDepartment of Applied Mathematics, Complutense University of Madrid, Spain Abstract When a new type of individual appears in a stable population, the newcomer is typically not advantageous. Due to stochasticity, the new type can grow in numbers, but the newcomers can only become advantageous if they manage to change the environment in such a way that they increase their fitness. This dy- namics is observed in several situations in which a relatively stable population is invaded by an alternative strategy, for instance the evolution of cooperation among bacteria, the invasion of cancer in a multicellular organism and the evo- lution of ideas that contradict social norms. These examples also show that, by generating di↵erent versions of itself, the new type increases the probability of winning the struggle for fitness. Our model captures the imposed cooperation whereby the first generation of newcomers dies while changing the environment such that the next generations become more advantageous. Keywords: Evolutionary dynamics, Nonlinear dynamics, Mathematical modelling, Game theory, Cooperation 1. Introduction When unconditional cooperators appear in a large group of defectors, they are exploited until they become extinct. The best possible scenario for this type of cooperators is to change the environment such that another type of cooper- 5 ators that are regulated and only cooperate under certain conditions becomes advantageous.
    [Show full text]
  • Dynamics of Markov Chains for Undergraduates
    Dynamics of Markov Chains for Undergraduates Ursula Porod February 19, 2021 Contents Preface 6 1 Markov chains 8 1.1 Introduction . .8 1.2 Construction of a Markov chain . .9 1.2.1 Finite-length trajectories . .9 1.2.2 From finite to infinite-length trajectories . 11 1.3 Basic computations for Markov chains . 16 1.4 Strong Markov Property . 21 1.5 Examples of Markov Chains . 23 1.6 Functions of Markov chains . 35 1.7 Irreducibility and class structure of the state space . 42 1.8 Transience and Recurrence . 44 1.9 Absorbing chains . 53 1.9.1 First step analysis . 53 1.9.2 Finite number of transient states . 55 1.9.3 Infinite number of transient states . 61 1.10 Stationary distributions . 66 1.10.1 Existence and uniqueness of an invariant measure . 68 1.10.2 Positive recurrence versus null recurrence . 73 1.10.3 Stationary distributions for reducible chains . 74 1.10.4 Steady state distributions . 76 1.11 Periodicity . 77 1.12 Exercises . 85 2 Limit Theorems for Markov Chains 87 2.1 The Ergodic Theorem . 87 2.2 Convergence . 93 2.3 Long-run behavior of reducible chains . 98 1 CONTENTS 2 2.4 Exercises . 100 3 Random Walks on Z 101 3.1 Basics . 101 3.2 Wald's Equations . 103 3.3 Gambler's Ruin . 105 3.4 P´olya's Random Walk Theorem . 111 3.5 Reflection Principle and Duality . 115 3.5.1 The ballot problem . 120 3.5.2 Dual walks . 121 3.5.3 Maximum and minimum .
    [Show full text]
  • Ecological and Evolutionary Dynamics of Interconnectedness and Modularity
    Ecological and evolutionary dynamics of interconnectedness and modularity Jan M. Nordbottena,b, Simon A. Levinc, Eörs Szathmáryd,e,f, and Nils C. Stensethg,1 aDepartment of Mathematics, University of Bergen, N-5020 Bergen, Norway; bDepartment of Civil and Environmental Engineering, Princeton University, Princeton, NJ 08544; cDepartment of Ecology and Evolutionary Biology, Princeton University, Princeton, NJ 08544; dParmenides Center for the Conceptual Foundations of Science, D-82049 Pullach, Germany; eMTA-ELTE (Hungarian Academy of Sciences—Eötvös University), Theoretical Biology and Evolutionary Ecology Research Group, Department of Plant Systematics, Ecology and Theoretical Biology, Eötvös University, Budapest, H-1117 Hungary; fEvolutionary Systems Research Group, MTA (Hungarian Academy of Sciences) Ecological Research Centre, Tihany, H-8237 Hungary; and gCentre for Ecological and Evolutionary Synthesis (CEES), Department of Biosciences, University of Oslo, N-0316 Oslo, Norway Contributed by Nils C. Stenseth, December 1, 2017 (sent for review September 12, 2017; reviewed by David C. Krakauer and Günter P. Wagner) In this contribution, we develop a theoretical framework for linking refinement of this inquiry is to look for compartmentalization (i.e., microprocesses (i.e., population dynamics and evolution through modularity) in ecosystems. In food webs, for example, compartments natural selection) with macrophenomena (such as interconnectedness (which are subgroups of taxa with many strong interactions in each and modularity within an
    [Show full text]
  • What Genomic Data Can Reveal About Eco-Evolutionary Dynamics
    PERSPECTIVE https://doi.org/10.1038/s41559-017-0385-2 What genomic data can reveal about eco-evolutionary dynamics Seth M. Rudman 1*, Matthew A. Barbour2, Katalin Csilléry3, Phillip Gienapp4, Frederic Guillaume2, Nelson G. Hairston Jr5, Andrew P. Hendry6, Jesse R. Lasky7, Marina Rafajlović8,9, Katja Räsänen10, Paul S. Schmidt1, Ole Seehausen 11,12, Nina O. Therkildsen13, Martin M. Turcotte3,14 and Jonathan M. Levine15 Recognition that evolution operates on the same timescale as ecological processes has motivated growing interest in eco-evo- lutionary dynamics. Nonetheless, generating sufficient data to test predictions about eco-evolutionary dynamics has proved challenging, particularly in natural contexts. Here we argue that genomic data can be integrated into the study of eco-evo- lutionary dynamics in ways that deepen our understanding of the interplay between ecology and evolution. Specifically, we outline five major questions in the study of eco-evolutionary dynamics for which genomic data may provide answers. Although genomic data alone will not be sufficient to resolve these challenges, integrating genomic data can provide a more mechanistic understanding of the causes of phenotypic change, help elucidate the mechanisms driving eco-evolutionary dynamics, and lead to more accurate evolutionary predictions of eco-evolutionary dynamics in nature. vidence that the ways in which organisms interact with their evolution plays a central role in regulating such dynamics. environment can evolve fast enough to alter ecological dynam- Particularly relevant is information gleaned from efforts to under- Eics has forged a new link between ecology and evolution1–5. A stand the genomic basis of adaptation, a burgeoning field in evolu- growing area of study, termed eco-evolutionary dynamics, centres tionary biology that investigates the specific genomic underpinnings on understanding when rapid evolutionary change is a meaningful of phenotypic variation, its response to natural selection and effects driver of ecological dynamics in natural ecosystems6–8.
    [Show full text]
  • Scaling Limits of a Model for Selection at Two Scales
    Home Search Collections Journals About Contact us My IOPscience Scaling limits of a model for selection at two scales This content has been downloaded from IOPscience. Please scroll down to see the full text. 2017 Nonlinearity 30 1682 (http://iopscience.iop.org/0951-7715/30/4/1682) View the table of contents for this issue, or go to the journal homepage for more Download details: IP Address: 152.3.102.254 This content was downloaded on 01/06/2017 at 10:54 Please note that terms and conditions apply. You may also be interested in: Stochastic switching in biology: from genotype to phenotype Paul C Bressloff Ergodicity in randomly forced Rayleigh–Bénard convection J Földes, N E Glatt-Holtz, G Richards et al. Regularity of invariant densities for 1D systems with random switching Yuri Bakhtin, Tobias Hurth and Jonathan C Mattingly Cusping, transport and variance of solutions to generalized Fokker–Planck equations Sean Carnaffan and Reiichiro Kawai Anomalous diffusion for a class of systems with two conserved quantities Cédric Bernardin and Gabriel Stoltz Feynman–Kac equation for anomalous processes with space- and time-dependent forces Andrea Cairoli and Adrian Baule Mixing rates of particle systems with energy exchange A Grigo, K Khanin and D Szász Ergodicity of a collective random walk on a circle Michael Blank Stochastic partial differential equations with quadratic nonlinearities D Blömker, M Hairer and G A Pavliotis IOP Nonlinearity Nonlinearity London Mathematical Society Nonlinearity Nonlinearity 30 (2017) 1682–1707 https://doi.org/10.1088/1361-6544/aa5499
    [Show full text]
  • Stochastische Prozesse
    University of Vienna Stochastische Prozesse January 27, 2015 Contents 1 Random Walks 5 1.1 Heads or tails . 5 1.2 Probability of return . 6 1.3 Reflection principle . 7 1.4 Main lemma for symmetric random walks . 7 1.5 First return . 8 1.6 Last visit . 9 1.7 Sojourn times . 10 1.8 Position of maxima . 11 1.9 Changes of sign . 11 1.10 Return to the origin . 12 1.11 Random walks in the plane Z2 . 13 1.12 The ruin problem . 13 1.13 How to gamble if you must . 14 1.14 Expected duration of the game . 15 1.15 Generating function for the duration of the game . 15 1.16 Connection with the diffusion process . 17 2 Branching processes 18 2.1 Extinction or survival of family names . 18 2.2 Proof using generating functions . 19 2.3 Some facts about generating functions . 22 2.4 Moment and cumulant generating functions . 23 2.5 An example from genetics by Fischer (1930) . 24 2.6 Asymptotic behaviour . 26 3 Markov chains 27 3.1 Definition . 27 3.2 Examples of Markov chains . 27 3.3 Transition probabilities . 30 3.4 Invariant distributions . 31 3.5 Ergodic theorem for primitive Markov chains . 31 3.6 Examples for stationary distributions . 34 3.7 Birth-death chains . 34 3.8 Reversible Markov chains . 35 3.9 The Markov chain tree formula . 36 1 3.10 Mean recurrence time . 39 3.11 Recurrence vs. transience . 40 3.12 The renewal equation . 42 3.13 Positive vs. null-recurrence .
    [Show full text]
  • Martin A. Nowak
    EVOLUTIONARY DYNAMICS EXPLORING THE EQUATIONS OF LIFE MARTIN A. NOWAK THE BELKNAP PRESS OF HARVARD UNIVERSITY PRESS CAMBRIDGE, MASSACHUSETTS, AND LONDON, ENGLAND 2006 Copyright © 2006 by the President and Fellows of Harvard College All rights reserved Printed in Canada Library of Congress Cataloging-in-Publication Data Nowak, M. A. (Martin A.) Evolutionary dynamics : exploring the equations of life / Martin A. Nowak. p. cm. Includes bibliographical references and index. ISBN-13: 978-0-674-02338-3 (alk. paper) ISBN-10: 0-674-02338-2 (alk. paper) 1. Evolution (Biology)—Mathematical models. I. Title. QH371.3.M37N69 2006 576.8015118—dc22 2006042693 Designed by Gwen Nefsky Frankfeldt CONTENTS Preface ix 1 Introduction 1 2 What Evolution Is 9 3 Fitness Landscapes and Sequence Spaces 27 4 Evolutionary Games 45 5 Prisoners of the Dilemma 71 6 Finite Populations 93 7 Games in Finite Populations 107 8 Evolutionary Graph Theory 123 9 Spatial Games 145 10 HIV Infection 167 11 Evolution of Virulence 189 12 Evolutionary Dynamics of Cancer 209 13 Language Evolution 249 14 Conclusion 287 Further Reading 295 References 311 Index 349 PREFACE Evolutionary Dynamics presents those mathematical principles according to which life has evolved and continues to evolve. Since the 1950s biology, and with it the study of evolution, has grown enormously, driven by the quest to understand the world we live in and the stuff we are made of. Evolution is the one theory that transcends all of biology. Any observation of a living system must ultimately be interpreted in the context of its evolution. Because of the tremendous advances over the last half century, evolution has become a dis- cipline that is based on precise mathematical foundations.
    [Show full text]
  • The Moran Process As a Markov Chain on Leaf-Labeled Trees
    The Moran Process as a Markov Chain on Leaf-labeled Trees David J. Aldous∗ University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860 [email protected] http://www.stat.berkeley.edu/users/aldous March 29, 1999 Abstract The Moran process in population genetics may be reinterpreted as a Markov chain on a set of trees with leaves labeled by [n]. It provides an interesting worked example in the theory of mixing times and coupling from the past for Markov chains. Mixing times are shown to be of order n2, as anticipated by the theory surrounding Kingman’s coalescent. Incomplete draft -- do not circulate AMS 1991 subject classification: 05C05,60C05,60J10 Key words and phrases. Coupling from the past, Markov chain, mixing time, phylogenetic tree. ∗Research supported by N.S.F. Grant DMS96-22859 1 1 Introduction The study of mixing times for Markov chains on combinatorial sets has attracted considerable interest over the last ten years [3, 5, 7, 14, 16, 18]. This paper provides another worked example. We must at the outset admit that the mathematics is fairly straightforward, but we do find the example instructive. Its analysis provides a simple but not quite obvious illustration of coupling from the past, reminiscent of the elementary analysis ([1] section 4) of riffle shuffle, and of the analysis of move-to-front list algorithms [12] and move-to-root algorithms for maintaining search trees [9]. The main result, Proposition 2, implies that while most combinatorial chains exhibit the cut-off phenomenon [8], this particular example has the opposite diffusive behavior.
    [Show full text]
  • Allen&Tarnita
    J. Math. Biol. DOI 10.1007/s00285-012-0622-x Mathematical Biology Measures of success in a class of evolutionary models with fixed population size and structure Benjamin Allen Corina E. Tarnita · Received: 3 November 2011 / Revised: 24 October 2012 © Springer-Verlag Berlin Heidelberg 2012 Abstract We investigate a class of evolutionary models, encompassing many established models of well-mixed and spatially structured populations. Models in this class have fixed population size and structure. Evolution proceeds as a Markov chain, with birth and death probabilities dependent on the current population state. Starting from basic assumptions, we show how the asymptotic (long-term) behav- ior of the evolutionary process can be characterized by probability distributions over the set of possible states. We then define and compare three quantities characterizing evolutionary success: fixation probability, expected frequency, and expected change due to selection. We show that these quantities yield the same conditions for success in the limit of low mutation rate, but may disagree when mutation is present. As part of our analysis, we derive versions of the Price equation and the replicator equation that describe the asymptotic behavior of the entire evolutionary process, rather than the change from a single state. We illustrate our results using the frequency-dependent Moran process and the birth–death process on graphs as examples. Our broader aim is to spearhead a new approach to evolutionary theory, in which general principles of evolution are proven as mathematical theorems from axioms. B. Allen (B) Department of Mathematics, Emmanuel College, Boston, MA 02115, USA e-mail: [email protected] B.
    [Show full text]