First-Passage and Exit Time Problems
We take from fokker-planck-equation the diffusion generator that evolves a probability density under drift and diffusion, and from langevin-equation the underlying stochastic differential equation for a single noisy trajectory. This article owns what those descriptions leave open: not where the particle is, but when it first arrives somewhere. A first-passage problem fixes a target — a point, a boundary, a set — and studies the random time at which a trajectory first reaches it. Unlike equilibrium quantities, which describe steady-state distributions, first-passage statistics are intrinsically dynamical and transient. They answer: when does a diffusing molecule first bind, when does a fluctuating population first go extinct, when does an activated system first cross a barrier, when does a random walker first return home? The mathematical engine is the backward Kolmogorov (adjoint Fokker–Planck) equation. Whereas the forward equation evolves in the final variable, first-passage statistics are most naturally written in terms of the initial condition . Fixing the target and varying the starting point yields an elliptic boundary-value problem: the survival probability and every moment of the first-passage time satisfy equations with the adjoint generator , subject to absorbing conditions at the target and reflecting (or natural) conditions elsewhere. The key result is disarmingly simple — the mean first-passage time solves . The simplest cases are spectacularly useful. In one dimension the mean first-passage time is an explicit double quadrature over drift and diffusion, needing no eigenfunction expansion; for free diffusion on an interval it collapses to . For escape over a high barrier the same quadrature is dominated by a saddle point, reproducing Kramers' rate and the Arrhenius temperature dependence that underlies chemical kinetics, nucleation, protein folding, and magnetic switching. The exponential separation of the barrier-crossing timescale from the intrawell relaxation makes the long-time first-passage distribution a single exponential — a memoryless Poisson process.
- First-passage theory asks: how long until a stochastic process first reaches a target or hits a boundary, and where does it exit?
- The central quantity is the mean first-passage time (MFPT) , solving the backward (adjoint) equation with absorbing boundary conditions.
- Survival probability decays — often exponentially at long times — and is the first-passage-time density.
- For free diffusion on with absorbing ends, , so from the center .
- Kramers' escape over a barrier gives the Arrhenius law , with a prefactor set by curvatures at the minimum and the saddle.
- Splitting probabilities (which boundary is hit first) solve the homogeneous backward equation and are the committor functions of reaction-rate theory.
- Key idea: condition on the starting point, not the endpoint — survival probability and all first-passage moments satisfy the adjoint generator acting on the initial coordinate with absorbing boundary conditions, and the MFPT solves .
Condition on the starting point, not the endpoint: survival probability and all first-passage moments satisfy the adjoint (backward) generator equation acting on the initial coordinate , with absorbing boundary conditions at the target. The mean first-passage time then solves ; in one dimension this is an explicit double quadrature, and over a barrier it becomes Kramers' Arrhenius rate.
Where this lives today
First-passage theory is the quantitative backbone of rate processes across science. In chemical physics and biophysics, Kramers' theory computes reaction and protein-folding rates, and the committor surface provides the rigorous reaction coordinate used by transition-path sampling and Markov state models built from molecular-dynamics trajectories. In cell biology, narrow-escape and diffusion-limited-reaction theory sets the timescales of ligand–receptor binding and intracellular search. In population genetics, splitting probabilities are Kimura's fixation probabilities and MFPTs are mean times to extinction. And in Monte Carlo and molecular dynamics, the first-passage time to escape a metastable basin sets the autocorrelation time and diverges near phase transitions (critical slowing down) — the very problem that motivates the cluster algorithms and enhanced-sampling methods of the neighboring articles.
The physical picture
Imagine many independent particles wandering on a landscape with a trapdoor. The survival probability is the fraction still wandering after time . Because each survivor 'forgets' its past (the Markov property), at long times survivors leave at a constant per-unit-time rate, so and is the mean lifetime. The backward equation re-reads the same physics from the starting line: ask not 'where will the particle be?' but 'starting here, how long until I'm caught?'. Averaging the one-step rule over the first infinitesimal move gives an equation in the starting coordinate — the adjoint of the Fokker–Planck operator that fokker-planck-equation develops for the forward density.
The survival curve's area is the mean first-passage time. The inset is the punchline: plotting against gives a straight Arrhenius line of slope , so a modest barrier suppresses the rate by (red point) — the exponential sensitivity that makes activated rates span dozens of orders of magnitude.
For barrier crossing the timescales split cleanly: the particle rattles in a well for an astronomically long time (set by ) before a rare fluctuation carries it over; the crossing itself is fast. This separation is why activated rates are universal. Splitting probabilities answer 'which exit?' rather than 'when?' — they are harmonic-like functions interpolating between 0 and 1 across the domain, exactly the committor that quantifies how 'committed' a configuration is to one basin versus another.
The committor solves the source-free backward equation and runs monotonically from 0 to 1. For driftless diffusion it is the linear gambler's-ruin ramp ; its -surface defines the transition state exactly.
The core equations
Survival is the probability that a trajectory started at has not yet been absorbed by time ; it is the integral of the propagator with an absorbing boundary.
where: — probability the process from has not hit by time ; — propagator with absorbing boundary on ; — the open interior; — the absorbing target. Reading: survival decays as probability leaks out through the target. Survival obeys the backward equation — the adjoint generator acts on the initial coordinate, the defining feature of first-passage theory.
where: — adjoint of the Fokker–Planck generator (recalled from fokker-planck-equation, whose forward generator is ); — drift; — diffusion coefficient. The sign of the drift term flips between forward and backward operators — that flip is the adjoint. The mean first-passage time is the time-integral of survival, and it solves an inhomogeneous backward equation with a constant source.
where: — mean first-passage time from , with on absorbing boundaries and on reflecting ones. Reading: the constant source counts one unit of elapsed time per unit of survival. In one dimension (3) integrates to an explicit double quadrature — no PDE solving.
where: — integrating factor, with for thermal drift ; (lower) reflecting and (upper) absorbing. The committor and Kramers rate both follow from this one formula.
where: — probability of exiting at before ; — curvatures at the well minimum and the barrier top; — friction (); — barrier height. Reading: the committor weights paths by Boltzmann factors of the intervening landscape; the Kramers prefactor is set by both curvatures.
The goal is to derive the defining equation for the mean first-passage time, starting from nothing but the Markov property and the moments of a diffusive step. The strategy is to write survival to time as the average over the first infinitesimal move of survival for the remaining time — this is where conditioning on the initial coordinate produces the adjoint generator — then to expand to first order in , giving the backward evolution equation, and finally to integrate over all time using and (certain escape) to convert the evolution equation into the MFPT equation with its constant source term.
Step 1. By the Markov property, — surviving to from means surviving the first step (to ) and then surviving the remaining time from the new point. Why: the future depends only on the current position, so the total survival factorizes into 'first step' times 'rest', and averaging over the random first step is the only stochastic operation.
Step 2. Use the Itô moments of the increment, and , and Taylor-expand to second order. Why: diffusion has (not ), so the second-derivative term survives to while odd moments vanish — this is what turns a random walk into a diffusion operator.
Step 3. Collecting terms gives , i.e. with the operator acting on the initial coordinate . Why: the derivatives are with respect to the starting point , not the final point — this adjoint (backward) form is the mathematical signature of a first-passage question.
Step 4. Define (the mean lifetime, since is the first-passage density and integration by parts gives ). Integrate the backward equation over all : the left side gives , the right side gives . Hence . Why: the constant is exactly the initial survival minus the eventual ; it is the source that makes finite. Verified by verify_aq-sm-first-passage-problems.py: solving on with returns , and the backward operator is confirmed to differ from the forward Fokker–Planck operator by the sign of the drift term.
Go deeper · Derivation B · 1 minKramers escape rate by saddle-point on the MFPT quadrature
The goal is to reduce the exact one-dimensional MFPT double quadrature (4) to the celebrated Kramers/Arrhenius escape rate for a particle in a deep potential well, exposing why the prefactor depends on the curvatures at both the minimum and the barrier top. The method is Laplace's saddle-point approximation applied twice: the outer integral over the integrating factor is sharply peaked at the barrier saddle, while the inner integral over is concentrated at the well minimum; expanding to quadratic order at each stationary point turns both into Gaussian integrals whose widths supply the curvature prefactor and whose exponents combine into the Arrhenius factor.
Step 1. Insert thermal drift , so , giving . Why: for an overdamped thermal system the integrating factor is exactly the Boltzmann factor, which is what makes the quadrature analytically tractable by steepest descent.
Step 2. The outer factor is maximal at the barrier ; expand and do the Gaussian integral to get . Why: a high barrier makes extremely peaked at the saddle, so only the neighborhood of contributes and the quadratic expansion is accurate.
Step 3. The inner factor is concentrated at the minimum ; expand to , giving . Why: the Boltzmann weight is peaked at the well bottom, and the upper limit already captures the full peak of the inner integrand.
Step 4. Multiply the two Gaussian factors and collect: , so . Why: the -factors from the two Gaussian widths combine with to leave the pure curvature prefactor, and the exponents add to — the Arrhenius activation. Verified by verify_aq-sm-first-passage-problems.py: the assembled rate equals symbolically, and the Arrhenius suppression is confirmed numerically.
Limiting cases
| Case | Result | Meaning |
|---|---|---|
| Free diffusion, 1D, to origin | Recurrent (returns with probability 1) but the mean first-passage time diverges — the Sparre-Andersen / Lévy–Smirnov heavy tail. Return is certain yet typically very slow. | |
| Diffusion with drift toward target | A bias toward the target gives a finite, ballistic-scale MFPT; the diffusive correction is exponentially small when the Péclet number . | |
| Kramers escape, high barrier | Overdamped Arrhenius law: exponentially long lifetime, prefactor set by curvatures at minimum and saddle. Valid for . | |
| Random walk, dimension | : recurrent; : transient | Pólya's theorem: a diffuser returns to its origin with probability 1 in but escapes to infinity with finite probability for . |
Worked examples
Example 1 — How long for a protein to diffuse across a cell (free-diffusion MFPT, a real number). A protein with diffusion coefficient must diffuse across a cell of size . Model it as free 1D diffusion on with absorbing ends (targets on both sides), starting from the center.
Step 1. Solve the backward equation with : integrating twice and applying the boundary conditions gives .
Step 2. From the center : .
Step 3. If instead only one wall absorbs and the other reflects (a receptor on one side), the MFPT from that wall is — four times longer, since the particle can waste time drifting away from the single target. Both numbers reproduced by the verifier, including a Monte-Carlo simulation of free diffusion that recovers to within 3%.
Example 2 — Kramers escape over a modest barrier (Arrhenius suppression, a real number). A bistable system (a magnetic domain, a chemical reaction, a folding intermediate) sits in a well behind a barrier of height .
Step 1. The escape rate carries the Arrhenius factor : the rate is suppressed by more than two orders of magnitude relative to the curvature-set attempt frequency.
Step 2. Equivalently the mean lifetime is enhanced by attempt times. Reproduced by the verifier. A barrier of would suppress the rate by — the exponential sensitivity is why reaction rates span dozens of orders of magnitude for barriers differing by only a few , and why the curvature prefactor, though important, is a small correction to the dominant exponential.
Origins · 1 minfirst passage time and how this was discovered
Going further
References. Pathria & Beale, Statistical Mechanics, 3rd ed., Ch. 15 (stochastic processes) · Kardar, Statistical Physics of Particles, Ch. 9 · Reif, Fundamentals of Statistical and Thermal Physics, Ch. 15 · Sethna, Statistical Mechanics: Entropy, Order Parameters, and Complexity, Ch. 8 · Risken, The Fokker–Planck Equation, 2nd ed., Ch. 5 & 8 · Redner, A Guide to First-Passage Processes (2001) · Gardiner, Handbook of Stochastic Methods, Ch. 5 · Hänggi, Talkner & Borkovec, Rev. Mod. Phys. 62, 251 (1990) — reaction-rate theory · van Kampen, Stochastic Processes in Physics and Chemistry, Ch. XII
Provenance. Backward-equation and MFPT formulas are standard (Gardiner Handbook of Stochastic Methods Ch. 5; Risken Ch. 5; van Kampen Ch. XII). A verifier should: (1) confirm the 1D MFPT double-quadrature with integrating factor ; (2) check the Kramers overdamped rate prefactor and Arrhenius exponent against Hänggi–Talkner–Borkovec RMP 62, 251 (1990) Eq. (4.6); (3) verify the driftless splitting probability and interval MFPT (Redner Ch. 1); (4) confirm the first-passage tail for 1D Brownian motion (Lévy–Smirnov) and Pólya recurrence/transience by dimension. All numbers (exponents, prefactor form, Smoluchowski ) are textbook-standard; none fabricated.
Builds on: Markov Processes and the Markov Property · Fokker–Planck Equation · Chapman–Kolmogorov Equation · Langevin Equation and Stochastic Differential Equations Leads to: Cluster Algorithms and Critical Slowing Down · Monte Carlo Method · Molecular Dynamics Simulation · Detailed Balance and Microscopic Reversibility
What is the difference between the forward and backward Fokker–Planck equations?
The forward equation (from fokker-planck-equation) evolves the probability density in the final variable : with . The backward equation evolves observables in the initial variable : with . They are adjoints — the drift term flips sign and the diffusion coefficient moves outside the derivatives. First-passage questions (survival, MFPT, committor) are naturally posed in the initial condition, so they always use .
Why does the survival probability decay exponentially at long times?
Expand survival in eigenfunctions of the absorbing-boundary generator, with . Absorbing boundaries make the spectrum discrete and strictly positive (probability leaks out, so there is no zero mode). After the fast transients from higher modes die away, only the slowest survives: , so decay becomes a single exponential with rate . For barrier crossing is exponentially small (Kramers), giving a huge spectral gap and a memoryless Poisson escape.
Is the mean first-passage time always finite?
No. For free 1D diffusion to a point target, return is certain (the process is recurrent) but the mean return time is infinite because the first-passage density has a heavy tail. Finiteness of the MFPT requires either confinement (a bounded domain with absorbing boundary), a drift toward the target, or dimension-dependent transience. This is why 'recurrent' (returns with probability 1) and 'positive-recurrent' (returns with finite mean time) are genuinely different properties, and why one must always check the tail before quoting an MFPT.
What is the committor and why is it the 'right' reaction coordinate?
The committor is the probability that a trajectory started at reaches product basin before reactant basin ; it solves the source-free backward equation with . The surface is the set of configurations equally committed to either basin — the rigorous transition state. Unlike a guessed geometric coordinate, the committor is defined purely by the dynamics, so rates computed from it are exact. Estimating committors from short trajectories is the basis of transition-path sampling and Markov state modeling.
How does Kramers' theory connect to the Arrhenius law of chemistry?
Kramers models a reaction as escape of a Brownian particle over a free-energy barrier along a reaction coordinate. The MFPT gives the rate , where the exponential is precisely the empirical Arrhenius factor with the activation energy, and the prefactor is the Kramers/Arrhenius attempt frequency set by the well and barrier curvatures and the friction. So Kramers gives a microscopic, first-passage derivation of a law that chemistry had used empirically since Arrhenius in 1889.
Does the escape rate depend on friction, and how?
In the overdamped (Smoluchowski) regime treated here, : more friction slows escape because diffusion over the barrier is slower (). But the full Kramers picture is non-monotonic — the celebrated 'turnover'. At very low friction the bottleneck is energy diffusion (the particle cannot gain enough energy to cross), so ; at high friction it is spatial diffusion, so ; the rate peaks at intermediate friction. The overdamped formula in this article is the high-friction branch, appropriate for reactions in solution.
How is first-passage theory used in molecular simulation?
Two ways. First, the time to escape a metastable basin is a first-passage time, and it sets the autocorrelation time that limits ergodic sampling — near a phase transition this diverges (critical slowing down), motivating cluster algorithms and replica exchange. Second, committors and MFPTs computed from many short trajectories are the ingredients of Markov state models and transition-path sampling, which stitch together brief simulations into rigorous long-time kinetics. First-passage theory is thus both the problem (slow barrier crossing) and part of the solution (rate extraction from short runs) in modern enhanced-sampling methods.