Related papers: Mutations on a Random Binary Tree with Measured Bo…
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the…
The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
The affine group of a tree is the group of the isometries of a homogeneous tree that fix an end of its boundary. Consider a probability measure on this group and the associated random walk. The main goal of this paper is to determine the…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller…
The extremal process of a branching random walk is the point measure recording the position of particles alive at time $n$, shifted around the expected position of the minimal position. Madaule proved that this point measure converges, as…
We derive exact formulae for the allele frequency spectrum under the coalescent with mutation, conditioned on allele counts at some fixed time in the past. We consider unlinked biallelic markers mutating according to a finite sites, or…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…
In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
The coalescent is a stochastic process representing ancestral lineages in a population undergoing neutral genetic drift. Originally defined for a well-mixed population, the coalescent has been adapted in various ways to accommodate spatial,…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
To introduce selection into a model of coalescence, I explore the use of modified integer partitions that allow the identification of a preferred lineage. I show that a partition-partition transition matrix, along with Monte Carlo discrete…
In this paper, we review recent results of ours concerning branching processes with general lifetimes and neutral mutations, under the infinitely many alleles model, where mutations can occur either at birth of individuals or at a constant…
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…
In the case of neutral populations of fixed sizes in equilibrium whose genealogies are described by the Kingman $N$-coalescent back from time $t$ consider the associated processes of total tree length as $t$ increases. We show that the…