相关论文: Amplifiers for the Moran Process
Wright-Fisher diffusions and their dual ancestral graphs occupy a central role in the study of allele frequency change and genealogical structure, and they provide expressions, explicit in some special cases but generally implicit, for the…
We demonstrate a vast expansion of the theory of evolutionary stability to finite populations with mutation, connecting the theory of the stationary distribution of the Moran process with the Lyapunov theory of evolutionary stability. We…
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…
Motivated by the question of the impact of selective advantage in populations with skewed reproduction mechanims, we study a Moran model with selection. We assume that there are two types of individuals, where the reproductive success of…
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…
A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…
We study the large population limit of a multi-strategy discrete-time Moran process in the weak selection regime. We show that the replicator dynamics is interpreted as the large-population limit of the Moran process. This result is…
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 Moran model in continuous time with two types, mutation, and selection. We concentrate on the ancestral line and its stationary type distribution. Building on work by Fearnhead (J. Appl. Prob. 39 (2002), 38-54) and Taylor…
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or gets extinct. The outcome naturally depends on the…
An evolving Riemannian manifold $(M,g_t)_{t\in I}$ consists of a smooth $d$-dimensional manifold $M$, equipped with a geometric flow $g_t$ of complete Riemannian metrics, parametrized by $I=(-\infty,T)$. Given an additional $C^{1,1}$ family…
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,…
Our goal is to study the genetic composition of a population in which each individual has 2 parents, who contribute equally to the genome of their ospring. We use a biparental Moran model, which is characterized by its xed number N of…
We introduce a class of paired binary matrices called admixed arrays, which arise in analyses of large-scale genetic data and can be viewed as weighted edge colorings of complete bipartite graphs. This combinatorial structure gives rise to…
The Moran model with recombination is considered, which describes the evolution of the genetic composition of a population under recombination and resampling. There are $n$ sites (or loci), a finite number of letters (or alleles) at every…
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…
We consider a population of N individuals, whose dynamics through time is represented by a biparental Moran model with two types: an advantaged type and a disadvantaged type. The advantage is due to a mutation, transmitted in a Mendelian…
Evolutionary graph theory is the study of evolutionary dynamics in structured populations. A well-known problem in evolutionary graph theory is that the spread of mutation (measured by fixation probability) is impacted by the graph type…
An efficient implicit representation of an $n$-vertex graph $G$ in a family $\mathcal{F}$ of graphs assigns to each vertex of $G$ a binary code of length $O(\log n)$ so that the adjacency between every pair of vertices can be determined…
We study a population of $N$ individuals evolving according to a biparental Moran model with two types, one being advantaged compared to the other. The advantage is conferred by a Mendelian mutation, which reduces the death probability of…