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
NULL
Philippe Marchal
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.
Olivier Bodini;Julien David;Philippe Marchal, Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications, pp. 97-114, 2016, 10.1007/978-3-319-29221-2_9, https://hal.science/hal-00932993.
Bénédicte Haas;Robin Stephenson, 2015, Scaling limits of $k$-ary growing trees, Annales de l'Institut Henri Poincaré. B, Probabilités et statistiques/Annales de l'I.H.P. Probabilités et statistiques, 51, 4, 10.1214/14-aihp622, https://doi.org/10.1214/14-aihp622.
G. Miermont;B. Haas;J. Pitman;M. Winkel, 2008, Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models, Annals of probability, 36, 5, 10.1214/07-aop377, https://doi.org/10.1214/07-aop377.