MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This is a follow-up to an earlier MO question.

Let $W:[0,1]\rightarrow\mathbb R$ be standard Brownian motion with $W(0)=0$.

Let $F_n$ denote the collection of all the $2^n$ many piecewise linear continuous functions $f:[0,1]\rightarrow\mathbb R$ such that $f(0)=0$ and $f$ is linear with slope $\pm \sqrt{n}$ on the intervals $[\frac in,\frac{i+1}n]$ for $0\le i<n$.

Let $\psi_n$ denote a uniformly randomly chosen element of $F_n$, i.e., $\mathbb P(\psi_n=f)=2^{-n}$ for each $f\in F_n$.

Let $\phi_n$ denote a uniformly randomly chosen element of $$ \text{arg min}_{f\in F_n}\left(\sup_{0\le x\le 1}|W(x)-f(x)|\right). $$ In other words, $\phi_n$ is an element of $F_n$ that minimizes the sup-norm distance to $W$. More simply, we can say that $\phi_n$ is a nearest walk to Brownian motion.

Do $\phi_n$ and $\psi_n$ have approximately the same distribution?

Is it true that $$ \lim_{n\rightarrow\infty}\ \max_{f\in F_n}\ \left|\mathbb P(\phi_n=f)-\mathbb P(\psi_n=f)\right|\cdot 2^n=0\ ? $$

share|cite|improve this question
Are you just trying to create some sequence of random walks that converges to $W$ uniformly almost surely or you are more ambitious than that? – fedja Sep 12 '10 at 16:20
@fedja: in that case I guess there is the Skorokhod embedding which you may be thinking of. The sequence of walks should be close to uniform and converge at a close to optimal rate for the application I have in mind (which is to answer Question 5.1 in my paper… with Szabados). – Bjørn Kjos-Hanssen Sep 12 '10 at 16:50

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.