# On the size of the block of 1 for $\varXi$-coalescents with dust

@inproceedings{Freund2017OnTS,
title={On the size of the block of 1 for \$\varXi\$-coalescents with dust},
author={Fabian Freund and Martin Mohle},
year={2017}
}
• Published 17 March 2017
• Mathematics

### Random Recursive Trees and the Bolthausen-Sznitman Coalesent

• Mathematics
• 2005
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

### Small-time behavior of beta coalescents

• Mathematics
• 2008
For a finite measureon (0,1), the �-coalescent is a coalescent process such that, whenever there are b clusters, each k-tuple of clusters merges into one at rate R 1 0 x k 2 (1 x) b k �(dx). It has

### -coalescents and stable Galton-Watson trees

• Mathematics
• 2013
. 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 β (3 / 2 , 1 /

### Coalescents with multiple collisions

k−2 � 1 − xb−k � � dx� . Call this process a � -coalescent. Discrete measure-valued processes derived from the � -coalescent model a system of masses undergoing coalescent collisions. Kingman's

### Asymptotics of the Minimal Clade Size and Related Functionals of Certain Beta-Coalescents

• Mathematics
• 2013
The Beta(2−α,α) n-coalescent with 1<α<2 is a Markov process taking values in the set of partitions of {1,…,n}. It evolves from the initial value {1},…,{n} by merging (coalescing) blocks together into