Noncrossing trees are almost conditioned Galton–Watson trees
From MaRDI portal
Publication:4534222
DOI10.1002/rsa.10016zbMath1003.60077OpenAlexW2109140497MaRDI QIDQ4534222
Alois Panholzer, Jean-François Marckert
Publication date: 9 January 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10016
Trees (05C05) Brownian motion (60J65) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (5)
Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees ⋮ The distance profile of rooted and unrooted simply generated trees ⋮ Random non-crossing plane configurations: A conditioned Galton-Watson tree approach ⋮ Simply Generated Non-Crossing Partitions ⋮ The dual tree of a recursive triangulation of the disk
Cites Work
- Unnamed Item
- The Brownian excursion area: A numerical analysis
- Brownian excursion conditioned on its local time
- Analytic combinatorics of non-crossing configurations
- Largest component in random combinatorial structures
- Enumeration of noncrossing trees on a circle
- The continuum random tree. III
- On the profile of random trees
This page was built for publication: Noncrossing trees are almost conditioned Galton–Watson trees
