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. A functional limit l ...
Conference paper

A functional limit law for the profile of plane-oriented recursive trees.

Henning Sulzbach (1)
(1) Institute for Mathematics [Frankfurt ]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2007
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Proceedings
DOI
10.46298/dmtcs.3575
License
https://about.hal.science/hal-authorisation-v1
Indicators
497
Views
765
Downloads

A functional limit law for the profile of plane-oriented recursive trees.

Henning Sulzbach (1)
(1) Institute for Mathematics [Frankfurt ]
Abstract
We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • plane-oriented recursive trees
  • random trees
  • profile of trees
  • preferential attachment
  • branching random walk
  • martingales
  • analysis of algorithms
Cited by

Source: OpenCitations

  • General Edgeworth expansions with applications to profiles of random trees

    The Annals of Applied Probability

    Authors : Zakhar Kabluchko ORCID, Alexander Marynych ORCID, Henning Sulzbach

    Journal reference : Volume 27, 2017, pp.

    DOI : 10.1214/17-aap1285

  • 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

  • A functional limit theorem for the profile of b-ary trees

    arXiv (Cornell University)

    Authors : Eva-Maria Schopp

    Journal reference : Volume 20, 2010, pp.

    DOI : 10.1214/09-aap640

  • Measure-valued Pólya urn processes

    Electronic Journal of Probability

    Authors : Cécile Mailler ORCID, Jean-François Marckert ORCID

    Journal reference : Volume 22, 2017, pp.

    DOI : 10.1214/17-ejp47

  • Edgeworth expansions for profiles of lattice branching random walks

    arXiv (Cornell University)

    Authors : Rudolf Grübel ORCID, Zakhar Kabluchko ORCID

    Journal reference : Volume 53, 2017, pp.

    DOI : 10.1214/16-aihp785

  • Geometry of weighted recursive and affine preferential attachment trees

    Electronic Journal of Probability

    Authors : Delphin Sénizergues

    Journal reference : Volume 26, 2021, pp.

    DOI : 10.1214/21-ejp640
Preview
Loading PDF preview...