Related papers: The ancestral selection graph for a $\Lambda$-asym…
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 introduce a modified spatial $\Lambda$-Fleming-Viot process to model the ancestry of individuals in a population occupying a continuous spatial habitat divided into two areas by a sharp discontinuity of the dispersal rate and effective…
We consider two population models subject to the evolutionary forces of selection and mutation, the Moran model and the $\Lambda$-Wright-Fisher model. In such models the block counting process traces back the number of potential ancestors…
We consider the mutation--selection differential equation with pairwise interaction (or, equivalently, the diploid mutation--selection equation) and establish the corresponding ancestral process, which is a random tree and a variant of the…
A key question in evolution is how likely a mutant is to take over. This depends on natural selection and on stochastic fluctuations. Population spatial structure can impact mutant fixation probabilities. We introduce a model for structured…
Many mathematical models of evolution assume that all individuals experience the same environment. Here, we study the Moran process in heterogeneous environments. The population is of finite size with two competing types, which are exposed…
To understand the effect of assortative mating on the genetic evolution of a population, we consider a finite population in which each individual has a type, determined by a sequence of n diallelic loci. We assume that the population…
Inference of the marginal likelihood of sample allele configurations using backward algorithms yields identical results with the Kingman coalescent, the Moran model, and the diffusion model (up to a scaling of time). For inference of…
More and more evidence shows that mating preference is a mechanism that may lead to a reproductive isolation event. In this paper, a haploid population living on two patches linked by migration is considered. Individuals are ecologically…
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…
The growing probabilities of additional offspring with the beneficial reversal allele for various population sizes, $N$, sequence lengths, $L$, selective advantages, $s$, fitness parameters, $k$, and measuring parameters, $C$, were…
Correctly capturing the symmetry transformations of data can lead to efficient models with strong generalization capabilities, though methods incorporating symmetries often require prior knowledge. While recent advancements have been made…
Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate.…
We consider a metapopulation made up of $K$ demes, each containing $N$ individuals bearing a heritable quantitative trait. Demes are connected by migration and undergo independent Moran processes with mutation and selection based on trait…
The Moran process is a foundational model of genetic drift and mutation in finite populations. In its standard two-allele form with population size $n$, allele counts, and hence allele frequencies, change through stochastic replacement and…
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…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
We analyse a model consisting of a population of individuals which is subdivided into a finite set of demes, each of which has a fixed but differing number of individuals. The individuals can reproduce, die and migrate between the demes…
Traditional Genetic Algorithms (GAs) mating schemes select individuals for crossover independently of their genotypic or phenotypic similarities. In Nature, this behaviour is known as random mating. However, non-random schemes - in which…
We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of…