Related papers: An extension of the Moran process using type-speci…
We consider the Moran process, as generalized by Lieberman, Hauert and Nowak (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…
We study the fixation probability for two versions of the Moran process on the random graph $G_{n,p}$ at the threshold for connectivity. The Moran process models the spread of a mutant population in a network. Throughtout the process there…
Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider…
The Moran process models the spread of genetic mutations through a population. A mutant with relative fitness $r$ is introduced into a population and the system evolves, either reaching fixation (in which every individual is a mutant) or…
Evolution in finite populations is often modelled using the classical Moran process. Over the last ten years this methodology has been extended to structured populations using evolutionary graph theory. An important question in any such…
The multi-type Moran process is an evolutionary process on a connected graph $G$ in which each vertex has one of $k$ types and, in each step, a vertex $v$ is chosen to reproduce its type to one of its neighbours. The probability of a vertex…
The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every vertex is a mutant, or "extinction", where no vertex is a…
Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type…
The Moran process is a classic stochastic process that models invasion dynamics on graphs. A single "mutant" (e.g., a new opinion, strain, social trait etc.) invades a population of residents spread over the nodes of a graph. The mutant…
We study evolutionary dynamics on graphs in which each step consists of one birth and one death, also known as the Moran processes. There are two types of individuals: residents with fitness $1$ and mutants with fitness $r$. Two standard…
We consider the classic Moran process modeling the spread of genetic mutations, as extended to structured populations by Lieberman et al.\ (Nature, 2005). In this process, individuals are the vertices of a connected graph $G$. Initially,…
We study fixation probabilities for the Moran stochastic process for the evolution of a population with three or more types of individuals and frequency-dependent fitnesses. Contrarily to the case of populations with two types of…
Evolutionary dynamics has been classically studied for homogeneous populations, but now there is a growing interest in the non-homogenous case. One of the most important models has been proposed by Lieberman, Hauert and Nowak, adapting to a…
This paper is based on the complete classification of evolutionary scenarios for the Moran process with two strategies given by Taylor et al. (B. Math. Biol. 66(6): 1621--1644, 2004). Their classification is based on whether each strategy…
We consider the Moran process in a graph called the "star" and obtain the asymptotic expression for the fixation probability of a single mutant when the size of the graph is large. The expression obtained corrects the previously known…
The stage of evolution is the population of reproducing individuals. The structure of the population is know to affect the dynamics and outcome of evolutionary processes, but analytical results for generic random structures have been…
The Moran process on graphs is a popular model to study the dynamics of evolution in a spatially structured population. Exact analytical solutions for the fixation probability and time of a new mutant have been found for only a few classes…
Evolutionary graph theory models the effects of natural selection and random drift on structured populations of competing mutant and non-mutant individuals. Recent studies have found that fixation times in such systems often have…
The well-known Isothermal Theorem was introduced in a Nature Communications article in 2005 and has since contributed to the creation of the rich field of evolutionary graph theory. The theorem states under which conditions certain…
Evolutionary graph theory studies the evolutionary dynamics of populations structured on graphs. A central problem is determining the probability that a small number of mutants overtake a population. Currently, Monte Carlo simulations are…