Correction terms for the height of weighted recursive trees
From MaRDI portal
Publication:2083274
DOI10.1214/21-AAP1756zbMath1498.05059arXiv2101.01156OpenAlexW3118453904MaRDI QIDQ2083274
Delphin Sénizergues, Michel Pain
Publication date: 10 October 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.01156
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Convergence in law of the minimum of a branching random walk
- Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees
- On growing random binary trees
- A conditional limit theorem for the frontier of a branching Brownian motion
- Branching processes in the analysis of the heights of trees
- The near-critical Gibbs measure of the branching random walk
- Poisson-Dirichlet branching random walks
- A phase transition for preferential attachment models with additive fitness
- Geometry of weighted recursive and affine preferential attachment trees
- Cyclic behavior of maxima in a hierarchical summation scheme
- Minima in branching random walks
- The Seneta-Heyde scaling for the branching random walk
- Exact Kolmogorov and total variation distances between some familiar discrete distributions
- Distribution of nodes of a tree by degree
- An approximation theorem for the Poisson binomial distribution
- Asymptotic results on Hoppe trees and their variations
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
- On the asymptotic behaviour of random recursive trees in random environments
- The height of a random binary search tree
- An analytic approach to the height of binary search trees II
- Random Trees
- Convergence of solutions of the Kolmogorov equation to travelling waves
- A note on the height of binary search trees
- Maximal displacement of branching brownian motion
- Note on the heights of random recursive trees and random m‐ary search trees
- Asymptotic Analysis of Hoppe Trees
- Random walks with preferential relocations and fading memory: a study through random recursive trees
- Oscillations in the height of the Yule tree and application to the binary search tree
- Growing random networks with fitness
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Correction terms for the height of weighted recursive trees