The waiting time for a bridge pattern in simple random walk

Fix $\lambda\in\mathbb{R}$ and let $T_n$ be the first time at which the last $n$ steps of a simple symmetric random walk form a bridge from $0$ to the level nearest $\lambda\sqrt n$ of the right parity. Pitman and Tang showed that $\mathbb{E} T_n$ is of order $n$ and asked for its exact asymptotics. We prove that $\mathbb{E} T_n\sim\gamma_\lambda n$, where $\gamma_\lambda=1+\mathbb{E} F_\lambda$ and $F_\lambda$ is the first time at which the Slepian process $B(t+1)-B(t)$ hits $\lambda$. The constant is given by a convergent series of finite-dimensional integrals of determinants of heat kernels, obtained from Shepp's formulas for the Slepian process, with an explicit bound on the remainder. Numerically $\gamma_0\approx1.5439$ and $\gamma_1\approx2.4135$. We also show that the column sums of the matching matrix of Pitman and Tang, averaged with the law of the first bridge that occurs, converge after scaling to a functional of the path that follows the first hit; averaging them uniformly over the bridges gives a different limit.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24195861
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 bridge pattern in simple random walk

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

The waiting time for a bridge pattern in simple random walk

Yitzchak Shmalo
preprint en

Abstract

Fix $\lambda\in\mathbb{R}$ and let $T_n$ be the first time at which the last $n$ steps of a simple symmetric random walk form a bridge from $0$ to the level nearest $\lambda\sqrt n$ of the right parity. Pitman and Tang showed that $\mathbb{E} T_n$ is of order $n$ and asked for its exact asymptotics. We prove that $\mathbb{E} T_n\sim\gamma_\lambda n$, where $\gamma_\lambda=1+\mathbb{E} F_\lambda$ and $F_\lambda$ is the first time at which the Slepian process $B(t+1)-B(t)$ hits $\lambda$. The constant is given by a convergent series of finite-dimensional integrals of determinants of heat kernels, obtained from Shepp's formulas for the Slepian process, with an explicit bound on the remainder. Numerically $\gamma_0\approx1.5439$ and $\gamma_1\approx2.4135$. We also show that the column sums of the matching matrix of Pitman and Tang, averaged with the law of the first bridge that occurs, converge after scaling to a functional of the path that follows the first hit; averaging them uniformly over the bridges gives a different limit.

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