Rate of convergence of the conditioned random walk towards the Brownian bridge
Laurent Decreusefond, Antonin Jacquet
TL;DR
The paper derives quantitative rates for the convergence of two discrete processes to the Brownian bridge: a random walk conditioned to be zero at the endpoint and the empirical process from the Glivenko–Cantelli theorem. By combining a functional Stein method with a Radon–Nikodym representation of the Brownian bridge, the authors bound the Fortet–Mourier distance between these processes and the bridge, achieving a rate of order $n^{-1/18} \log n$ in the Rademacher and Poisson-minus-one cases and extending to general lattice increments via a max of local-limit and Fourier errors. The core technique discretizes the processes up to a late time $t_n$, uses RN-densities to link conditioned and unconditioned paths on $[0,t]$, and controls the remaining tail by continuity on $[t,1]$, with a set of auxiliary lemmas ensuring density convergence and Lipschitz properties. Collectively, the results provide a rigorous, general route to process-level convergence rates for conditioned and empirical path sequences toward the Brownian bridge, with explicit dependence on the increment law via $\rho(\mathcal{L},n)$ and $\tau(\mathcal{L},n,\delta)$.
Abstract
We study the rate of convergence of two discrete processes towards the Brownian bridge: the random walk conditioned to be zero at time 2n and the empirical process which appears in the Glivencko-Cantelli theorem. Combining a functional Stein method with a Radon-Nikodym representation of the bridge, we bound the Fortet-Mourier distance between these conditioned processes and the Brownian bridge.
