Noncrossing trees are almost conditioned Galton–Watson trees
Authors:
- 4 December 2001
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 20 (1) , 115-125
Abstract
A noncrossing tree (NC‐tree) is a tree drawn on the plane having as vertices a set of points on the boundary of a circle, and whose edges are straight line segments that do not cross. In this article, we show that NC‐trees with size n are conditioned Galton–Watson trees. As corollaries, we give the limit law of depth‐first traversal processes and the limit profile of NC‐trees. © 2002 John Wiley & Sons, Inc. Random Struct. Alg., 20, 115–125, 2002Keywords
This publication has 12 references indexed in Scilit:
- The Brownian excursion multi-dimensional local time densityJournal of Applied Probability, 1999
- Analytic combinatorics of non-crossing configurationsDiscrete Mathematics, 1999
- The Brownian excursion multi-dimensional local time densityJournal of Applied Probability, 1999
- Enumeration of noncrossing trees on a circleDiscrete Mathematics, 1998
- Largest component in random combinatorial structuresDiscrete Mathematics, 1998
- Brownian Excursion Conditioned on Its Local TimeElectronic Communications in Probability, 1998
- On the profile of random treesRandom Structures & Algorithms, 1997
- The Continuum Random Tree IIIThe Annals of Probability, 1993
- The brownian excursion area: a numerical analysisComputers & Mathematics with Applications, 1984
- The distribution of the maximum Brownian excursionJournal of Applied Probability, 1976