The exact asymptotics of the waiting time for a first-passage pattern
Year: 2026
Type: preprint
Abstract: Let T be the first time at which the last n steps of a simple symmetric random walk form a word that first reaches −h at its last step, and let p be the probability that a given window is such a word. Pitman and Tang asked for the exact asymptotics of the mean E T for h of order √n, and its order n log n was proved in earlier work of the author. We prove that E T ∼ log L*/(2πp) with L* = min(h², n²/h²) whenever h → ∞ and h/n → 0, and that T/E T is asymptotically exponential. For h ∼ |λ|√n with negative λ this gives E T ∼ e^(λ²/2) (2√(2π)|λ|)^(−1) n log n. Say that a walk X matches a simple symmetric walk Z at depth j if X is at −j when Z first reaches −j. For fixed h and for h/n → δ with δ positive the limit of p E T is the reciprocal of the probability that Z is never matched by an independent walk X, conditioned to stay above −h in the first case and with drift −δ in the second. For h = 2 the limit is 3π/8.
Author: Shmalo, Yitzchak
Institution: Hebrew University of Jerusalem
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236776541
