A Construction of a β-Coalescent via the Pruning of Binary Trees
A Construction of a β-Coalescent via the Pruning of Binary Trees
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 …