38 citations · 38 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.PR2016
A binary embedding of the stable line-breaking construction
Franz Rembart, Matthias Winkel
We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be ob…
math.PR2016
Recursive construction of continuum random trees
Franz Rembart, Matthias Winkel
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a…