Overview

Part 6 - Doob's hh-transform and Girsanov's theorem

Introduction

In this part we’ll introduce Doob’s hh-transform and Girsanov’s theorem.

Recall our definition of the SDE,

dx(t)=f(x(t),t) dt⏟drift+L(x(t),t) dβ(t)⏟diffusion,dx(t) = \underbrace{f(x(t), t) \, dt}_{\text{drift}} + \underbrace{L(x(t), t) \, d\beta(t)}_{\text{diffusion}},

By the end of this, we’ll have a tool in our toolbox to transform this SDE into a new SDE with the following form,

dx(t)=f(x(t),t) dt+L2(x(t),t)∇log⁡h(x(t),t) dt+L(x(t),t) dβ(t),\begin{equation} dx(t) = f(x(t), t) \, dt + L^2(x(t), t) \nabla \log h(x(t), t) \, dt + L(x(t), t) \, d\beta(t), \end{equation}

and we’ll already propose that,

dx(t)=v−x(t)T−tdt+dβ(t),t≤T,dx(t) = \frac{v - x(t)}{T - t} dt + d\beta(t), t \leq T,

is already a special case of Equation (1). For clarity, we read the above SDE as, as we move towards time TT, we’ll get closer to the point vv.

So, essentially, we’re taking a Brownian motion and forcing it to a point vv at time TT.

Brownian motion forced to a point
Figure 1: Brownian motion forced to a point

Recap: Density and Bayes’ Rule

Let’s firstly recap what we know about densities and Bayes’ rule.

If we have a random value xx, we say that xx has a density pxp_x if,

P(x∈A)=∫Apx(x) dx,P(x \in A) = \int_A p_x(x) \, dx,

or in a sloppier notation,

px(x)=P(x∈A)dx.p_x(x) = \frac{P(x \in A)}{dx}.

We say (x,y)(x,y) has a joint density px,yp_{x,y} if,

P(x∈A,y∈B)=∫A∫Bpx,y(x,y) dy dx,P(x \in A, y \in B) = \int_A \int_B p_{x,y}(x,y) \, dy \, dx,

Further, Bayes’ rule states that,

P(A∣B)=P(A∩B)P(B).P(A \mid B) = \frac{P(A \cap B)}{P(B)}.

We say that (x,y)(x,y) has a conditional density py∣xp_{y \mid x} if,

P(y∈A∣x∈B)=Px,y(x,y)px(x)=px,y(x,y)∫px,y(x,y)dy,P(y \in A \mid x \in B) = \frac{P_{x, y}(x, y)}{p_x(x)} = \frac{p_{x,y}(x,y)}{\int p_{x, y}(x, y) dy},

where we in the second step used marginalization to get the denominator.

One can also write Bayes’ rule in terms of conditionals,

P(A∣B)=P(A)P(B∣A)P(B),P(A \mid B) = \frac{P(A) P(B \mid A)}{P(B)},

or in terms of densities,

P(x∈A∣y∈B)=px(x)py∣x(y∣x)py(y).P(x \in A \mid y \in B) = \frac{p_x(x) p_{y \mid x}(y \mid x)}{p_y(y)}.

Transition Density

Now, let’s try to formulate what we’ll call transition density.

If x(t)x(t), for t≥0t \geq 0 is a Markov process 1,

p(x(t)∣x(s))=P(x(t)∈dy∣x(s)=x)dy∣y=x(t)x=x(s)p(x(t) \mid x(s)) = \frac{P(x(t) \in dy \mid x(s) = x)}{dy} \biggr\rvert_{\substack{y = x(t) \newline x = x(s)}}

or in words, the conditional density of x(t)x(t) given x(s)=xx(s) = x.

Now, think of this in the general case, since it is Markov, we now that,

P(x(t0),x(t1),…,x(tn)), joint of n random variables=P(x(t0))P(x(t1)∣x(t0))…P(x(tn)∣x(tn−1)).\begin{align*} & P(x(t_0), x(t_1), \ldots, x(t_n)), \text{ joint of } n \text{ random variables} \newline & = P(x(t_0)) P(x(t_1) \mid x(t_0)) \ldots P(x(t_n) \mid x(t_{n-1})). \end{align*}
Brownian “bridges”
Figure 2: Brownian “bridges”

Champan-Kolmogorov

We’ll make use of a equation called Chapman-Kolmogorov equation 2 which states,

P(x(t)∣x(s))=∫P(x(t)∣x(u))P(x(u)∣x(s)) dx(u),s<u<t,P(x(t) \mid x(s)) = \int P(x(t) \mid x(u)) P(x(u) \mid x(s)) \, dx(u), \quad s < u < t,

We will not prove or further discuss this equation, but it is important to know that it exists.

