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. Profiles of random t ...
Conference paper

Profiles of random trees: plane-oriented recursive trees

Hsien-Kuei Hwang ORCID (1) (2)
(1) Institute of Statistical Science
(2) Institute of Statistical Science [Tapei]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3361
License
https://about.hal.science/hal-authorisation-v1
Indicators
599
Views
646
Downloads

Profiles of random trees: plane-oriented recursive trees

Hsien-Kuei Hwang ORCID (1) (2)
(1) Institute of Statistical Science
(2) Institute of Statistical Science [Tapei]
Abstract
We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the correlation coefficients of two level sizes. We also unveil an unexpected connection between the profile of plane-oriented recursive trees (with logarithmic height) and that of random binary trees (with height proportional to the square root of tree size).
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]
  • [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
  • random binary trees
  • Plane-oriented recursive trees
  • profile of trees
  • limit distribution
  • convergence of all moments
  • total path length
Cited by

Source: OpenCitations

  • The shape of unlabeled rooted random trees

    European Journal of Combinatorics

    Authors : Michael Drmota ORCID, Bernhard Gittenberger ORCID

    Journal reference : Volume 31, 2010, pp. 2028-2063

    DOI : 10.1016/j.ejc.2010.05.011
  • Long and short paths in uniform random recursive dags

    Arkiv för matematik

    Authors : Luc Devroye ORCID, Svante Janson ORCID

    Journal reference : Volume 49, 2010, pp. 61-77

    DOI : 10.1007/s11512-009-0118-0
  • Width and mode of the profile for some random trees of logarithmic height

    The Annals of Applied Probability

    Authors : Luc Devroye ORCID, Hsien-Kuei Hwang ORCID

    Journal reference : Volume 16, 2006, pp.

    DOI : 10.1214/105051606000000187
  • Profile of Tries

    Lecture notes in computer science

    Authors : G. Park, H. -K Hwang ORCID, P. Nicodème, W. Szpankowski ORCID

    Journal reference : Volume , 2008, pp. 1-11

    DOI : 10.1007/978-3-540-78773-0_1
Preview
Loading PDF preview...