Analysis of generating functions and probabilities on trees
The author considers simply generated families of tree and employs analytic tools, the saddle point method and singularity analysis, in order to obtain asymptotic estimates for the coefficients of generating functions counting trees with specific parameters. As an application, he proves an asymptotic formula for the number of rooted trees in a simply generated family of size \(n\) with \(l\) leaves such that the \(m\)th leaf has height \(k\). Under suitable conditions the height of the \(m\)th leaf is Maxwell distributed. He also states that the corresponding contour process converges to Brownian excursion.NEWLINENEWLINEFor the entire collection see [Zbl 0968.00043].
- Generating functions for generating trees
- Generating functions for multi-labeled trees
- Counting contours on trees
- The Gorin-Shkolnikov identity and its random tree generalization
- Simply generated trees, B-series and Wigner processes
- scientific article; zbMATH DE number 4029605 (Why is no real title available?)
- scientific article; zbMATH DE number 68919 (Why is no real title available?)
- The height distribution of leaves in rooted trees
- scientific article; zbMATH DE number 1394485 (Why is no real title available?)
- Generating functions for individual leaf depths
- On \(q\)-functional equations and excursion moments
This page was built for publication: Analysis of generating functions and probabilities on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2769672)
