scholarly journals Reversing the cut tree of the Brownian continuum random tree

2017 ◽  
Vol 22 (0) ◽  
Author(s):  
Nicolas Broutin ◽  
Minmin Wang
1993 ◽  
Vol 21 (1) ◽  
pp. 248-289 ◽  
Author(s):  
David Aldous

2013 ◽  
Vol 50 (3) ◽  
pp. 772-790 ◽  
Author(s):  
Romain Abraham ◽  
Jean-François Delmas

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.


2013 ◽  
Vol 50 (03) ◽  
pp. 772-790 ◽  
Author(s):  
Romain Abraham ◽  
Jean-François Delmas

Considering a random binary tree withnlabelled 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.


1991 ◽  
Vol 19 (1) ◽  
pp. 1-28 ◽  
Author(s):  
David Aldous

Sign in / Sign up

Export Citation Format

Share Document