相关论文: Fixation probability on clique-based graphs
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…
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 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…
The Moran process, as studied by [Lieberman, E., Hauert, C. and Nowak, M. Evolutionary dynamics on graphs. Nature 433, pp. 312-316 (2005)], is a stochastic process modeling the spread of genetic mutations in populations. In this process,…
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,…
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…
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…
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 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…
We consider the modified Moran process on graphs to study the spread of genetic and cultural mutations on structured populations. An initial mutant arises either spontaneously (aka \emph{uniform initialization}), or during reproduction (aka…
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…
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present the first known examples of undirected structures acting as suppressors of selection for any fitness…
Population structures can be crucial determinants of evolutionary processes. For the Moran process on graphs certain structures suppress selective pressure, while others amplify it (Lieberman et al. 2005 Nature 433 312-316). Evolutionary…
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…
We study the effect of the mutant's degree on the fixation probability, extinction and fixation times, in the Moran process on Erd\"{o}s-R\'{e}nyi and Barab\'{a}si-Albert graphs. We performed stochastic simulations and use mean-field type…
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…
In evolutionary dynamics, a key measure of a mutant trait's success is the probability that it takes over the population given some initial mutant-appearance distribution. This "fixation probability" is difficult to compute in general, as…
Fixation probabilities are essential for characterizing stochastic evolutionary dynamics, but analytical results remain limited mainly to systems with two competing types. We develop a perturbative framework to compute fixation…
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…