Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T01:31:23.106Z Has data issue: false hasContentIssue false

A Construction of a β-Coalescent via the Pruning of Binary Trees

Published online by Cambridge University Press:  30 January 2018

Romain Abraham*
Affiliation:
Université d'Orléans
Jean-François Delmas*
Affiliation:
École des Ponts et Chaussées
*
∗ Postal address: Laboratoire MAPMO, CNRS, UMR 6628, Fédération Denis Poisson, FR 2964, Université d'Orléans, B.P. 6759, 45067 Orléans cedex 2, France. Email address: romain.abraham@univ-orleans.fr
∗∗ Postal address: Université Paris-Est, École des Ponts, CERMICS, 6-8 Avenue Blaise Pascal, Champs-sur-Marne, 77455 Marne La Vallée, France.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a β(3/2,1/2)-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous's continuum random tree, to construct a continuous state space process that has the same structure as the β-coalescent process up to some time change. These two constructions enable us to obtain results on the coalescent process, such as the asymptotics on the number of coalescent events or the law of the blocks involved in the last coalescent event.

Information

Type
Research Article
Copyright
© Applied Probability Trust