Example: Transition Density of a Brownian Motion

Let’s now try to apply what we’ve learned so far to a Brownian motion.

Tip (Example: Transition density of a Brownian motion)

So, we have,

P(β(t)∣β(s))=12π(t−s)exp⁡(−(β(t)−β(s))22(t−s)),P(\beta(t) \mid \beta(s)) = \frac{1}{\sqrt{2 \pi (t - s)}} \exp\left(-\frac{(\beta(t) - \beta(s))^2}{2(t - s)}\right),

and if we visualize this.

Transition density of a Brownian motion
Figure 3: Transition density of a Brownian motion

Doob’s hh-transform (for transition densities)

Let’s first start with an example and see how we can solve it.

Tip (Example: Doob’s hh-transform on transition densities)

What is the transition density of β(⋅)\beta(\cdot) (which one reads as, at any arbitrary time), given that β(T)=v\beta(T) = v? We’ll done this transition density with p⋆p^\star, so we have,

p⋆(β(t)∣β(s))=P(β(t)∈dy∣β(s)=x,β(T)=v)dy∣y=β(t)p^\star(\beta(t) \mid \beta(s)) = \frac{P(\beta(t) \in dy \mid \beta(s) = x, \beta(T) = v)}{dy} \biggr\rvert_{y = \beta(t)}

Which we can write as,

=P(β(s))P(β(t)∣β(s))h(β(t),t)∫P(β(s))P(β(t)∣β(s))h(β(t),t)dβ(t),\begin{equation} = \frac{P(\beta(s)) P(\beta(t) \mid \beta(s)) h(\beta(t), t)}{\int P(\beta(s)) P(\beta(t) \mid \beta(s)) h(\beta(t), t) d \beta(t)}, \end{equation}

where

h(s,x)=P(β(T)∈dy∣β(s)=x)dy∣y=vh(s, x) = \frac{P(\beta(T) \in dy \mid \beta(s) = x)}{dy} \biggr\rvert_{y = v}
Transition density of a Brownian “bridge”
Figure 4: Transition density of a Brownian “bridge”

Now, you may already see that, if h(s,x)h(s, x) is Gaussian, then maybe ∇log⁡h(s,x)  ⟹  v−xT−s\nabla \log h(s, x) \implies \frac{v - x}{T - s}.

By the Chapman-Kolmogorov equation, we can write,

P(β(t)∣β(s))h(β(t),t)h(β(s),s),\frac{P(\beta(t) \mid \beta(s)) h(\beta(t), t)}{h(\beta(s), s)},

which is precisely what we’ll call Doob’s hh-transform.

Infinitesimal generator

Imagine we have an arbitrary function gg that maps,

g↦f⋅g′+12L2⋅g′′,g \mapsto f \cdot g^\prime + \frac{1}{2} L^2 \cdot g^{\prime \prime},

or in full notation,

g(x)↦f(x)⋅g′(x)+12L2(x)⋅g′′(x),g(x) \mapsto f(x) \cdot g^{\prime}(x) + \frac{1}{2} L^2(x) \cdot g^{\prime \prime}(x),

We’ll call this mapping/operator AgAg.

The operator AA is called “infinitesimal generator” of the process x(t),t≥0x(t), t \geq 0 with drift ff and diffusion LL.

Let’s write down Itô’s formula with AA.a

Informally,

[E[g(x)∣x(s)=x]−g(x)]t−s→t→s(Ag)(x),\frac{\left[ \mathbb{E}\left[ g(x) \mid x(s) = x \right] - g(x) \right] }{t - s} \xrightarrow{t \to s} (Ag)(x),

note that E[g(x)∣x(s)=x]=g(x)\mathbb{E}[g(x) \mid x(s) = x] = g(x)

Danger (Remark)

Note that h(β(s),s)h(\beta(s), s) is a Martingale 3, because,

h(β(s),s)=∫P(β(t)∣β(s))h(β(t),t)dβ(t),h(\beta(s), s) = \int P(\beta(t) \mid \beta(s)) h(\beta(t), t) d \beta(t),

or in other words, the drift term in Itô’s formula disappears. Hence, (Ag)(x)+∂∂sh(s,x)=0(Ag)(x) + \frac{\partial}{\partial s} h(s, x) = 0.

So, hh solves the backward Kolmogorov equation!

Recall that Equation (2) holds for x(t)x(t) in,

dx(t)=f(x(t),t) dt⏟drift+L(x(t),t) dβ(t)⏟diffusion,dx(t) = \underbrace{f(x(t), t) \, dt}_{\text{drift}} + \underbrace{L(x(t), t) \, d\beta(t)}_{\text{diffusion}},

where β(s)\beta(s) is replaced by x(s)x(s).

