The exact asymptotics of the waiting time for a first-passage pattern

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24375173
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 exact asymptotics of the waiting time for a first-passage pattern

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

The exact asymptotics of the waiting time for a first-passage pattern

Yitzchak Shmalo
preprint en

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.

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