A functional limit theorem for the profile of random recursive trees
From MaRDI portal
Abstract: Let be the number of vertices at level in a random recursive tree with vertices. We prove a functional limit theorem for the vector-valued process , for each . We show that after proper centering and normalization, this process converges weakly to a vector-valued Gaussian process whose components are integrated Brownian motions. This result is deduced from a functional limit theorem for Crump-Mode-Jagers branching processes generated by increasing random walks with increments that have finite second moment.
Recommendations
- Weak convergence of the number of vertices at intermediate levels of random recursive trees
- A functional limit law for the profile of plane-oriented recursive trees
- A functional limit theorem for the profile of \(b\)-ary trees
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
- Random recursive trees: a boundary theory approach
Cites work
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A functional limit theorem for the profile of search trees
- An alternative proof of Lorden&s renewal inequality
- Analytic combinatorics
- Asymptotics of random processes with immigration. I: Scaling limits.
- Branching processes in the analysis of the heights of trees
- Degree distribution in the lower levels of the uniform recursive tree
- Functional limit theorems for renewal shot noise processes with increasing response functions
- General Edgeworth expansions with applications to profiles of random trees
- Martingales and large deviations for binary search trees
- Martingales and profile of binary search trees
- Note on the heights of random recursive trees and random m‐ary search trees
- On the moments and limit distributions of some first passage times
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
- Random Trees
- Renewal theory for perturbed random walks and similar processes
- Stopped Random Walks
- The profile of binary search trees
Cited in
(14)- A limit theorem for recursively defined processes in Lp
- Normal Limit Law for Protected Node Profile of Random Recursive Trees
- Asymptotic fluctuations in supercritical Crump-Mode-Jagers processes
- Weak convergence of the number of vertices at intermediate levels of random recursive trees
- Renewal theory for iterated perturbed random walks on a general branching process tree: Early generations
- Limit theorems for random trees.
- A functional limit law for the profile of plane-oriented recursive trees
- A functional limit theorem for general shot noise processes
- Limiting distributions for additive functionals on Catalan trees
- Profile of random exponential recursive trees
- A central limit theorem for additive functionals of increasing trees
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Weak convergence of random processes with immigration at random times
This page was built for publication: A functional limit theorem for the profile of random recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725478)