Time derivative of AA

Idea: Compute the time derivative of the conditional expectation,

E[g(x(t))∣x(s)=x,x(T)=v],\mathbb{E}[g(x(t)) \mid x(s) = x, x(T) = v],

We’ll call the new AA operator A⋆A^\star.

(∂∂sg+A⋆g)(x)=lim⁡t→sE[g(x(t))∣x(s)=x,x(T)=v]−g(x)t−s=lim⁡t→sE[g(x(t))−g(x(s))∣x(s)=x,x(T)=v]t−s=lim⁡t→s∫g(x(t))−g(x(s))p⋆(x(t)∣x(s)) dx(t)=lim⁡t→s∫[g(x(t))−g(x(s))]h(x(t),t)h(x(s),s)p(x(t)∣x(s)) dx(t)=lim⁡t→sE[[g(x(t))−g(x(s))]h(x(t),t)∣x(s)=x]h(x(s),s)=1h(s,x)((∂∂s+A)(hg))(s,x).\begin{align*} (\frac{\partial}{\partial s} g + A^\star g)(x) & = \lim_{t \to s} \frac{\mathbb{E}[g(x(t)) \mid x(s) = x, x(T) = v] - g(x)}{t - s} \newline & = \lim_{t \to s} \frac{\mathbb{E}[g(x(t)) - g(x(s)) \mid x(s) = x, x(T) = v]}{t - s} \newline & = \lim_{t \to s} \int g(x(t)) - g(x(s)) p^\star(x(t) \mid x(s)) \, dx(t) \newline & = \lim_{t \to s} \int \left[ g(x(t)) - g(x(s)) \right] \frac{h(x(t), t)}{h(x(s), s)} p(x(t) \mid x(s)) \, dx(t) \newline & = \lim_{t \to s} \frac{\mathbb{E}[[g(x(t)) - g(x(s))] h(x(t), t) \mid x(s) = x]}{h(x(s), s)} \newline & = \frac{1}{h(s, x)} \left( \left( \frac{\partial}{\partial s} + A \right) (h g) \right)(s, x). \end{align*}

This holds in general for Markov processes.

Thus, we have,

A⋆g=1hA(hg)=…=Ag+L2∇hh⋅g′=(f+L2∇log⁡h)g′+12L2g′′\begin{align*} A^\star g & = \frac{1}{h} A(h g) = \ldots = Ag + L^2 \frac{\nabla h}{h} \cdot g^\prime \newline & = (f + L^2 \nabla \log h) g^\prime + \frac{1}{2} L^2 g^{\prime \prime} \end{align*}

The hh-transformed process has drift f+L2∇log⁡hf + L^2 \nabla \log h and diffusion L2L^2.

Girsanov’s theorem

Girsanov’s theorem states that, if we have a process x(t)x(t) with drift ff and diffusion LL, then the hh-transformed process x⋆(t)x^\star(t) is defined as,

dx⋆(t)=f(x⋆(t),t) dt+L2(x⋆(t),t)∇log⁡h(x⋆(t),t) dt+L(x⋆(t),t) dβ(t),dx^\star(t) = f(x^\star(t), t) \, dt + L^2(x^\star(t), t) \nabla \log h(x^\star(t), t) \, dt + L(x^\star(t), t) \, d\beta(t),

and the original process x(t)x(t) is defined as,

dx(t)=f(x(t),t) dt+L(x(t),t) dβ(t),dx(t) = f(x(t), t) \, dt + L(x(t), t) \, d\beta(t),

Further, Law(x⋆(t))\mathrm{Law}(x^\star(t)) has density,

∫P(x(0))P(x(t)∣x(0))h(x(t),t)h(x(0),0) dx(0),\int \frac{P(x(0)) P(x(t) \mid x(0)) h(x(t), t)}{h(x(0), 0)} \, dx(0),

Let’s say now that, if we choose a smart hh, we can determine the density of x⋆(t)x^\star(t),

∫P(x(0))P(x(t)∣x(0))h(x(t),t)h(x(0),0) dx(0)=π(x(t)).\int \frac{P(x(0)) P(x(t) \mid x(0)) h(x(t), t)}{h(x(0), 0)} \, dx(0) = \pi(x(t)).

That is what we’ll do in the next part ;).

Also, note that Law(x(t))\mathrm{Law}(x(t)) has density,

∫P(x(0))P(x(t)∣x(0)) dx(0).\int P(x(0)) P(x(t) \mid x(0)) \, dx(0).
Footnotes
  1. Wikipedia: Markov process

    ↩
  2. Wikipedia: Chapman-Kolmogorov equation

    ↩
  3. Wikipedia: Martingale

    ↩

Search

Essays, lecture notes, and research

Type to search the site.