Related papers: The external lengths in Kingman's coalescent
In the Kingman coalescent tree the length of order $r$ is defined as the sum of the lengths of all branches that support $r$ leaves. For $r=1$ these branches are external, while for $r\ge2$ they are internal and carry a subtree with $r$…
We consider a ${\Lambda}$-coalescent and we study the asymptotic behavior of the total length $L^{(n)}_{ext}$ of the external branches of the associated $n$-coalescent. For Kingman coalescent, i.e. ${\Lambda}={\delta}_0$, the result is well…
$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…
The evolving Kingman coalescent is the tree-valued process which records the time evolution undergone by the genealogies of Moran populations. We consider the associated process of total external tree length of the evolving Kingman…
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…
Kingman's coalescent is a widely used process to model sample genealogies in population genetics. Recently there have been studies on the inference of quantities related to the genealogy of additional individuals given a known sample. This…
We study tree lengths in $\Lambda$-coalescents without a dust component from a sample of $n$ individuals. For the total length of all branches and the total length of all external branches we present laws of large numbers in full…
Kingman's coalescent is a random tree that arises from classical population genetic models such as the Moran model. The individuals alive in these models correspond to the leaves in the tree and the following two laws of large numbers…
We introduce a generalization of Kingman's coalescent on $[n]$ that we call the Kingman coalescent on a graph $G = ([n],E)$. Specifically, we generalize a forest valued representation of the coalescent introduced in Addario-Berry and Eslava…
We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…
Let $\mathbb{T}^d_N$, $d\ge 2$, be the discrete $d$-dimensional torus with $N^d$ points. Place a particle at each site of $\mathbb{T}^d_N$ and let them evolve as independent, nearest-neighbor, symmetric, continuous-time random walks. Each…
A well-established model for the genealogy of a large population in equilibrium is Kingman's coalescent. For the population together with its genealogy evolving in time, this gives rise to a time-stationary tree-valued process. We study the…
This paper provides a new construction of \Lambda-coalescents called "measure division construction". This construction is pathwise and consists of dividing the characteristic measure \Lambda into several parts and adding them one by one to…
We study the total mass of the solution to the parabolic Anderson model on a regular tree with an i.i.d. random potential whose marginal distribution is double-exponential. In earlier work we identified two terms in the asymptotic expansion…
Kingman derived the Ewens sampling formula for random partitions describing the genetic variation in a neutral mutation model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process, and…
It is shown how a natural representation of perpetuities as asymptotically homogeneous in space Markov chains allows to prove various asymptotic tail results for stable perpetuities and limit theorems for unstable ones. Some of these…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
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…
Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is…
Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course…