Tightness for the minimal displacement of branching random walk

DOI10.1088/1742-5468/2007/07/P07010zbMATH Open1456.60226OpenAlexW2170579194MaRDI QIDQ5239376FDOQ5239376

Authors: Maury Bramson, Ofer Zeitouni 

Publication date: 22 October 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1742-5468/2007/07/p07010

Recommendations

• Tightness for a family of recursion equations
• Limit distributions for minimal displacement of branching random walks
• Tightness for maxima of generalized branching random walks
• Convergence in law of the minimum of a branching random walk
• Consistent minimal displacement of branching random walks

zbMATH Keywords

probability theory

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

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

Cited In (6)

• Right-most position of a last progeny modified time inhomogeneous branching random walk
• Cutoff for the East process
• On tightness of the skew random walks
• On the maximum of conditioned random walks and tightness for pinning models
• Limit theorems for the minimal position in a branching random walk with independent logconcave displacements
• Tightness for a family of recursion equations

This page was built for publication: Tightness for the minimal displacement of branching random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239376)