Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A note on the fragme ...
Conference paper

A note on the fragmentation of a stable tree

Philippe Marchal (1) (2) (3)
(1) Département de Mathématiques et Applications - ENS Paris
(2) Département de Mathématiques et Applications - ENS-PSL
(3) Département de Mathématiques et Applications - ENS-PSL (UMR8553)
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2007
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Proceedings
DOI
10.46298/dmtcs.3586
License
https://about.hal.science/hal-authorisation-v1
Indicators
683
Views
595
Downloads

A note on the fragmentation of a stable tree

Philippe Marchal (1) (2) (3)
(1) Département de Mathématiques et Applications - ENS Paris
(2) Département de Mathématiques et Applications - ENS-PSL
(3) Département de Mathématiques et Applications - ENS-PSL (UMR8553)
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
  • [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]
  • stable tree
  • fragmentation
Cited by

Source: OpenCitations

  • A down‐up chain with persistent labels on multifurcating trees

    Random Structures and Algorithms

    Authors : Frederik Sørensen

    Journal reference : Volume 64, 2023, pp. 354-400

    DOI : 10.1002/rsa.21185
  • Decomposition of Lévy trees along their diameter

    Annales de l Institut Henri Poincaré Probabilités et Statistiques

    Authors : Thomas Duquesne, Minmin Wang ORCID

    Journal reference : Volume 53, 2017, pp.

    DOI : 10.1214/15-aihp725
  • Local limits of Markov branching trees and their volume growth

    Electronic Journal of Probability

    Authors : Camille Pagnard

    Journal reference : Volume 22, 2017, pp.

    DOI : 10.1214/17-ejp96
  • On the re-rooting invariance property of Lévy trees

    Electronic Communications in Probability

    Authors : Thomas Duquesne, Jean-Francois Le Gall ORCID

    Journal reference : Volume 14, 2009, pp.

    DOI : 10.1214/ecp.v14-1484
  • Scaling Limits of Markov-Branching Trees and Applications

    arXiv (Cornell University)

    Authors : Bénédicte Haas ORCID

    Journal reference : Volume , 2018, pp. 3-50

    DOI : 10.1007/978-3-319-77643-9_1
  • A new family of Markov branching trees: the alpha-gamma model

    Electronic Journal of Probability

    Authors : Bo Chen ORCID, Daniel Ford, Matthias Winkel ORCID

    Journal reference : Volume 14, 2009, pp.

    DOI : 10.1214/ejp.v14-616
  • Zooming in at the root of the stable tree

    Electronic Journal of Probability

    Authors : Michel Nassif ORCID

    Journal reference : Volume 27, 2022, pp.

    DOI : 10.1214/22-ejp764
  • A line-breaking construction of the stable trees

    Electronic Journal of Probability

    Authors : Christina Goldschmidt ORCID, Bénédicte Haas ORCID

    Journal reference : Volume 20, 2015, pp.

    DOI : 10.1214/ejp.v20-3690
  • Occupancy Problems Related to the Generalized Stirling Numbers

    Authors : Thierry E. Huillet ORCID

    Journal reference : Volume 191, 2023, pp.

    DOI : 10.1007/s10955-023-03216-1
  • Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions

    The Annals of Applied Probability

    Authors : Cyril Banderier ORCID, Markus Kuba ORCID, Michael Wallner ORCID

    Journal reference : Volume 34, 2024, pp.

    DOI : 10.1214/24-aap2076
  • Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications

    arXiv (Cornell University)

    Authors : Olivier Bodini ORCID, Julien David, Philippe Marchal

    Journal reference : Volume , 2016, pp. 97-114

    DOI : 10.1007/978-3-319-29221-2_9
  • Regenerative tree growth: structural results and convergence

    Electronic Journal of Probability

    Authors : Jim Pitman ORCID, Douglas Rizzolo ORCID, Matthias Winkel ORCID

    Journal reference : Volume 19, 2014, pp.

    DOI : 10.1214/ejp.v19-3040
  • Universal limits of substitution-closed permutation classes

    arXiv (Cornell University)

    Authors : Frédérique Bassino ORCID, Mathilde Bouvel, Valentin Féray ORCID, Lucas Gerin ORCID, Mickaël Maazoun, Adeline Pierrot

    Journal reference : Volume 22, 2020, pp. 3565-3639

    DOI : 10.4171/jems/993
  • A recursive distributional equation for the stable tree

    Bernoulli

    Authors : Nicholas Chee, Franz Rembart, Matthias Winkel ORCID

    Journal reference : Volume 30, 2024, pp.

    DOI : 10.3150/23-bej1623
  • And/or trees: A local limit point of view

    arXiv (Cornell University)

    Authors : Nicolas Broutin, Cécile Mailler ORCID

    Journal reference : Volume 53, 2018, pp. 15-58

    DOI : 10.1002/rsa.20758
  • Scaling limits for some random trees constructed inhomogeneously

    Electronic Journal of Probability

    Authors : Nathan Ross ORCID, Yuting Wen

    Journal reference : Volume 23, 2018, pp.

    DOI : 10.1214/17-ejp101
  • Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models

    The Annals of Probability

    Authors : Bénédicte Haas, Grégory Miermont, Jim Pitman, Matthias Winkel

    Journal reference : Volume 36, 2008, pp.

    DOI : 10.1214/07-aop377
  • Scaling limits of $k$-ary growing trees

    Annales de l Institut Henri Poincaré Probabilités et Statistiques

    Authors : Bénédicte Haas ORCID, Robin Stephenson ORCID

    Journal reference : Volume 51, 2015, pp.

    DOI : 10.1214/14-aihp622
  • Recursive construction of continuum random trees

    The Annals of Probability

    Authors : Franz Rembart, Matthias Winkel ORCID

    Journal reference : Volume 46, 2018, pp.

    DOI : 10.1214/17-aop1237
  • Geometry of weighted recursive and affine preferential attachment trees

    Electronic Journal of Probability

    Authors : Delphin Sénizergues

    Journal reference : Volume 26, 2021, pp.

    DOI : 10.1214/21-ejp640
  • The Horton–Strahler number of Galton–Watson trees with possibly infinite variance

    The Annals of Applied Probability

    Authors : Robin Khanfir ORCID

    Journal reference : Volume 35, 2025, pp.

    DOI : 10.1214/25-aap2204
  • The stable trees are nested

    Probability Theory and Related Fields

    Authors : Nicolas Curien, Bénédicte Haas ORCID

    Journal reference : Volume 157, 2012, pp. 847-883

    DOI : 10.1007/s00440-012-0472-x
Preview
Loading PDF preview...