Answers are grounded in this paper and cite their sources.
Fix λ<0 and let Tₙ be the first time at which the last n steps of a simple symmetric random walk form a first-passage path to the level nearest λ√ n. Pitman and Tang showed that E Tₙ lies between constant multiples of n and n5/4, and Peres conjectured that its order is nlog n. We prove this conjecture. The proof shows that a first-passage window starts in a given interval of length $n/2$ with probability of order 1/log n. The upper bound for this probability comes from the range of the difference of two independent walks sampled at the descending ladder times of one of them. This range has expected size O(√ n/log n), because the ladder times number about √ n while their return potential grows like log n.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: