1
|
Monk T, van Schaik A. Martingales and the fixation time of evolutionary graphs with arbitrary dimensionality. ROYAL SOCIETY OPEN SCIENCE 2022; 9:220011. [PMID: 35573040 PMCID: PMC9091843 DOI: 10.1098/rsos.220011] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 01/06/2022] [Accepted: 04/01/2022] [Indexed: 05/03/2023]
Abstract
Evolutionary graph theory (EGT) investigates the Moran birth-death process constrained by graphs. Its two principal goals are to find the fixation probability and time for some initial population of mutants on the graph. The fixation probability of graphs has received considerable attention. Less is known about the distribution of fixation time. We derive clean, exact expressions for the full conditional characteristic functions (CCFs) of a close proxy to fixation and extinction times. That proxy is the number of times that the mutant population size changes before fixation or extinction. We derive these CCFs from a product martingale that we identify for an evolutionary graph with any number of partitions. The existence of that martingale only requires that the connections between those partitions are of a certain type. Our results are the first expressions for the CCFs of any proxy to fixation time on a graph with any number of partitions. The parameter dependence of our CCFs is explicit, so we can explore how they depend on graph structure. Martingales are a powerful approach to study principal problems of EGT. Their applicability is invariant to the number of partitions in a graph, so we can study entire families of graphs simultaneously.
Collapse
Affiliation(s)
- Travis Monk
- International Centre for Neuromorphic Systems, The MARCS Institute, Western Sydney University, Sydney, Australia
| | - André van Schaik
- International Centre for Neuromorphic Systems, The MARCS Institute, Western Sydney University, Sydney, Australia
| |
Collapse
|
2
|
Monk T, van Schaik A. Wald’s martingale and the conditional distributions of absorption time in the Moran process. Proc Math Phys Eng Sci 2020. [DOI: 10.1098/rspa.2020.0135] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Many models of evolution are stochastic processes, where some quantity of interest fluctuates randomly in time. One classic example is the Moranbirth–death process, where that quantity is the number of mutants in a population. In such processes, we are often interested in their absorption (i.e. fixation) probabilities and the conditional distributions of absorption time. Those conditional time distributions can be very difficult to calculate, even for relatively simple processes like the Moran birth–death model. Instead of considering the time to absorption, we consider a closely related quantity: the number of mutant population size changes before absorption. We use Wald’s martingale to obtain the conditional characteristic functions of that quantity in the Moran process. Our expressions are novel, analytical and exact, and their parameter dependence is explicit. We use our results to approximate the conditional characteristic functions of absorption time. We state the conditions under which that approximation is particularly accurate. Martingales are an elegant framework to solve principal problems of evolutionary stochastic processes. They do not require us to evaluate recursion relations, so when they are applicable, we can quickly and tractably obtain absorption probabilities and times of evolutionary models.
Collapse
Affiliation(s)
- Travis Monk
- International Centre for Neuromorphic Engineering, MARCS Institute, Western Sydney University, Werrington, NSW 2747, Australia
| | - André van Schaik
- International Centre for Neuromorphic Engineering, MARCS Institute, Western Sydney University, Werrington, NSW 2747, Australia
| |
Collapse
|
3
|
Overton CE, Broom M, Hadjichrysanthou C, Sharkey KJ. Methods for approximating stochastic evolutionary dynamics on graphs. J Theor Biol 2019; 468:45-59. [PMID: 30772340 DOI: 10.1016/j.jtbi.2019.02.009] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/20/2018] [Revised: 02/07/2019] [Accepted: 02/13/2019] [Indexed: 10/27/2022]
Abstract
Population structure can have a significant effect on evolution. For some systems with sufficient symmetry, analytic results can be derived within the mathematical framework of evolutionary graph theory which relate to the outcome of the evolutionary process. However, for more complicated heterogeneous structures, computationally intensive methods are required such as individual-based stochastic simulations. By adapting methods from statistical physics, including moment closure techniques, we first show how to derive existing homogenised pair approximation models and the exact neutral drift model. We then develop node-level approximations to stochastic evolutionary processes on arbitrarily complex structured populations represented by finite graphs, which can capture the different dynamics for individual nodes in the population. Using these approximations, we evaluate the fixation probability of invading mutants for given initial conditions, where the dynamics follow standard evolutionary processes such as the invasion process. Comparisons with the output of stochastic simulations reveal the effectiveness of our approximations in describing the stochastic processes and in predicting the probability of fixation of mutants on a wide range of graphs. Construction of these models facilitates a systematic analysis and is valuable for a greater understanding of the influence of population structure on evolutionary processes.
Collapse
Affiliation(s)
- Christopher E Overton
- Department of Mathematical Sciences, University of Liverpool, Mathematical Sciences Building, Liverpool L69 7ZL, UK.
| | - Mark Broom
- Department of Mathematics, City, University of London, Northampton Square, London EC1V 0HB, UK
| | - Christoforos Hadjichrysanthou
- Department of Infectious Disease Epidemiology, School of Public Health, Imperial College London, St Mary's Campus, Norfolk Place, London W2 1PG, UK
| | - Kieran J Sharkey
- Department of Mathematical Sciences, University of Liverpool, Mathematical Sciences Building, Liverpool L69 7ZL, UK
| |
Collapse
|
4
|
Monk T. Martingales and the fixation probability of high-dimensional evolutionary graphs. J Theor Biol 2018; 451:10-18. [PMID: 29727631 DOI: 10.1016/j.jtbi.2018.04.039] [Citation(s) in RCA: 14] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/09/2018] [Revised: 04/27/2018] [Accepted: 04/30/2018] [Indexed: 11/26/2022]
Abstract
A principal problem of evolutionary graph theory is to find the probability that an initial mutant population will fix on a graph, i.e. that the mutants will eventually replace the indigenous population. This problem is particularly difficult when the dimensionality of a graph is high. Martingales can yield compact and exact expressions for the fixation probability of an evolutionary graph. Crucially, the tractability of martingales does not necessarily depend on the dimensionality of a graph. We will use martingales to obtain the exact fixation probability of graphs with high dimensionality, specifically k-partite graphs (or 'circular flows') and megastars (or 'superstars'). To do so, we require that the edges of the graph permit mutants to reproduce in one direction and indigenous in the other. The resultant expressions for fixation probabilities explicitly show their dependence on the parameters that describe the graph structure, and on the starting position(s) of the initial mutant population. In particular, we will investigate the effect of funneling on the fixation probability of k-partite graphs, as well as the effect of placing an initial mutant in different partitions. These are the first exact and explicit results reported for the fixation probability of evolutionary graphs with dimensionality greater than 2, that are valid over all parameter space. It might be possible to extend these results to obtain fixation probabilities of high-dimensional evolutionary graphs with undirected or directed connections. Martingales are a formidable theoretical tool that can solve fundamental problems in evolutionary graph theory, often within a few lines of straightforward mathematics.
Collapse
Affiliation(s)
- Travis Monk
- Biomedical Engineering and Neuroscience, The MARCS Institute, Western Sydney University, Locked Bag 1797, Penrith, NSW 2751, Australia.
| |
Collapse
|
5
|
On the stochastic evolution of finite populations. J Math Biol 2017; 75:1735-1774. [DOI: 10.1007/s00285-017-1135-4] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/29/2016] [Revised: 03/27/2017] [Indexed: 01/13/2023]
|
6
|
Voorhees B, Ryder B. Simple graph models of information spread in finite populations. ROYAL SOCIETY OPEN SCIENCE 2015; 2:150028. [PMID: 26064661 PMCID: PMC4453248 DOI: 10.1098/rsos.150028] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/14/2015] [Accepted: 04/23/2015] [Indexed: 05/14/2023]
Abstract
We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call 'single-link' graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the non-zero eigenvalues of the antisymmetric part of the Laplacian and another measure is found for cycles as the value of the transition probability for which hitting times going in either direction of the cycle are equal. A generalization of circular flow graphs is used to illustrate the possibility of tuning edge weights to match pre-specified values for graph parameters; in particular, we show that generalizations of circular flows can be tuned to have fixation probabilities equal to the Moran probability for a complete graph by tuning vertex temperature profiles. Finally, single-link graphs are introduced as an example of a graph involving a bottleneck in the connection between two components and these are compared to the partial bipartite graphs.
Collapse
Affiliation(s)
- Burton Voorhees
- Center for Science, Athabasca University, 1 University Drive, Athabasca, Alberta, Canada T9S 3A3
- Author for correspondence: Burton Voorhees e-mail:
| | - Bergerud Ryder
- Department of Mathematics, University of Victoria, Victoria, British Columbia, Canada
| |
Collapse
|
7
|
Adlam B, Nowak MA. Universality of fixation probabilities in randomly structured populations. Sci Rep 2014; 4:6692. [PMID: 25346111 PMCID: PMC4209402 DOI: 10.1038/srep06692] [Citation(s) in RCA: 29] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/18/2014] [Accepted: 09/29/2014] [Indexed: 11/16/2022] Open
Abstract
The stage of evolution is the population of reproducing individuals. The structure of the population is known to affect the dynamics and outcome of evolutionary processes, but analytical results for generic random structures have been lacking. The most general result so far, the isothermal theorem, assumes the propensity for change in each position is exactly the same, but realistic biological structures are always subject to variation and noise. We consider a finite population under constant selection whose structure is given by a variety of weighted, directed, random graphs; vertices represent individuals and edges interactions between individuals. By establishing a robustness result for the isothermal theorem and using large deviation estimates to understand the typical structure of random graphs, we prove that for a generalization of the Erdős-Rényi model, the fixation probability of an invading mutant is approximately the same as that of a mutant of equal fitness in a well-mixed population with high probability. Simulations of perturbed lattices, small-world networks, and scale-free networks behave similarly. We conjecture that the fixation probability in a well-mixed population, (1 − r−1)/(1 − r−n), is universal: for many random graph models, the fixation probability approaches the above function uniformly as the graphs become large.
Collapse
Affiliation(s)
- Ben Adlam
- 1] Program for Evolutionary Dynamics, Harvard University, Cambridge MA 02138, USA [2] School of Engineering and Applied Science, Harvard University, Cambridge MA 02138, USA
| | - Martin A Nowak
- 1] Program for Evolutionary Dynamics, Harvard University, Cambridge MA 02138, USA [2] Department of Mathematics, Harvard University, Cambridge MA 02138, USA [3] Department of Organismic and Evolutionary Biology, Harvard University, Cambridge MA 02138, USA
| |
Collapse
|
8
|
Characterizing the effect of population heterogeneity on evolutionary dynamics on complex networks. Sci Rep 2014; 4:5034. [PMID: 24849192 PMCID: PMC4030255 DOI: 10.1038/srep05034] [Citation(s) in RCA: 24] [Impact Index Per Article: 2.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/05/2014] [Accepted: 05/02/2014] [Indexed: 11/09/2022] Open
Abstract
Recently, the impact of network structure on evolutionary dynamics has been at the center of attention when studying the evolutionary process of structured populations. This paper aims at finding out the key structural feature of network to capture its impact on evolutionary dynamics. To this end, a novel concept called heat heterogeneity is introduced to characterize the structural heterogeneity of network, and the correlation between heat heterogeneity of structure and outcome of evolutionary dynamics is further investigated on various networks. It is found that the heat heterogeneity mainly determines the impact of network structure on evolutionary dynamics on complex networks. In detail, the heat heterogeneity readjusts the selection effect on evolutionary dynamics. Networks with high heat heterogeneity amplify the selection effect on the birth-death process and suppress the selection effect on the death-birth process. Based on the above results, an effective algorithm is proposed to generate selection adjusters with desired size and average degree.
Collapse
|
9
|
Monk T, Green P, Paulin M. Martingales and fixation probabilities of evolutionary graphs. Proc Math Phys Eng Sci 2014. [DOI: 10.1098/rspa.2013.0730] [Citation(s) in RCA: 32] [Impact Index Per Article: 3.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Evolutionary graph theory is the study of birth–death processes that are constrained by population structure. A principal problem in evolutionary graph theory is to obtain the probability that some initial population of mutants will fixate on a graph, and to determine how that fixation probability depends on the structure of that graph. A fluctuating mutant population on a graph can be considered as a random walk. Martingales exploit symmetry in the steps of a random walk to yield exact analytical expressions for fixation probabilities. They do not require simplifying assumptions such as large population sizes or weak selection. In this paper, we show how martingales can be used to obtain fixation probabilities for symmetric evolutionary graphs. We obtain simpler expressions for the fixation probabilities of star graphs and complete bipartite graphs than have been previously reported and show that these graphs do not amplify selection for advantageous mutations under all conditions.
Collapse
Affiliation(s)
- T. Monk
- Department of Zoology, University of Otago, 340 Great King St., Dunedin 9054, New Zealand
| | - P. Green
- Landcare Research, 764 Cumberland Street, Dunedin 9016, New Zealand
| | - M. Paulin
- Department of Zoology, University of Otago, 340 Great King St., Dunedin 9054, New Zealand
| |
Collapse
|
10
|
Díaz J, Goldberg LA, Mertzios GB, Richerby D, Serna M, Spirakis PG. On the fixation probability of superstars. Proc Math Phys Eng Sci 2013. [DOI: 10.1098/rspa.2013.0193] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
The Moran process models the spread of genetic mutations through populations. A mutant with relative fitness
r
is introduced and the system evolves, either reaching fixation (an all-mutant population) or extinction (no mutants). In a widely cited paper, Lieberman
et al.
(2005 Evolutionary dynamics on graphs.
Nature
433
, 312–316) generalize the model to populations on the vertices of graphs. They describe a class of graphs (‘superstars’), with a parameter
k
and state that the fixation probability tends to 1−
r
−
k
as the graphs get larger: we show that this is untrue as stated. Specifically, for
k
=5, we show that the fixation probability (in the limit, as graphs get larger) cannot exceed 1−1/
j
(
r
), where
j
(
r
)=
Θ
(
r
4
), contrary to the claimed result. Our proof is fully rigorous, though we use a computer algebra package to invert a 31×31 symbolic matrix. We do believe the qualitative claim of Lieberman
et al.
—that superstar fixation probability tends to 1 as
k
increases—and that it can probably be proved similarly to their sketch. We were able to run larger simulations than the ones they presented. Simulations on graphs of around 40 000 vertices do not support their claim but these graphs might be too small to exhibit the limiting behaviour.
Collapse
Affiliation(s)
- Josep Díaz
- Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
| | - Leslie Ann Goldberg
- Department of Computer Science, University of Liverpool, Liverpool, UK
- Department of Computer Science, University of Oxford, Oxford, UK
| | - George B. Mertzios
- School of Engineering and Computing Sciences, Durham University, Durham, UK
| | - David Richerby
- Department of Computer Science, University of Liverpool, Liverpool, UK
- Department of Computer Science, University of Oxford, Oxford, UK
| | - Maria Serna
- Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
| | - Paul G. Spirakis
- Department of Computer Science, University of Liverpool, Liverpool, UK
- Department of Computer Engineering and Informatics, University of Patras, Patras, Greece
| |
Collapse
|
11
|
Abstract
The problem of finding birth–death fixation probabilities for configurations of normal and mutants on an
N
-vertex graph is formulated in terms of a Markov process on the 2
N
-dimensional state space of possible configurations. Upper and lower bounds on the fixation probability after any given number of iterations of the birth–death process are derived in terms of the transition matrix of this process. Consideration is then specialized to a family of graphs called circular flows, and we present a summation formula for the complete bipartite graph, giving the fixation probability for an arbitrary configuration of mutants in terms of a weighted sum of the single-vertex fixation probabilities. This also yields a closed-form solution for the fixation probability of bipartite graphs. Three entropy measures are introduced, providing information about graph structure. Finally, a number of examples are presented, illustrating cases of graphs that enhance or suppress fixation probability for fitness
r
>1 as well as graphs that enhance fixation probability for only a limited range of fitness. Results are compared with recent results reported in the literature, where a positive correlation is observed between vertex degree variance and fixation probability for undirected graphs. We show a similar correlation for directed graphs, with correlation not directly to fixation probability but to the difference between fixation probability for a given graph and a complete graph.
Collapse
Affiliation(s)
- Burton Voorhees
- Center for Science, Athabasca University, 1 University Drive, Athabasca, Alberta, Canada T9S 3A3
| | - Alex Murray
- Department of Mathematics, University of Victoria, Victoria, British Columbia, Canada
| |
Collapse
|
12
|
Abstract
This paper presents an adaptation of the Moran birth–death model of evolutionary processes on graphs. The present model makes use of the full population state space consisting of 2
N
binary-valued vectors, and a Markov process on this space with a transition matrix defined by the edge weight matrix for any given graph. While the general case involves solution of 2
N
– 2 linear equations, symmetry considerations substantially reduce this for graphs with large automorphism groups, and a number of simple examples are considered. A parameter called graph determinacy is introduced, measuring the extent to which the fate of any randomly chosen population state is determined. Some simple graphs that suppress or enhance selection are analysed, and comparison of several examples to the Moran process on a complete graph indicates that in some cases a graph may enhance selection relative to a complete graph for only limited values of the fitness parameter.
Collapse
Affiliation(s)
- Burton Voorhees
- Center for Science, Athabasca University, 1 University Dr Athabasca, Alberta, Canada T9S 3A3
| |
Collapse
|
13
|
Houchmandzadeh B, Vallade M. Exact results for fixation probability of bithermal evolutionary graphs. Biosystems 2013; 112:49-54. [PMID: 23567507 DOI: 10.1016/j.biosystems.2013.03.020] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/19/2012] [Revised: 02/14/2013] [Accepted: 03/27/2013] [Indexed: 11/29/2022]
Abstract
One of the most fundamental concepts of evolutionary dynamics is the "fixation" probability, i.e. the probability that a mutant spreads through the whole population. Most natural communities are geographically structured into habitats exchanging individuals among each other and can be modeled by an evolutionary graph (EG), where directed links weight the probability for the offspring of one individual to replace another individual in the community. EGs have recently spurred huge interest, as it has been shown that some topology can amplify or suppress the effect of beneficial mutations. Very few exact analytical results however are known for EGs. In this article we show that the use of a new technique, the fixed point of probability generating function, allows us to compute the exact fixation probability for a large subset of bithermal graphs. We also show by numerical simulations that the computed solution holds for all bithermal graphs. Moreover, the analytical solution allows us to clarify the opposing consequences of birth-death versus death-birth processes as amplifier or suppressor of beneficial mutations for the same bithermal topology.
Collapse
|
14
|
Shakarian P, Roos P, Moores G. A novel analytical method for evolutionary graph theory problems. Biosystems 2013; 111:136-44. [DOI: 10.1016/j.biosystems.2013.01.006] [Citation(s) in RCA: 17] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/04/2012] [Revised: 01/05/2013] [Accepted: 01/10/2013] [Indexed: 11/27/2022]
|
15
|
Shakarian P, Roos P, Johnson A. A review of evolutionary graph theory with applications to game theory. Biosystems 2011; 107:66-80. [PMID: 22020107 DOI: 10.1016/j.biosystems.2011.09.006] [Citation(s) in RCA: 61] [Impact Index Per Article: 4.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/15/2011] [Accepted: 09/26/2011] [Indexed: 11/29/2022]
Abstract
Evolutionary graph theory (EGT), studies the ability of a mutant gene to overtake a finite structured population. In this review, we describe the original framework for EGT and the major work that has followed it. This review looks at the calculation of the "fixation probability" - the probability of a mutant taking over a population and focuses on game-theoretic applications. We look at varying topics such as alternate evolutionary dynamics, time to fixation, special topological cases, and game theoretic results. Throughout the review, we examine several interesting open problems that warrant further research.
Collapse
Affiliation(s)
- Paulo Shakarian
- Network Science Center and Dept. of Electrical Engineering and Computer Science, United States Military Academy, West Point, NY 10996, United States.
| | | | | |
Collapse
|