Translator Disclaimer
2005 Random Recursive Trees and the Bolthausen-Sznitman Coalesent
Christina Goldschmidt, James Martin
Author Affiliations +
Electron. J. Probab. 10: 718-745 (2005). DOI: 10.1214/EJP.v10-265

Abstract

We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to $[n]$: we show that the distribution of the number of blocks involved in the final collision converges as $n\to\infty$, and obtain a scaling law for the sizes of these blocks. We also consider the discrete-time Markov chain giving the number of blocks after each collision of the coalescent restricted to $[n]$; we show that the transition probabilities of the time-reversal of this Markov chain have limits as $n\to\infty$. These results can be interpreted as describing a "post-gelation" phase of the Bolthausen-Sznitman coalescent, in which a giant cluster containing almost all of the mass has already formed and the remaining small blocks are being absorbed.

Citation

Download Citation

Christina Goldschmidt. James Martin. "Random Recursive Trees and the Bolthausen-Sznitman Coalesent." Electron. J. Probab. 10 718 - 745, 2005. https://doi.org/10.1214/EJP.v10-265

Information

Accepted: 14 July 2005; Published: 2005
First available in Project Euclid: 1 June 2016

zbMATH: 1109.60060
MathSciNet: MR2164028
Digital Object Identifier: 10.1214/EJP.v10-265

JOURNAL ARTICLE
28 PAGES


SHARE
Vol.10 • 2005
Back to Top