## Doob H-transforms

I read today about Doob h-transforms in the Rogers-Williams … It is done quite quickly in the book so that I decided to practice on some simple examples to see how this works.

So we have a Markov process ${X_t}$ living in the state space ${S}$, and we want to see how this process looks like if we condition on the event ${X_T \in A}$ where ${A}$ is a subset of the state space. To fix the notations we define ${p(t,t+s,x,y) = P(X_{t+s}=y|X_t=x)}$ and ${h(t,x)=P(X_T \in A \, | X_t=x)}$. The conditioned semi-group ${\hat{p}(t,t+s,x,y)=P(X_{t+s}=y|X_t=x, X_T \in A)}$ is quite easily computed from ${p}$ and ${h}$. Indeed, this also equals

$\displaystyle \hat{p}(t,t+s,x,y) = \frac{P(X_{t+s}=y; X_T \in A\;|X_t=x)}{P(X_T \in A \,|X_t=x)} = p(t,t+s,x,y) \frac{h(t+s,y)}{h(t,x)}.$

Notice also that ${\hat{p}(t,t+s,x,y) = p(t,t+s,x,y) \frac{h(t+s,y)}{h(t,x)}}$ is indeed a Markov kernel in the sense that ${\int_{y} \hat{p}(t,t+s,x,y) \, dy = 1}$: the only property needed for that is

$\displaystyle h(t,x) = \int_{y} p(t,t+s,x,y)h(t+s,y)\,dy = E\left[ h(t+s,X_{t+s}) \, |X_t=x\right].$

In fact, we could take any function ${h}$ that satisfies this equality and define a new Markovian kernel ${\hat{p}}$ and study the associated Markov process. That’s what people usually do by the way.

Remark 1 we almost never know explicitly the quantity ${h(t,x)}$, except in some extremely simple cases !

Before trying these ideas on some simple examples, let us see what this says on the generator of the process:

1. continuous time Markov chains, finite state space:let us suppose that the intensity matrix is ${Q}$ and that we want to know the dynamic on ${[0,T]}$ of this Markov chain conditioned on the event ${X_T=z}$. Indeed ${p(t,t+s,i,j) = [\exp(sQ)]_{i,j}}$ so that ${\hat{p}(t,t+s,i,j) = [\exp(sQ)]_{i,j} \frac{p(t+s,T,j,z)}{p(t,T,i,z)}}$ so that in the limit we see that at time ${t}$, the intensity of the jump from ${i}$ to ${j}$ of the conditioned Markov chain is
$\displaystyle Q(i,j) \frac{p(t+s,T,j,z)}{p(t,T,i,z)}.$

Notice how this behaves while ${t \rightarrow T}$: if at ${t=T-\epsilon}$ the Markov chain is in state ${i \neq z}$ then the intensity of jump from ${i}$ to ${z}$ is equivalent to ${\approx \frac{1}{\epsilon}}$.

2. diffusion processes:this time consider a ${1}$-dimensional diffusion ${dX_t = \mu(X_t) \, dt + \sigma(X_t) \, dW_t}$ on ${[0,T]}$ conditioned on the event ${X_T \in A}$ and define as before ${h(t,x)=P(X_T \in A \,|X_t=x)}$. The generator of the (non-homogeneous) conditioned diffusion is defined at time ${t}$ by
$\displaystyle \begin{array}{rcl} \mathcal{G}^{(t)} f(x) &=& \lim_{s \rightarrow 0} \frac{1}{s} \Big( E\left[f(X_{t+s}) \,| X_t=x, X_T \in A\right]-f(x) \Big)\\ &=& \lim_{s \rightarrow 0} \frac{E\left[ f(X_{t+s}) h(t+s, X_{t+s}) \,| X_t=x\right]-f(x) }{s\,h(t,x)} \end{array}$

so that if ${\mathcal{L} = \mu \partial_x + \frac{1}{2} \sigma^2 \partial^2_{xx}}$ is the generator of the original diffusion we get

$\displaystyle \mathcal{G}^{(t)} f = \frac{1}{h} \Big(\partial_t + \mathcal{L})(hf).$

Because ${(\partial_t + \mathcal{L})h=0}$, this also reads

$\displaystyle \mathcal{G}^{(t)} f = \mathcal{L}f + \sigma^2 \frac{\partial_x h}{h} \partial_x f.$

This means that the conditioned diffusion ${Z}$ follows the SDE:

$\displaystyle dZ_t = \Big( \mu(Z_T) + \sigma(Z_t)^2 \frac{\partial_x h(t,Z_t)}{h(t,Z_t)} \Big) \, dt+ \sigma(Z_t) dW_t.$

