Related papers: Chromosome Painting: how recombination mixes ances…
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…
A large offspring number diploid biparental multilocus population model of Moran type is our object of study. At each timestep, a pair of diploid individuals drawn uniformly at random contribute offspring to the population. The number of…
In the human genomes, recombination frequency between homologous chromosomes during meiosis is highly correlated with their physical length while it differs significantly when their coding density is considered. Furthermore, it has been…
We study the continuous-time evolution of the recombination equation of population genetics. This evolution is given by a differential equation that acts on a product probability space, and its solution can be described by a Markov chain on…
Given $n>0$, let $S\subset [0,1]^2$ be a set of $n$ points, chosen uniformly at random. Let $R\cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is included in $R$ uniformly at random with probability $1/2$.…
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…
Resources are rarely distributed uniformly within a population. Heterogeneity in the concentration of a drug, the quality of breeding sites, or wealth can all affect evolutionary dynamics. In this study, we represent a collection of…
We define the Sampled Moran Genealogy Process, a continuous-time Markov process on the space of genealogies with the demography of the classical Moran process, sampled through time. To do so, we begin by defining the Moran Genealogy Process…
We consider two versions of stochastic population models with mutation and selection. The first approach relies on a multitype branching process; here, individuals reproduce and change type (i.e., mutate) independently of each other,…
We reconsider the Moran model in continuous time with population size $N$, two allelic types, and selection. We introduce a new particle representation, which we call the labelled Moran model, and which has the same distribution of type…
We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…
Consider the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…
We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…
We discuss two different ways of chromosomes' and genomes' evolution. Purifying selection dominates in large panmictic populations, where Mendelian law of independent gene assortment is valid. If the populations are small, recombination…
Coalescent processes, including mutation, are derived from Moran type population models admitting large offspring numbers. Including mutation in the coalescent process allows for quantifying the turnover of alleles by computing the…
We consider a multi-type Moran model (in continuous time) with selection and type-dependent mutation. This paper is concerned with the evolution of genealogical information forward in time. For this purpose we define and analytically…
We analyse sequential Markov coalescent algorithms for populations with demographic structure: for a bottleneck model, a population-divergence model, and for a two-island model with migration. The sequential Markov coalescent method is an…
This work approaches human chromosome mapping by developing algorithms for ordering markers associated with radiation hybrid data. Motivated by recent work of Boehnke et al. [1], we formulate the ordering problem by developing stochastic…
Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…