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. Non-crossing trees r ...
Conference paper

Non-crossing trees revisited: cutting down and spanning subtrees

Alois Panholzer (1)
(1) Institut für Algebra und Computermathematik
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Proceedings
DOI
10.46298/dmtcs.3327
License
https://about.hal.science/hal-authorisation-v1
Indicators
765
Views
512
Downloads

Non-crossing trees revisited: cutting down and spanning subtrees

Alois Panholzer (1)
(1) Institut für Algebra und Computermathematik
Abstract
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree. For both quantities, we are able to characterise for $n → ∞$ the limiting distributions. Non-crossing trees are almost conditioned Galton-Watson trees, and it has been already shown, that the contour and other usually associated discrete excursions converge, suitable normalised, to the Brownian excursion. We can interpret parameter $\textit{(ii)}$ as a functional of a conditioned random walk, and although we do not have such an interpretation for parameter $\textit{(i)}$, we obtain here limiting distributions, that are also arising as limits of some functionals of conditioned random walks.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Non-crossing trees
  • generating function
  • limiting distributions
Cited by

Source: OpenCitations

  • On moment sequences and mixed Poisson distributions

    Probability Surveys

    Authors : Markus Kuba ORCID, Alois Panholzer ORCID

    Journal reference : Volume 13, 2016, pp.

    DOI : 10.1214/14-ps244
  • 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 cutting and records in deterministic and random trees

    Random Structures and Algorithms

    Authors : Svante Janson ORCID

    Journal reference : Volume 29, 2005, pp. 139-179

    DOI : 10.1002/rsa.20086
  • A modification of the random cutting model

    Advances in Applied Probability

    Authors : Fabian Burghart

    Journal reference : Volume 56, 2023, pp. 287-314

    DOI : 10.1017/apr.2023.22
  • On the number of jumps of random walks with a barrier

    Advances in Applied Probability

    Authors : Alex Iksanov ORCID, Martin Möhle ORCID

    Journal reference : Volume 40, 2008, pp. 206-228

    DOI : 10.1239/aap/1208358893
  • Random Records and Cuttings in Complete Binary Trees

    Birkhäuser Basel eBooks

    Authors : Svante Janson ORCID

    Journal reference : Volume , 2004, pp. 241-253

    DOI : 10.1007/978-3-0348-7915-6_24
  • Destruction of Very Simple Trees

    arXiv (Cornell University)

    Authors : James Allen Fill, Nevin Kapur, Alois Panholzer

    Journal reference : Volume 46, 2006, pp. 345-366

    DOI : 10.1007/s00453-006-0100-1
  • Cutting down trees with a Markov chainsaw

    The Annals of Applied Probability

    Authors : Louigi Addario-Berry ORCID, Nicolas Broutin, Cecilia Holmgren ORCID

    Journal reference : Volume 24, 2014, pp.

    DOI : 10.1214/13-aap978
Preview
Loading PDF preview...