The volatility function remains the same while an additional drift shows up.

We will try these ideas on some examples where the probability densities are extremely simple. Notice that in the case of diffusions, if we take ${A=\{x^+\}}$, the function ${(t,x) \mapsto P(X_T = x^+ \, |X_t=x)}$ is identically equal to ${0}$ (except degenerate cases): to condition on the event ${X_T=x}$ we need instead to take ${h(t,x)}$ to be the transition probability ${p(t,T,x,x^+)}$. This follows from the approximation ${P(X_T \in (x^+,x^+ + dx) \,|X_t=x ) \approx p(t,T,x,x^+) \, dx + o(dx)}$. Let’s do it:

• Brownian Bridge on ${[0,T]}$:in this case ${p(t,T,x,0) \propto e^{-\frac{|x-y|^2}{2(T-t)}}}$ so that the additional drift reads ${\frac{-x}{T-t}}$: a Brownian bridge follows the SDE
$\displaystyle dX_t = -\frac{X_t}{T-t} \, dt + dW_T.$

This might not be the best way to simulate a Brownian bridge though!

• Poisson Bridge on ${[0,T]}$:we condition a Poisson process of rate ${\lambda}$ on the event ${X_T=N}$. The intensity matrix is simply ${Q(k,k+1)=\lambda=-Q(k,k)}$ and ${0}$ everywhere else while the transition probabilities are given by ${p(t,T,k,N) = e^{-\lambda (T-t)} \frac{(\lambda (T-t) )^{N-k}}{(N-k)!}}$. This is why at time ${t}$, the intensity from ${k}$ to ${k+1}$ is given by
$\displaystyle \lambda(t,k,k+1) = \frac{N-k}{T-t}.$

Again, that might not be the most efficient way to simulate a Poisson Bridge ! Notice how the intensity ${\lambda}$ has disappeared …

• Ornstein-Uhlenbeck Bridge:Let’s consider the usual OU process given by the dynamic ${dX_t = -X_t + \sqrt{2}dW_t}$: the invariant probability is the usual centred Gaussian distribution. Say that we want to know how does such an OU process behave if we condition on the event ${X_T = z}$. Because ${p(t,T,x,z) \propto \exp(-\frac{|z-e^{-(T-t)}x|^2}{2(1-e^{-2(T-t)})^2})}$ we find that the conditioned O-U process follows the SDE
$\displaystyle dX_t = \Big(\frac{z-e^{-(T-t)x}}{e^{T-t}(1-e^{-2(T-t)})^2} - X_t \Big)\, dt+ \sqrt{2} \, dW_t.$

If we Taylor expand the additonal drift, it can be seen that this term behaves exactly as in the case of the Brownian bridge. Below is a plot of an O-U process conditioned on the event ${X_{10} = 10}$, starting from ${X_0=0}$.

conditioned O-U process

## Brownian particles on a circle

Today, James norris gave a talk related to Diffusion-limited aggregation processes and mentioned, in passing, the following amusing fact: put ${N}$ equidistant Brownian particles ${W_1, \ldots, W_N}$ on the circle with unit circumference and let them evolved. When two of them collide they get stuck to each other and continue together afterwards: after a certain amount of time ${T_N}$, only one particle remains. Perhaps surprisingly, this is extremely easy to obtain the first few properties of ${T_N}$. For example, ${\lim_N \mathop{\mathbb E}\left[ T_N \right] = \frac{1}{6}}$.

To see that, define ${D_k}$ the distance between ${W_k}$ and ${W_{k+1}}$ (modulo ${N}$) so that ${D_k = \frac{1}{N}}$ for ${k=1,2 \ldots, N}$. Notice then (It\^o’s formula) that

$\displaystyle M_t = e^{\lambda t} \sum_{k=1^N} \sin(\sqrt{\lambda} D_k)$

is a (local) martingale that starts from ${M_0 = N \sin(\frac{\sqrt{\lambda}}{N})}$. Also, at time ${T_N}$, exactly ${N-1}$ of the distances ${D_1, D_2, \ldots, D_N}$ are equal to ${0}$ while one of them is equal to ${1}$: this is why ${M_{T_N} = e^{\lambda T_N} \sin(\sqrt{\lambda})}$. The end is clear: apply the optional sampling theorem (to be rigorous, take ${\lambda}$ not too big, or do some kind of truncations to be sure that the optional sampling theoem applies) to conclude that

