The sum of powers of subtree sizes for conditioned Galton-Watson trees
DOI10.1214/22-EJP831zbMath1498.05057arXiv2104.02715OpenAlexW3147579134MaRDI QIDQ2082709
Svante Janson, James Allen Fill
Publication date: 4 October 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.02715
polylogarithmgenerating functionBrownian excursionadditive functionalmethod of momentssingularity analysisrandom analytic functionconditioned Galton-Watson treeHadamard product of sequencessimply generated random treesubtree sizestree recurrence
Central limit and other weak theorems (60F05) Trees (05C05) Combinatorial probability (60C05) Miscellaneous topics of analysis in the complex plane (30E99)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
- Limiting distributions for additive functionals on Catalan trees
- Asymptotic fringe distributions for general families of random trees
- The density of the ISE and local limit laws for embedded trees
- Random trees and applications
- Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
- The Brownian excursion area: A numerical analysis
- Generalized gamma convolutions and related classes of distributions and densities
- On the analysis of linear probing hashing
- Singularity analysis and asymptotics of Bernoulli sums
- On the total heights of random rooted binary trees
- Normal convergence problem? Two moments and a recurrence may be the clues
- Singularity analysis, Hadamard products, and tree recurrences
- Cost functionals for large (uniform and simply generated) random trees
- Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees
- Central limit theorems for additive functionals and fringe trees in tries
- The continuum random tree. III
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Asymptotic distribution for the cost of linear probing hashing
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Kac's formula, levy's local time and brownian excursion
- Random cutting and records in deterministic and random trees
- Random Trees
- A bernoulli excursion and its various applications
- On the total heights of random rooted trees
- On the Altitude of Nodes in Random Trees
- Enumerating graphs and Brownian motion
- Gaussian Hilbert Spaces
- On the log-product of the subtree-sizes of random trees
- The Wiener Index of simply generated random trees
- A central limit theorem for additive functionals of increasing trees
- Transfer theorems and asymptotic distributional results for m‐ary search trees
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions
- On the Accuracy of Gaussian Approximation to the Distribution Functions of Sums of Independent Variables
- The Multiplicative Process
- Probability: A Graduate Course
- Analytic variations on the Airy distribution
This page was built for publication: The sum of powers of subtree sizes for conditioned Galton-Watson trees