General Edgeworth expansions with applications to profiles of random trees
From MaRDI portal
Publication:1704141
DOI10.1214/17-AAP1285zbMath1382.60068arXiv1606.03920MaRDI QIDQ1704141
Zakhar Kabluchko, Alexander Marynych, Henning Sulzbach
Publication date: 8 March 2018
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03920
profilewidthcentral limit theoremEdgeworth expansionbranching random walkmoderandom treerandom analytic functionbiggins martingalemod-phi convergence
Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Applications of branching processes (60J85) Large deviations (60F10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Limit theorems for supercritical branching processes in random environment, Tree evolution processes for bucket increasing trees, Random cones in high dimensions II: Weyl cones, Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions, \(r\)-Lah distribution: properties, limit theorems and an application to compressed sensing, Weak convergence of the number of vertices at intermediate levels of random recursive trees, Random walks with preferential relocations and fading memory: a study through random recursive trees, A functional limit theorem for the profile of random recursive trees, Self-similar solutions of kinetic-type equations: the boundary case, Geometry of weighted recursive and affine preferential attachment trees, Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A functional central limit theorem for branching random walks, almost sure weak convergence and applications to random trees
- Martingales and profile of binary search trees
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
- The left-right-imbalance of binary search trees
- Width and mode of the profile for some random trees of logarithmic height
- On growing random binary trees
- Branching processes in the analysis of the heights of trees
- Spatial growth of a branching process of particles living in \(R^ n\).
- Uniform convergence of martingales in the branching random walk
- A note on the growth of random trees
- Edgeworth expansions for profiles of lattice branching random walks
- Exact convergence rates for the distribution of particles in branching random walks
- The profile of binary search trees
- Distribution of levels in high-dimensional random landscapes
- A functional limit theorem for the profile of search trees
- Martingales and large deviations for binary search trees
- Mod-Gaussian Convergence and Its Applications for Models of Statistical Mechanics
- Mod-ϕ Convergence
- Mod‐Gaussian convergence and the value distribution of ζ(½ + it ) and related quantities
- Mode and Edgeworth expansion for the Ewens distribution and the Stirling numbers
- Mod-Gaussian convergence: new limit theorems in probability and number theory
- Mod-Poisson Convergence in Probability and Number Theory
- Width of a scale-free tree
- Profiles of random trees: Plane-oriented recursive trees
- Random Trees
- A limiting distribution for quicksort
- Continuity of limit random variables in the branching random walk
- A note on the height of binary search trees
- Mod- Convergence
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- Profiles of random trees: correlation and width of random recursive trees and binary search trees
- On martingale tail sums for the path length in random trees
- A limit theorem for “quicksort”
- On a Conjecture of Hammersley