$\displaystyle \mathop{\mathbb E}\left[ e^{\lambda T_N} \right] = \frac{N \sin(\frac{\sqrt{\lambda}}{N})}{\sin(\sqrt{\lambda})}.$

This gives for example ${\mathop{\mathbb E}\left[ T_N \right] = \frac{1}{6}(1-\frac{1}{N^2})}$. I just find it cute!

So what if we do that on a segment ?

## On the Wiener space

I would like to discuss in this post the importance of the heuristic functional

$\displaystyle I(W) := \frac{1}{2} \int_0^T |\frac{d}{dt} W|^2 \, dt \ \ \ \ \ (1)$

that often shows up when doing analysis on the Wiener space ${S = (C([0,T], {\mathbb R}), \|\cdot\|_{\infty})}$: an element of the Wiener space is traditionally denoted by ${\omega}$ – this is a continuous function and ${\omega(t)}$ is its value at time ${t \in [0,T]}$. For a (nice) subset ${A}$ of ${S}$, the Wiener measure of ${A}$ is nothing else than the probability that a Brownian path belongs to ${A}$. Having said that, the quantity ${I(W)}$ hardly makes sense since a Brownian path ${(W_t: t \in [0,T])}$ is (almost surely) non differentiable anywhere: still, this is a very useful heuristic in many situations. A review of probability can be found on the excellent blog of Terry Tao.

Where does it come from ?

As often, this is very instructive to come back to the discrete setting. Consider a time interval ${[0,T]}$ and a discretization parameter ${\Delta t = \frac{T}{N}}$: a discrete Brownian path is represented by the ${N}$-tuple

$\displaystyle W^{(N)} = (W_{\Delta t},W_{2\Delta t},\ldots,W_{T}) \in {\mathbb R}^{N}.$

The random variables ${\Delta W_k := W_{k \Delta t} - W_{(k-1) \Delta t}}$ are independent centred Gaussian variables with variance ${\Delta t}$ so that the random vector ${W^{(N)}}$ has a density ${\mathop{\mathbb P}^{(N)}}$ with respect to the ${N}$-dimensional Lebesgue measure

$\displaystyle \begin{array}{rcl} \frac{d \mathop{\mathbb P}^{(N)}}{d \lambda^{\textrm{Leb}}}(W^{(N)}) &\propto& \exp\{-\frac{1}{2 \Delta t} \sum_{k=1}^N |W_{k \Delta t} - W_{(k-1) \Delta t}|^2\} \\ &=& \exp\{-\frac{1}{2} \sum_{k=1}^N |\frac{W_{k \Delta t} - W_{(k-1) \Delta t}}{\Delta t}|^2 \, \Delta t\} \\ &=& \exp\{- I^{(N)}(W^{N})\}. \end{array}$

The functional ${I^{(N)} := \frac{1}{2} \sum_{k=1}^N |\frac{W_{k \Delta t} - W_{(k-1) \Delta t}}{\Delta t}|^2 \, \Delta t}$ is indeed a discretization of ${I}$. Informally, the Wiener measure has a density proportional to ${\exp\{-I(W)\}}$ with respect to the “infinite dimensional Lebesgue measure”: this does not make much sense because there is no such thing as the infinite dimensional Lebesgue measure. This should be understood as the limiting case ${N \rightarrow \infty}$ of the discretization procedure presented above. Indeed, this is not an absolute non-sense to say that

$\displaystyle \mathop{\mathbb P}[ \omega = g] \sim e^{-I(g)}. \ \ \ \ \ (2)$

because we will see that if ${f,g}$ are two nice functions then

$\displaystyle \lim_{ \epsilon \rightarrow 0} \frac{P[ \|W-f\|_{\infty} < \epsilon]}{P[ \|W-g\|_{\infty} < \epsilon]} = \frac{e^{-I(f)}}{e^{-I(g)}}.$

It is then very convenient to write

$\displaystyle \mathop{\mathbb P}[\omega \in A] = \int_{A} e^{-I(W)} \, d\lambda(W)$

where ${\lambda}$ is a fictional infinite dimensional Lebesgue measure (ie: translation invariant).

Translations in the Wiener space

As a first illustration of the heuristic ${\mathop{\mathbb P}[\omega = g] \sim e^{-I(g)}}$, let see how the Wiener measure behave under translations. If we choose a nice continuous function ${f}$ such that ${I(f)}$ is well defined (ie: ${\dot{f} \in L^2([0,T]))}$), a translated probability measure ${\mathop{\mathbb P}^{f}}$ can be defined through the relation

$\displaystyle \mathop{\mathbb P}^f(A) := \mathop{\mathbb P}(f+\omega \in A). \ \ \ \ \ (3)$

