SearcharxivSearch

arXiv subjects

Fabian Freund

Publications and source records attributed to Fabian Freund.

7 recordsLinked to original sources

Multiple-merger genealogies -- models, consequences, inference

Trees corresponding to $Λ$- and $Ξ$-$n$-coalescents can be both quite similar and fundamentally different compared to bifurcating tree models based on Kingman's $n$-coalescent. This has consequences for inference of a well-fitting gene genealogy as well as for assessing biological properties of species having such sample genealogies. Here, mathematical properties concerning clade sizes in the tree as well as changes of the tree when the samples are enlargened are highlighted. To be used as realistic genealogy models for real populations, an extension for changing population sizes is discussed.

math.PR

Cannings models, population size changes and multiple-merger coalescents

Multiple-merger coalescents, e.g. $Λ$-$n$-coalescents, have been proposed as models of the genealogy of $n$ sampled individuals for a range of populations whose genealogical structures are not captured well by Kingman's $n$-coalescent. $Λ$-$n$-coalescents can be seen as the limit process of the discrete genealogies of Cannings models with fixed population size, when time is rescaled and population size $N\to\infty$. As established for Kingman's $n$-coalescent, moderate population size fluctuations in the discrete population model should be reflected by a time-change of the limit coalescent. For $Λ$-$n$-coalescents, this has been explicitly shown for only a limited subclass of $Λ$-$n$-coalescents and exponentially growing populations. This article gives a general construction of time-changed $Λ$-$n$-coalescents as limits of specific Cannings models with rather arbitrary time changes.

math.PR

The minimal observable clade size of exchangeable coalescents

For $Λ$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other $j\in\{1,\ldots,n\}$. We provide asymptotics of $O_n$ for $n\to\infty$ and a recursion for all moments of $O_n$ for finite $n$. This variable gives an upper bound for the minimal clade size [2], which is not observable in real data. In applications to genetics, it has been shown to be useful to lower classification errors in genealogical model selection [10].

math.PR

On the size of the block of 1 for $\varXi$-coalescents with dust

We study the frequency process $f_1$ of the block of 1 for a $\varXi$-coalescent $\varPi$ with dust. If $\varPi$ stays infinite, $f_1$ is a jump-hold process which can be expressed as a sum of broken parts from a stick-breaking procedure with uncorrelated, but in general non-independent, stick lengths with common mean. For Dirac-$\varLambda$-coalescents with $\varLambda=δ_p$, $p\in[\frac{1}{2},1)$, $f_1$ is not Markovian, whereas its jump chain is Markovian. For simple $\varLambda$-coalescents the distribution of $f_1$ at its first jump, the asymptotic frequency of the minimal clade of 1, is expressed via conditionally independent shifted geometric distributions.

math.PR

Minimal clade size in the Bolthausen-Sznitman coalescent

This article shows the asymptotics of distribution and moments of the size $X_n$ of the minimal clade of a randomly chosen individual in a Bolthausen-Sznitman $n$-coalescent for $n\to\infty$. The Bolthausen-Sznitman $n$-coalescent is a Markov process taking states in the set of partitions of $\left\{1,\ldots,n\right\}$, where $1,\ldots,n$ are referred to as individuals. The minimal clade of an individual is the equivalence class the individual is in at the time of the first coalescence event this individual participates in.\\ The main tool used is the connection of the Bolthausen-Sznitman $n$-coalescent with random recursive trees introduced by Goldschmidt and Martin (see \cite{goldschmidtmartin}). This connection shows that $X_n-1$ is distributed as the number $M_n$ of all individuals not in the equivalence class of individual 1 shortly before the time of the last coalescence event. Both functionals are distributed like the size $RT_{n-1}$ of an uniformly chosen table in a standard Chinese restaurant process with $n-1$ customers.We give exact formulae for these distributions.\\ Using the asymptotics of $M_n$ shown by Goldschmidt and Martin in \cite{goldschmidtmartin}, we see $(\log n)^{-1}\log X_n$ converges in distribution to the uniform distribution on [0,1] for $n\to\infty$.\\ We provide the complimentary information that $\frac{\log n}{n^k}E(X_n^k)\to \frac{1}{k}$ for $n\to\infty$, which is also true for $M_n$ and $RT_n$.

math.PR

On the length of an external branch in the Beta-coalescent

In this paper, we consider Beta$(2-α,α)$ (with $1<α<2$) and related $Λ$-coalescents. If $T^{(n)}$ denotes the length of an external branch of the $n$-coalescent, we prove the convergence of $n^{α-1}T^{(n)}$ when $n$ tends to $ \infty $, and give the limit. To this aim, we give asymptotics for the number $σ^{(n)}$ of collisions which occur in the $n$-coalescent until the end of the chosen external branch, and for the block counting process associated with the $n$-coalescent.

math.PR

On the number of allelic types for samples taken from exchangeable coalescents with mutation

Let $K_n$ denote the number of types of a sample of size $n$ taken from an exchangeable coalescent process ($Ξ$-coalescent) with mutation. A distributional recursion for the sequence $(K_n)_{n\in{\mathbb N}}$ is derived. If the coalescent does not have proper frequencies, i.e., if the characterizing measure $Ξ$ on the infinite simplex $Δ$ does not have mass at zero and satisfies $\int_Δ|x|Ξ(dx)/(x,x)<\infty$, where $|x|:=\sum_{i=1}^\infty x_i$ and $(x,x):=\sum_{i=1}^\infty x_i^2$ for $x=(x_1,x_2,...)\inΔ$, then $K_n/n$ converges weakly as $n\to\infty$ to a limiting variable $K$ which is characterized by an exponential integral of the subordinator associated with the coalescent process. For so-called simple measures $Ξ$ satisfying $\int_ΔΞ(dx)/(x,x)<\infty$ we characterize the distribution of $K$ via a fixed-point equation.

math.PR