Fokker–Planck Equation
Seen as a stochastic process, the Fokker–Planck equation is the propagator of a continuous Markov process — the deterministic evolution law for the probability density carried by an entire ensemble of noisy trajectories. This article takes that process viewpoint. The Fokker–Planck equation itself — its drift–diffusion structure, its origin as the second-order truncation of the Kramers–Moyal expansion of the master equation, Pawula's theorem, and its Boltzmann stationary state — is derived and owned by `fokker-planck-equation`; we recall those results by name rather than re-deriving them. What we develop here is the pair of Kolmogorov equations and what each is for. There are two adjoint operators. The forward (Kolmogorov-forward) equation, , propagates a density forward in the final variable: given where you start, where will the probability cloud be later? The backward (Kolmogorov-backward) equation, , propagates an observable backward in the initial variable: as a function of where you start, what is the expected value of some future quantity? The two operators are adjoints of each other on the space of densities and observables, and this adjoint relationship is the engine behind first-passage theory. The single most useful thing the backward equation buys you is the mean first-passage time. The average time to first reach a boundary, as a function of the starting point , solves the deceptively simple boundary-value problem . From this one equation flow escape rates, reaction times, the Kramers barrier-crossing formula, neuron firing times, and the exit statistics of gene-expression switches. The forward picture tells you how a cloud spreads; the backward picture tells you how long you wait. Reading the Fokker–Planck equation as the density-level twin of an ensemble of Langevin trajectories — the link owned by `langevin-equation` — ties the whole stochastic-methods chapter together.
- Viewed as a Markov process, the Fokker–Planck equation is the propagator of a continuous stochastic dynamics; the equation, Kramers–Moyal expansion, Pawula truncation, and Boltzmann stationary state are owned by `fokker-planck-equation` and recalled by name here.
- It comes in two adjoint forms: the forward (Kolmogorov-forward) equation propagates densities in the final variable; the backward (Kolmogorov-backward) equation propagates observables/expectations in the initial variable.
- The forward and backward operators and are adjoints: for decaying test functions.
- The mean first-passage time out of a domain solves the backward boundary-value problem with absorbing conditions.
- For free diffusion out of an interval the mean first-passage time is — a closed number for given .
- Key idea: The forward equation answers "where will the probability be?"; the backward equation answers "how long until it gets there?". Their adjoint pairing turns first-passage and escape-time questions into a one-line boundary-value problem .
The forward Fokker–Planck equation answers "where will the probability be?"; its adjoint backward equation answers "how long until it gets there?". The adjoint pairing turns first-passage and escape-time questions into the boundary-value problem .
Where this lives today
The backward equation is the quantitative core of every escape-time problem in modern science. In chemical kinetics it delivers Kramers' reaction-rate theory; in neuroscience it gives the mean firing time of integrate-and-fire neurons driven by synaptic noise; in cell biology it sets the timescales of gene-expression switching and the search times of proteins diffusing to their DNA targets; in finance it prices barrier options through the first-passage statistics of the underlying. Numerically, the forward equation is integrated directly for low-dimensional problems, while for high-dimensional systems one samples the equivalent ensemble of Langevin trajectories (owned by `langevin-equation`) and estimates first-passage statistics by Monte-Carlo — the density and trajectory pictures traded off against dimension. The adjoint pair — forward for "where", backward for "how long" — is the fixed conceptual scaffolding underneath all of it.
Origins · 1 minstochastic differential equation and how this was discovered
The physical picture
Hold two questions apart. First: I release a probability cloud at ; how does it drift and spread as time runs forward? That is the forward equation, and it acts on the final position — the cloud advects with the drift and blurs with the diffusion, exactly the dye-in-flowing-water image owned by `fokker-planck-equation`. Second: I care about some future event — hitting a wall, crossing a barrier — and I want its expected value as a function of where I started. That is the backward equation, and it acts on the initial position. The same dynamics, read from the two ends.
The backward equation is the natural home of first-passage problems because the question "how long until I hit the boundary?" is fundamentally a question about the starting point: two trajectories launched from different places have different expected escape times, and is exactly that map. Its structure is remarkable — an ordinary source-term boundary-value problem, , whose right-hand side "" simply counts one unit of elapsed time per unit time. The punchline figure shows the archetype: for diffusion out of an interval the waiting time is a downward parabola, longest from the middle, zero at the absorbing walls.
:::svg[Punchline — mean first-passage time out of [0,L] is a parabola peaking at the centre]
::: Underneath, this is the ensemble-of-Langevin-paths reading. Each realisation of the associated stochastic differential equation (owned by `langevin-equation`) is one wiggly trajectory; the forward equation is the exact deterministic law for the density of that ensemble, and expectations over the ensemble are precisely what the backward equation computes. The two Kolmogorov equations are the density-level face of trajectory-level noise.
The core equations
The forward operator generates density evolution. We display the standard drift–diffusion form only to fix notation and to name its adjoint; the derivation of this operator from the master equation via the Kramers–Moyal expansion is owned by `fokker-planck-equation`.
where: — probability density; — drift coefficient; — diffusion coefficient; — forward (Kolmogorov-forward) operator acting on densities. The backward operator is its formal adjoint. It acts on observables — functions of the initial state — and propagates their conditional expectations.
where: — expectation of an observable given start at , propagated over remaining time ; — backward (Kolmogorov-backward) operator; note the drift multiplies (not ) — that is the adjoint. The two operators are adjoints under the flat inner product for decaying densities and observables: this is the identity that makes first-passage theory work.
where: — smooth, rapidly decaying test functions so that all boundary terms from integration by parts vanish. The mean first-passage time out of a domain solves the backward equation with a constant source. It is the single most useful application of the whole formalism.
where: — mean first-passage (exit) time starting from ; the source counts one unit of elapsed time per unit time; absorbing (Dirichlet) conditions set where the particle is removed on contact. For free diffusion (, ) out of the interval with both ends absorbing, equation (4) integrates to a closed form — the parabola of the punchline figure.
where: — starting position in ; — diffusion constant; is largest from the centre, zero at each wall.
The core derivations
The goal is to establish the pairing by integration by parts, and to read off why the drift enters the two operators differently — inside the derivative for the forward (conservative, current) form, outside it for the backward (transport) form. This adjointness is not a formality: it is exactly what lets us convert a statement about densities (forward) into a statement about starting-point expectations (backward), which is the whole basis of first-passage and escape-time calculations.
Step 1. Write the forward action and pair it with a test function :
Why: insert the definition of from equation (1); plays the role of a density, of an observable.
Step 2. Integrate the drift term by parts once and the diffusion term twice, discarding boundary terms:
Why: for rapidly decaying the surface terms vanish; each derivative moves off the or factor and onto , and the diffusion term's two integrations by parts leave un-differentiated multiplying .
Step 3. Collect the two results:
Why: the bracket is exactly from equation (2) — drift outside the derivative, diffusion coefficient outside the second derivative. The adjoint is proven.
Step 4. Note the asymmetry: forward has (probability-current form, so it conserves ); backward has (a transport/advection form acting on observables). Why: the forward operator must conserve total probability, which forces the drift inside the derivative; the backward operator propagates expectations, which do not need to be conserved, so the drift sits outside. Verified: the adjoint identity is checked symbolically on an Ornstein–Uhlenbeck test case in verify_aq-sm-fokker-planck-equation-sm11.py.
Go deeper · Derivation B · 1 minMean first-passage time from the backward equation
The goal is to show that the average exit time solves with absorbing boundaries, and to integrate it explicitly for free diffusion to the closed parabola . This is the payoff of the adjoint structure: a hard-looking question ("how long until escape?") becomes an elementary second-order boundary-value problem, and its solution is a real number for given parameters.
Step 1. Define . Condition on the first infinitesimal step over :
Why: the total exit time is the elapsed plus the remaining expected exit time from the new position, averaged over the stochastic step.
Step 2. Expand to second order using and :
Why: these are the drift and diffusion jump moments of the process; higher moments are and drop out.
Step 3. Substitute into Step 1 and cancel ; divide by :
Why: the bracket acting on is exactly ; moving the across gives the source term.
Step 4. Solve for free diffusion () on with :
Why: integrate twice; the two absorbing conditions fix the constants, yielding the symmetric parabola peaking at the midpoint. Verified: , the boundary values , and the midpoint value (L=2 µm, D=0.43 µm²/s) are all checked in verify_aq-sm-fokker-planck-equation-sm11.py.
Limiting cases
The two Kolmogorov equations specialise to the standard named equations depending on drift and diffusion; the underlying operator theory is owned by `fokker-planck-equation`.
| Case | Result | Meaning |
|---|---|---|
| Free diffusion (forward) | Drift zero: the heat equation. Density spreads with variance . | |
| Free diffusion (backward, MFPT) | Exit-time parabola on an absorbing interval. | |
| Ornstein–Uhlenbeck (backward) | Restoring drift; expectations relax on time ; stationary variance . | |
| High barrier (Kramers) | over a barrier | Escape time is exponentially long in the barrier height — Arrhenius law from the backward equation. |
Worked examples
Example 1 — Mean first-passage time of a colloid across a channel (a real number). A tracer with (a m sphere in water at 300 K) diffuses freely in a channel of length m with absorbing ends. How long, on average, does it take to escape when released from the centre?
Step 1. Free diffusion has , so the backward equation is with ; the solution is from equation (5).
Step 2. At the centre , .
Step 3. Plug numbers: . A particle released at the middle escapes in a little over one second on average; released nearer a wall it escapes faster, as the parabola shows.
Example 2 — Adjointness check on an Ornstein–Uhlenbeck process. For linear drift and constant diffusion , confirm that using decaying Gaussians , .
Step 1. Forward: .
Step 2. Backward: .
Step 3. Both integrals evaluate to the same value (the symbolic difference is zero), confirming the adjoint pairing; the stationary density of is the Gaussian of variance , whose zero-current condition is satisfied identically. The number to remember: an OU process relaxes on timescale to a Gaussian of variance .
Going further
Texts. Pathria & Beale, Statistical Mechanics, 3rd ed., ch. 15 (Fluctuations and Brownian motion) · Risken, The Fokker–Planck Equation, 2nd ed., ch. 5–8 · Gardiner, Handbook of Stochastic Methods, ch. 5 (first-passage times) · van Kampen, Stochastic Processes in Physics and Chemistry, ch. VIII, XII · Redner, A Guide to First-Passage Processes · Kardar, Statistical Physics of Particles, ch. 9.
Provenance. The Fokker–Planck equation itself, the Kramers–Moyal expansion, Pawula's theorem, the drift/diffusion structure, and the Boltzmann stationary state are derived and owned by `fokker-planck-equation`; this article recalls them by name and does not reproduce those derivations. The forward/backward adjoint structure and the mean-first-passage-time boundary-value problem follow Gardiner ch. 5, Risken ch. 8, and Redner. A verifier should: (i) confirm the operator adjointness by integration by parts on a test case; (ii) solve on and recover ; (iii) check the OU stationary variance . The Brownian number is the Stokes–Einstein value for a 1 μm sphere in water at 300 K.
Builds on: Markov Processes and the Markov Property · Chapman–Kolmogorov Equation · The Master Equation · Langevin Equation and Stochastic Differential Equations. Leads to: Fluctuation–Dissipation Theorem · Detailed Balance and Microscopic Reversibility · Monte Carlo Method · Kinetic Theory and the Boltzmann Equation.
If the Fokker–Planck equation is owned by another article, what does this one add?
The equation, its Kramers–Moyal derivation, Pawula's theorem, and the Boltzmann stationary state are owned by `fokker-planck-equation`. This article adds the process reading: the pair of adjoint Kolmogorov equations (forward for densities, backward for expectations), the adjointness identity itself, and — the practical payoff — mean-first-passage-time theory via . In short, the other article tells you what the equation is and where it comes from; this one tells you how to use it to answer "how long until escape?" and how it sits as the density twin of an ensemble of Langevin trajectories.
Why does the drift appear inside the derivative forward but outside it backward?
Probability conservation. The forward equation must keep , and the only way a first-order term can conserve the integral is if it is a pure divergence, — a probability current. The backward equation propagates expectations, which are not conserved quantities, so its drift term is a plain advection . The difference is exactly the difference between an operator and its adjoint: integration by parts moves the derivative from acting on to acting on the test function, flipping the drift from inside to outside.
What does the source term "−1" in mean physically?
It counts time. The mean first-passage time accumulates one unit of elapsed time for every unit of real time the particle survives inside the domain, so the "clock" contributes a constant rate of per unit time; moving it to the other side of the backward operator gives the source. Concretely, conditioning on one infinitesimal step, , and the becomes the source. If instead you asked for the mean of some other accumulated observable , the source would be .
How is this the "ensemble of Langevin paths"?
A single realisation of the stochastic differential equation (the Langevin picture, owned by `langevin-equation`) is one jagged trajectory. Launch a whole ensemble of them from the same start and their instantaneous density obeys the forward Fokker–Planck equation exactly — that is the trajectory/density duality. Any expectation over the ensemble (an escape time, a hitting probability, a conditional average) is what the backward equation computes as a function of the launch point. So the two Kolmogorov equations are simply the deterministic, ensemble-level bookkeeping of the same noisy dynamics that the SDE runs one path at a time.
Does the backward equation give the Kramers escape rate?
Yes, in the high-barrier limit. Set up for a particle in a double well with absorbing conditions past the barrier. Because escape requires a rare thermal fluctuation over the barrier, the mean first-passage time is dominated by an Arrhenius factor , and the escape rate is its reciprocal — Kramers' formula, with a friction- and curvature-dependent prefactor. The full Kramers prefactor and the turnover between friction regimes are developed in `fokker-planck-equation`; here the point is that the backward equation is the clean route to the exponential barrier-height dependence.
Can the first-passage problem be solved in more than one dimension?
The boundary-value problem with on the absorbing part of the boundary holds in any dimension — it is just an elliptic partial differential equation for . What changes is solvability: in one dimension you integrate twice and read off a closed form, but in higher dimensions closed forms exist only for special geometries (spheres, rectangles), and otherwise one solves the PDE numerically or samples Langevin trajectories. The conceptual structure — backward operator, constant source, absorbing boundary — is dimension-independent; only the ease of solution degrades.
What is the stationary variance of an Ornstein–Uhlenbeck process and why does it matter here?
For linear restoring drift and constant diffusion , the stationary density is a Gaussian of variance , obtained by setting the probability current to zero, . It matters because the OU process is the linearised model near any potential minimum, so is the local equilibrium spread of essentially every confined stochastic system, and is the local relaxation time that sets how fast expectations (backward equation) approach their equilibrium values. It is the simplest non-trivial testbed for both Kolmogorov equations.