This is not clear that ${\mathop{\mathbb P}^f}$ is absolutely continuous with respect to the Wiener measure ${\mathop{\mathbb P}}$. Of course, we impose that ${f(0)=0}$. For a set ${A \subset S}$, the heuristic says that

$\displaystyle \begin{array}{rcl} \mathop{\mathbb P}^f( \omega \in A) &=& \mathop{\mathbb P}(\omega \in A-f) = \int_{A-f} e^{-I(W)} \, d\lambda(W)\\ &\stackrel{\textrm{(trans. inv.)}}{=}& \int_{A} e^{-I(W-f)} \, d\lambda(W)\\ &=& \int_{A} e^{-\frac{1}{2} \int_0^T |\dot{W}-\dot{f}|^2 \, dt} \, d\lambda(W)\\ &=& \int_{A} e^{\int_0^T \dot{f} \dot{W} \, dt -\frac{1}{2} \int_0^T \dot{f}^2 \, dt} e^{-I(W)}\, d\lambda. \end{array}$

This is why, writing ${\dot{W} \, dt = dW}$, we obtain the following change of probability formula

Proposition 1 Cameron-Martin-Girsanov change of probability formula:

for any continuous function ${f}$ such that ${f(0)=0}$ and ${\dot{f} \in L^2([0,T])}$,

$\displaystyle \frac{d \mathop{\mathbb P}^f}{d \mathop{\mathbb P}}(W) = Z^f(W) := \exp\{ \int_0^T \dot{f} dW_t -\frac{1}{2} \int_0^T \dot{f}^2 \, dt \} \ \ \ \ \ (4)$

This change of probability formula is extremely useful since this is typically much more convenient to work with a Brownian motion ${W_t}$ than with a drifted Brownian motion ${f(t) + W_t}$. In many situations, we get rid of the annoying stochastic integral ${\int_0^T \dot{f} dW_t}$: if ${f}$ is regular enough (${f \in C^3([0,T])}$, say) we have

$\displaystyle \begin{array}{rcl} \frac{d \mathop{\mathbb P}^f}{d \mathop{\mathbb P}}(W) &=& Z^f(W)\\ &:=& \exp\{ \dot{f}(T)W(T) - \int_0^T \ddot{f}(t) W(t)\, dt -\frac{1}{2} \int_0^T \dot{f}^2 \, dt\}. \end{array}$

The next section is a straightforwards application of this change of variable formula.

Probability to be in an ${\epsilon}$-tube

Suppose that ${f,g}$ are two nice functions (smooth, say): for small ${\epsilon \ll 1}$, what is a good approximation of the quotient

$\displaystyle Q(f,g,\epsilon) = \frac{\mathop{\mathbb P}(\|W-f\|_{\infty}<\epsilon)}{\mathop{\mathbb P}(\|W-g\|_{\infty}<\epsilon)}.$

In words, this basically asks the question: how more probable is the event ${\{ W \textrm{looks like } f\}}$ than the event ${\{ W \textrm{looks like } g\}}$ ? Of course, since this can also be read as

$\displaystyle Q(f,g,\epsilon) = \frac{Q(f,0,\epsilon)}{Q(g,0,\epsilon)}$

where ${0}$ indicates the function identically equal to zero, it suffices to consider the case ${g=0}$. If we introduce the event

$\displaystyle A_{\epsilon} = \{ \omega \in S: \|\omega\|_{\infty} < \epsilon\}),$

the quotient ${Q(f,0,\epsilon)}$ is equal to ${\frac{\mathop{\mathbb P}^f(A_{\epsilon})}{\mathop{\mathbb P}(A_{\epsilon})}}$. This why, using the change of probability formula (4),

$\displaystyle \begin{array}{rcl} Q(f,0,\epsilon) &=& \frac{\mathop{\mathbb P}^f(A_{\epsilon})}{\mathop{\mathbb P}(A_{\epsilon})} = \frac{\mathop{\mathbb E}\left[ 1_{A_{\epsilon}}(W) Z^f(W) \right]}{\mathop{\mathbb E}\left[ 1_{A_{\epsilon}}(W) \right]} \end{array}$

with ${Z^f(W) = \exp\{\dot{f}(T)W(T) - \int_0^T \ddot{f}(t) W(t)\, dt -\frac{1}{2} \int_0^T \dot{f}^2 \, dt\}}$. If ${\|\dot{f}\|_{\infty}, \|\ddot{f}\|_{\infty} \leq C}$, this is clear that for ${W \in A}$,

