-coalescents and stable Galton-Watson trees

From MaRDI portal
Publication:2941802

zbMATH Open1321.60170arXiv1303.6882MaRDI QIDQ2941802FDOQ2941802


Authors: Romain Abraham, Jean-François Delmas Edit this on Wikidata


Publication date: 25 August 2015

Abstract: Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the -coalescent. By considering a pruning procedure on stable Galton-Watson tree with n labeled leaves, we give a representation of the discrete -coalescent, with alphain[1/2,1) starting from the trivial partition of the n first integers. The construction can also be made directly on the stable continuum L{'e}vy tree, with parameter 1/alpha, simultaneously for all n. This representation allows to use results on the asymptotic number of coalescence events to get the asymptotic number of cuts in stable Galton-Watson tree (with infinite variance for the reproduction law) needed to isolate the root. Using convergence of the stable Galton-Watson tree conditioned to have infinitely many leaves, one can get the asymptotic distribution of blocks in the last coalescence event in the -coalescent.


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




Recommendations





Cited In (16)





This page was built for publication: \(\beta\)-coalescents and stable Galton-Watson trees

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