Tightness for the minimal displacement of branching random walk
From MaRDI portal
Publication:5239376
Recommendations
Cites work
- scientific article; zbMATH DE number 3572956 (Why is no real title available?)
- scientific article; zbMATH DE number 3029581 (Why is no real title available?)
- A Nonlinear Integral Operator Arising from a Model in Population Genetics I. Monotone Initial Data
- An analytic approach to the height of binary search trees. II
- An improved subadditive ergodic theorem
- Application of brownian motion to the equation of kolmogorov-petrovskii-piskunov
- Convergence of solutions of the Kolmogorov equation to travelling waves
- Cover times for Brownian motion and random walks in two dimensions
- Limit distributions for minimal displacement of branching random walks
- Limit theorems for the minimal position in a branching random walk with independent logconcave displacements
- Maximal displacement of branching brownian motion
- Postulates for subadditive processes
- Probability approximations via the Poisson clumping heuristic
- Random walk covering of some special trees
- The first birth problem for an age-dependent branching process
- 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)- On tightness of the skew random walks
- Limit theorems for the minimal position in a branching random walk with independent logconcave displacements
- Cutoff for the East process
- On the maximum of conditioned random walks and tightness for pinning models
- Right-most position of a last progeny modified time inhomogeneous branching random walk
- 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)