A note on the fragmentation of a stable tree

Abstract

We introduce a recursive algorithm generating random trees, which we identify as skeletons of a continuous, stable tree. We deduce a representation of a fragmentation process on these trees.

Keywords

• stable tree
• fragmentation
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
• [math.math-ds] mathematics [math]/dynamical systems [math.ds]
• [math.math-co] mathematics [math]/combinatorics [math.co]