相关论文: Phase Transitions of the Moran Process and Algorit…

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 study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph $G$ on $n$ vertices, there exists an initial set consisting of a single vertex such that…

The Moran process is one of an basic mathematical structure in the evolutionary game theory. In this work, we introduce the formulation of the path integral approach for evolutionary game theory based on the Moran process. We derive the…

Broom and Rycht\'{a}\v{r} [Proc. R. Soc. A (2008) 464, 2609--2627] found an exact solution for the fixation probabilities of the Moran process for a structured population, in which the interaction structure among individuals is given by the…

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…

The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown that the complete suppression of fixation can be realized with…

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 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…

We examine birth--death processes with state dependent transition probabilities and at least one absorbing boundary. In evolution, this describes selection acting on two different types in a finite population where reproductive events occur…

We extend the Moran model with single-crossover recombination to include general recombination and mutation. We show that, in the case without resampling, the expectations of products of marginal processes defined via partitions of sites…

Evolution occurs in populations of reproducing individuals. In stochastic descriptions of evolutionary dynamics, such as the Moran process, individuals are chosen randomly for birth and for death. If the same type is chosen for both steps,…

The formula for the probability of fixation of a new mutation is widely used in theoretical population genetics and molecular evolution. Here we derive a series of identities, inequalities and approximations for the exact probability of…

We consider the contact process with infection rate $\lambda$ on a random $(d+1)$-regular graph with $n$ vertices, $G_n$. We study the extinction time $\tau_{G_n}$ (that is, the random amount of time until the infection disappears) as $n$…

The entropy rates of the Wright-Fisher process, the Moran process, and generalizations are computed and used to compare these processes and their dependence on standard evolutionary parameters. Entropy rates are measures of the variation…

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 paper is devoted to the study of the asymptotic behaviour of Moran process in random environment, say random selection. In finite population, the Moran process may be degenerate in finite time, thus we will study its limiting process in…

Population structure can be modelled by evolutionary graphs, which can have a substantial, but very subtle influence on the fate of the arising mutants. Individuals are located on the nodes of these graphs, competing with each other to…

We consider the so called Moran process with frequency dependent fitness given by a certain pay-off matrix. For finite populations, we show that the final state must be homogeneous, and show how to compute the fixation probabilities. Next,…

Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time step, blue vertices have a non-zero probability of forcing…

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…