On the contour of random trees

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 4, 1999, Pages 434-458

  Gittenberger, Bernhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Branching processes; Brownian excursion; Generating functions; Random trees; Singularity analysis

Indexed keywords

EID: 0009177395     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195289928     Document Type: Article

References (13)

1. D. J. ALDOUS, The continuum random tree I, Ann. Probab., 19 (1991), pp. 1-28.
2. D. J. ALDOUS. The continuum random tree II: An overview, in Stochastic Analysis, M. T. Barlow and. N. H. Bingham, eds., Cambridge University Press, Cambridge, UK, 1991, pp. 23-70.
3. D. J. ALDOUS, The continuum random tree III, Ann. Probab., 21 (1993), pp. 248-289.
4. P BILLINGSLEY, Convergence of Probability Measures, John Wiley, New York, 1968.
5. M. DRMOTA, Asymptotic distributions and a multivariate Darboux method in enumeration problems, J. Combin Theory Ser. A, 67 (1994), pp. 169-184.
6. M. DRMOTA, The height distribution of leaves in rooted trees, Discrete Math. Appl., 4 (1994), pp. 45-58 (translated from Diskret. Mat., 6 (1994), pp. 67-82).
7. M. DRMOTA, The height distribution of leaves in rooted trees, Discrete Math. Appl., 4 (1994), pp. 45-58 (translated from Diskret. Mat., 6 (1994), pp. 67-82).
8. M. DRMOTA AND M. SORIA, Marking in combinatorial constructions: Generating functions and limiting distributions, Theoret. Comput. Sci., 144 (1995), pp. 67-99.
9. P. FLAJOLET AND A. ODLYZKO, Singularity analysis of generating functions, SIAM J. Discrete Math., 3 (1990), pp. 216-240.
10. W. GUTJAHR AND G. CH. PFLUG, The asymptotic contour process of a binary tree is a Brownian excursion, Stochastic Process. Appl., 41 (1992), pp. 69-89.
11. K. ITÔ AND H. P. MCKEAN, JR., Diffusion Processes and Their Sample Paths, Springer-Verlag, New York, 1965.
12. A. MEIR AND J. W. MOON, On the altitude of nodes in random trees, Canad. J. Math., 30 (1978), pp. 997-1015.
13. J. S. VITTER AND P. FLAJOLET, Average-case analysis of algorithms and data structures, in Handbook of Theoretical Computer Science, Algorithms and Complexity, Vol. A, J. van Leeuwen, ed., North-Holland, Amsterdam, 1990, pp. 431-524.