Establishes O(1)-tightness for first passage times of d-dimensional branching random walks as distance x tends to infinity, resolving a prior conjecture.
Minima in branching random walks.Annals of Probability, 37(3):1044– 1079
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tightness Analysis of First Passage Times of $d$-Dimensional Branching Random Walk
Establishes O(1)-tightness for first passage times of d-dimensional branching random walks as distance x tends to infinity, resolving a prior conjecture.