Philippe Marchal - A note on the fragmentation of a stable tree

dmtcs:3586 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science - https://doi.org/10.46298/dmtcs.3586
A note on the fragmentation of a stable treeArticle

Authors: Philippe Marchal 1

  • 1 Département de Mathématiques et Applications - ENS Paris

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.


Volume: DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
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]

16 Documents citing this article

Consultation statistics

This page has been seen 231 times.
This article's PDF has been downloaded 197 times.