Introduction#

In previous presentations, we [AR, AvM] talked about stochastic differential equations (middle box in Fig. 1). Examples:

Brownian motion

X˙(t)=ξ(t)

X(t)=N(0,t)

Drift-diffusion processes

X˙(t)=f(t,X)+ξ(t)

dX(t)=f(t,X)dt+g(t,X)dW

_images/p6-table11-three-levels-description.png

Fig. 1 (Risken, Table 1.1)#

We also talked about the fact that the “white noise” ξ in a Langevin equation is ill-defined.

Itô convention
ΔX(ti)=f(ti,X(ti))Δt+g(ti,X(ti))ΔW(ti))+g(ti+1,X(ti+1))
Stratonovich convention
ΔX(ti)=f(ti,X(ti))Δt+g(ti,X(ti))+g(ti+1,X(ti+1))2ΔW(ti)
Anticipatory (or Hänggi-Klimontovich) convention
ΔX(ti)=f(ti,X(ti))Δt+g(ti+1,X(ti+1))ΔW(ti)+g(ti,X)

This ambiguity of convention arises because the infinitesimal limit of white noise is mathematically well-defined (within a given convention), but non physical.

A full solution to a Langevin equation typically takes the form of a probability density function (PDF), which, if the system is Markovian, can be written as p(t,X). Now, this PDF is physical, so a differential equation for p(t,X) should not suffer from ambiguity. The Fokker-Planck equation is such a differential equation:

(1)#p(t,x)t=ixi[Di(1)(x)p(t,x)]+i,j2xixj[Dij(2)(x)p(t,x)]
_images/p29-fig22-density-at-3-times.png

Fig. 2 The kind of problem we want to solve: given an initial probability distribution, how does it evolve over time ? Often, but not always, the initial condition is a Dirac δ. (Risken, Fig. 2.2)#

A stochastic process is a generalization of a random variable. Intuitively, we assign to each tR a random variable (as suggested by Fig. 2). More precisely, to any countable set of times, the process associates a joint distribution. So if xRN,

  • p(t1,x1) is the PDF of a random variable on RN;

  • p(t2,x2,t1,x1) is the PDF of a random variable on R2N;

  • p(t3,x3,t2,x2,t1,x1) is the PDF of a random variable on R3N;

  • etc.

One obtains a lower dimensional distribution by marginalising over certain time points:

p(t3,x3,t1,x1)=p(t3,x3,t2,x2,t1,x1)dx2

For a Markov process, this becomes the Chapman-Kolmogorov equation:

p(t3,x3t1,x1)=p(t3,x3t2,x2)p(t2,x2t1,x1)