Minimal clade size in the Bolthausen-Sznitman coalescent

preprint2013arXivOpen access

Abstract

This article shows the asymptotics of distribution and moments of the size XnX_n of the minimal clade of a randomly chosen individual in a Bolthausen-Sznitman nn-coalescent for n→∞n\to\infty. The Bolthausen-Sznitman nn-coalescent is a Markov process taking states in the set of partitions of {1,…,n}\left\{1,\ldots,n\right\}, where 1,…,n1,\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 nn-coalescent with random recursive trees introduced by Goldschmidt and Martin (see \cite{goldschmidtmartin}). This connection shows that Xn−1X_n-1 is distributed as the number MnM_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 RTn−1RT_{n-1} of an uniformly chosen table in a standard Chinese restaurant process with n−1n-1 customers.We give exact formulae for these distributions.\\ Using the asymptotics of MnM_n shown by Goldschmidt and Martin in \cite{goldschmidtmartin}, we see (log⁡n)−1log⁡Xn(\log n)^{-1}\log X_n converges in distribution to the uniform distribution on [0,1] for n→∞n\to\infty.\\ We provide the complimentary information that log⁡nnkE(Xnk)→1k\frac{\log n}{n^k}E(X_n^k)\to \frac{1}{k} for n→∞n\to\infty, which is also true for MnM_n and RTnRT_n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.