$\displaystyle -(C\epsilon + \epsilon C T) < \dot{f}(T)W(T) - \int_0^T \ddot{f}(t) W(t)\, dt < C\epsilon + \epsilon C T.$

Both sides going to zero when ${\epsilon}$ goes to zero, this is enough to conclude that

$\displaystyle \lim_{\epsilon \rightarrow 0} Q(f,0,\epsilon) = \exp\{-\frac{1}{2} \int_0^T \dot{f}^2 \, dt\}\} = \exp\{ -I(f)\}. \ \ \ \ \ (5)$

In short, for any two reasonably nice functions (for example ${f,g \in C^3([0,T])}$) ${f,g}$ that satisfy ${f(0)=g(0)=0}$,

$\displaystyle \lim_{\epsilon \rightarrow 0} Q(f,0,\epsilon) \frac{\mathop{\mathbb P}(\|W-f\|_{\infty}<\epsilon)}{\mathop{\mathbb P}(\|W-g\|_{\infty}<\epsilon)} = \frac{ \exp\{ -I(f)\}}{\exp\{ -I(g)\} }. \ \ \ \ \ (6)$

Large deviation result

Take a subset ${A}$ of ${S}$ (it might be useful to think of sets like ${A_{f,\epsilon,\alpha} = \{\omega: |\omega(u)-f(u)| < \alpha \, \forall u \in U\}}$). We are interested to the probability that the rescaled (in space) Brownian motion

$\displaystyle W^{(\epsilon)}(t) = \epsilon W(t)$

belongs to ${A}$ when ${\epsilon}$ goes to ${0}$. Typically, if the null function does not belong to (the closure of) ${A}$, the probability ${\mathop{\mathbb P}( W^{(\epsilon)} \in A)}$ is exponentially small. It turns out that if ${A}$ is regular enough

$\displaystyle \ln \mathop{\mathbb P}( \epsilon W \in A) \sim -\epsilon^2 \inf_{f \in A} I(f) := -\epsilon^2 I(A).$

Again, the usual heuristic gives this result in no time if we accept not to be too rigorous:

$\displaystyle \begin{array}{rcl} \epsilon^2 \, \ln \mathop{\mathbb P}( \epsilon W \in A) &=& \epsilon^2 \, \ln \int_{\epsilon W \in A} e^{-I(W)} \, d\lambda \\ &=& \epsilon^2 \, \ln \int_{W \in A} e^{-I(\frac{W}{\epsilon})} \textrm{(Jacobian)}\, d\lambda \\ &=& \epsilon^2 \, \ln \int_{W \in A} e^{-\frac{I(W)}{\epsilon^2}} \textrm{(Jacobian)}\, d\lambda \\ &\stackrel{\epsilon \rightarrow 0}{\rightarrow}& -\inf \{I(f): f \in A\}. \end{array}$

This is very fishy since the Jacobian should behave very badly (actually the measure ${\mathop{\mathbb P}[W \in \cdot]}$ and ${\mathop{\mathbb P}[\epsilon W \in \cdot]}$ are mutually singular) but all this mess can be made perfectly rigorous. Nevertheless, the basic idea is almost there, and it can be proved (Freidlin-Wentzel theory) that for any open set $G$,

$\displaystyle \liminf \epsilon^2 \, \ln \mathop{\mathbb P}( \epsilon W \in G) \geq -\inf \{I(f): f \in G\}$

while for any closed set ${F}$,

$\displaystyle \limsup \epsilon^2 \, \ln \mathop{\mathbb P}( \epsilon W \in F) \leq -\inf \{I(f): f \in F\}.$

One cleaner way to prove this is to used the usual Cramer theorem of large deviations for sums of i.i.d random variables (in Banach space) and notice that for ${\epsilon(N) = \frac{1}{\sqrt{N}} }$ then

$\displaystyle W^{\epsilon(N)} = \frac{W_1+W_2+\ldots+W_N}{N}$

where ${(W_i:i=1,2,\ldots,N)}$ are independent standard Brownian motions. Cramer theorem states that

$\displaystyle \mathop{\mathbb P}[ \frac{W_1+W_2+\ldots+W_N}{N} \in A] \sim \exp\{-N \inf\{I(f): f \in A\} \}$

with

$\displaystyle I(f) = \sup\{ \int_{0}^t f(t)g(t)\, dt - \ln \, \mathop{\mathbb E} e^{ \int_0^T g(t) W(t) \, dt } : g \in L^2([0,T])\}.$

This is not very hard to see that the supremum is indeed ${\frac{1}{2} \int_0^T \dot{f}^2 \, dt}$.