Random recursive trees and the Bolthausen-Sznitman coalescent

From MaRDI portal
Publication:850360

DOI10.1214/EJP.V10-265zbMATH Open1109.60060arXivmath/0502263OpenAlexW2088688045MaRDI QIDQ850360FDOQ850360


Authors: Christina Goldschmidt, James Martin Edit this on Wikidata


Publication date: 3 November 2006

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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 tends to infinity, 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 tends to infinity. 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.


Full work available at URL: https://arxiv.org/abs/math/0502263




Recommendations




Cited In (44)





This page was built for publication: Random recursive trees and the Bolthausen-Sznitman coalescent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850360)