Answers are grounded in this paper and cite their sources.
Fix λ and let Tₙ 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 λ√ n of the right parity. Pitman and Tang showed that E Tₙ is of order n and asked for its exact asymptotics. We prove that E Tₙ~γ_λ n, where γ_λ=1+E F_λ and F_λ is the first time at which the Slepian process $B(t+1)-B(t)$ hits λ. 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 γ₀≈1.5439 and γ₁≈2.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.
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: