Tightness for a family of recursion equations

DOI10.1214/08-AOP414zbMath1169.60020arXivmath/0612382MaRDI QIDQ1019091

Ofer Zeitouni, Maury Bramson

Publication date: 27 May 2009

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612382

zbMATH Keywords

tightness; branching random walk; cover time; recursion equations

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

39B12: Iteration theory, iterative and composite equations

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

Unnamed Item, On explosions in heavy-tailed branching random walks, Convergence in law of the minimum of a branching random walk, A sharp estimate for cover times on binary trees, The almost sure limits of the minimal position and the additive martingale in a branching random walk, Maximum of the characteristic polynomial of random unitary matrices, Convergence in law for the branching random walk seen from its tip, On the maximal displacement of subcritical branching random walks, Exact asymptotics of the freezing transition of a logarithmically correlated random energy model, Slowdown for time inhomogeneous branching Brownian motion, Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees, Extremes of local times for simple random walks on symmetric trees, Poisson-Dirichlet branching random walks, Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model, Cyclic behavior of maxima in a hierarchical summation scheme, Minima in branching random walks, Cutoff for the East process, On the maximal displacement of critical branching random walk, The extremal process of critical points of the pure \(p\)-spin spherical spin Glass model, Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees, Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations, Extreme local extrema of two-dimensional discrete Gaussian free field, Tightness for Maxima of Generalized Branching Random Walks, Longest Path Distance in Random Circuits, Convergence of directed random graphs to the Poisson-weighted infinite tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of max-type recursive distributional equations
• Random walk covering of some special trees
• Limit distributions for minimal displacement of branching random walks
• The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees
• The central limit theorem for the supercritical branching random walk, and related results
• An improved subadditive ergodic theorem
• Probability approximations via the Poisson clumping heuristic
• Postulates for subadditive processes
• Branching random walks. II
• The first birth problem for an age-dependent branching process
• Cover times for Brownian motion and random walks in two dimensions
• Minimal positions in a branching random walk
• The height of a random binary search tree
• An analytic approach to the height of binary search trees II
• Convergence of solutions of the Kolmogorov equation to travelling waves
• Application of brownian motion to the equation of kolmogorov-petrovskii-piskunov
• Maximal displacement of branching brownian motion
• Limit theorems for the minimal position in a branching random walk with independent logconcave displacements
• A Nonlinear Integral Operator Arising from a Model in Population Genetics I. Monotone Initial Data