The waiting time for a first-passage pattern in simple random walk

Fix $\lambda<0$ and let $T_n$ 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 $\lambda\sqrt n$. Pitman and Tang showed that $\mathbb{E} T_n$ lies between constant multiples of $n$ and $n^{5/4}$, and Peres conjectured that its order is $n\log 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(\sqrt n/\log n)$, because the ladder times number about $\sqrt n$ while their return potential grows like $\log n$.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24199997
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The waiting time for a first-passage pattern in simple random walk

Yitzchak Shmalo
4 links
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

The waiting time for a first-passage pattern in simple random walk

Yitzchak Shmalo
preprint en

Abstract

Fix $\lambda<0$ and let $T_n$ 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 $\lambda\sqrt n$. Pitman and Tang showed that $\mathbb{E} T_n$ lies between constant multiples of $n$ and $n^{5/4}$, and Peres conjectured that its order is $n\log 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(\sqrt n/\log n)$, because the ladder times number about $\sqrt n$ while their return potential grows like $\log n$.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon