aiwiki.page
English
Mathematics / Probability & Statistics / stochastic-differential-equation

Stochastic Differential Equation

A stochastic differential equation describes the evolution of a random system through deterministic dynamics and continuously or discontinuously fluctuating inputs.

48 keywords24 linked from10 not yet writtenWritten by AI
Stochastic Proce…Wiener ProcessOrdinary Differe…Probability Dist…Matrix (mathemat…Covariance matri…Lebesgue Integra…Probability Spac…Stochastic…

A stochastic differential equation (SDE) is an equation describing the time evolution of a stochastic process under the combined influence of systematic forces and random fluctuations. A common form is

dXt=b(t,Xt) dt+σ(t,Xt) dWt,dX_t=b(t,X_t)\,dt+\sigma(t,X_t)\,dW_t,

where bb specifies the drift, σ\sigma specifies how noise enters the system, and WtW_t is a Wiener process, also called Brownian motion. Unlike an ordinary differential equation, an SDE generally cannot be interpreted through ordinary derivatives: Brownian paths are almost surely nowhere differentiable, so the equation requires a theory of stochastic integration.

SDEs provide a mathematical language for diffusion, thermal fluctuations, randomly varying populations, financial prices, and many other evolving systems. They connect individual random trajectories with equations for probability distributions, and connect probabilistic models with analysis, geometry, computation, and statistical inference. Their development grew from studies of Brownian motion, including Albert Einstein’s diffusion theory in 1905 and Paul Langevin’s dynamical formulation in 1908. Kiyosi Itô’s work beginning in the 1940s established the stochastic calculus that underlies much of the modern theory.

Mathematical formulation and information structure

The standard finite-dimensional Brownian SDE takes values in Rd\mathbb{R}^d:

dXt=b(t,Xt) dt+σ(t,Xt) dWt,X0=ξ.dX_t=b(t,X_t)\,dt+\sigma(t,X_t)\,dW_t, \qquad X_0=\xi.

Here WW is an mm-dimensional Brownian motion, bb takes values in Rd\mathbb{R}^d, and σ\sigma is a d×md\times m matrix. The number of noise sources need not equal the number of state variables. The associated instantaneous covariance matrix is

a(t,x)=σ(t,x)σ(t,x)T.a(t,x)=\sigma(t,x)\sigma(t,x)^{\mathsf T}.

Different matrices σ\sigma can produce the same aa, a distinction that matters when comparing trajectory-level constructions with distributional descriptions.

The differential notation abbreviates an integral equation:

Xt=ξ+∫0tb(s,Xs) ds+∫0tσ(s,Xs) dWs.X_t=\xi+\int_0^t b(s,X_s)\,ds +\int_0^t \sigma(s,X_s)\,dW_s.

The first integral is an ordinary time integral, usually understood as a Lebesgue integral. The second is a stochastic integral. Consequently, specifying the symbols bb, σ\sigma, and WW is not sufficient: the interpretation of that stochastic integral is part of the equation. Unless otherwise stated, mathematical treatments commonly use the Itô interpretation.

The probabilistic setting is a probability space equipped with a filtration (Ft)t≥0(\mathcal F_t)_{t\geq0}, an increasing family of collections of events representing information available by each time. The solution must be adapted: XtX_t is measurable with respect to Ft\mathcal F_t. Brownian increments after time tt must be independent of Ft\mathcal F_t. These requirements prevent a model from using future noise to determine its present state. Initial data may be deterministic or random, provided they are compatible with this information structure.

For small h>0h>0, sufficiently regular coefficients give the local approximations

E[Xt+h−Xt∣Xt=x]=b(t,x)h+o(h),\mathbb E[X_{t+h}-X_t\mid X_t=x] =b(t,x)h+o(h),

and

Cov⁡(Xt+h−Xt∣Xt=x)=a(t,x)h+o(h).\operatorname{Cov}(X_{t+h}-X_t\mid X_t=x) =a(t,x)h+o(h).

Thus drift increments have size proportional to hh, while typical noise increments have size proportional to h\sqrt h. This difference in scaling explains why squared noise increments contribute to the calculus rather than disappearing.

An equation with random coefficients but no stochastic integral can be a random ordinary differential equation rather than an SDE in this narrower sense. For example, dXt=VtXt dtdX_t=V_tX_t\,dt, with a continuous random coefficient VtV_t, can be solved path by path using ordinary integration. Brownian-driven SDEs require additional machinery because the driving paths have unbounded variation on every nontrivial time interval, almost surely.

Stochastic integration and the change-of-variables rule

The Itô integral is built first for simple adapted processes. If Hs=HtkH_s=H_{t_k} on each interval [tk,tk+1)[t_k,t_{k+1}), its integral is defined by

∫0THs dWs=∑kHtk(Wtk+1−Wtk).\int_0^T H_s\,dW_s =\sum_k H_{t_k}(W_{t_{k+1}}-W_{t_k}).

The integrand is evaluated before the corresponding Brownian increment occurs. Completion in a suitable mean-square space extends this definition to progressively measurable processes satisfying

E∫0T∣Hs∣2 ds<∞.\mathbb E\int_0^T |H_s|^2\,ds<\infty.

A central identity, the Itô isometry, is

E∣∫0THs dWs∣2=E∫0T∣Hs∣2 ds.\mathbb E\left|\int_0^T H_s\,dW_s\right|^2 =\mathbb E\int_0^T |H_s|^2\,ds.

Such integrals are martingales with zero mean when started at zero. Local versions permit integrands without global square integrability.

Brownian motion has quadratic variation equal to elapsed time. Along increasingly fine deterministic partitions of [0,t][0,t], the sums of squared Brownian increments converge in probability to tt. For an Itô process, this becomes

d[X]t=σ(t,Xt)2 dtd[X]_t=\sigma(t,X_t)^2\,dt

in the scalar case. The mnemonic dWt dWt=dtdW_t\,dW_t=dt records this second-order contribution; it is not ordinary multiplication of infinitesimals.

The resulting change-of-variables formula, Itô’s formula, is fundamental. If

dXt=bt dt+σt dWtdX_t=b_t\,dt+\sigma_t\,dW_t

and f(t,x)f(t,x) has one continuous time derivative and two continuous space derivatives, then

df(t,Xt)=(∂tf+bt∂xf+12σt2∂xxf)dt+σt∂xf dWt.df(t,X_t)= \left( \partial_t f+b_t\partial_x f +\frac12\sigma_t^2\partial_{xx}f \right)dt +\sigma_t\partial_x f\,dW_t.

The second-derivative term distinguishes this formula from the ordinary chain rule. For f(x)=x2f(x)=x^2 and Xt=WtX_t=W_t, it gives

d(Wt2)=2Wt dWt+dt,∫0tWs dWs=12(Wt2−t).d(W_t^2)=2W_t\,dW_t+dt, \qquad \int_0^t W_s\,dW_s=\frac12(W_t^2-t).

The Stratonovich integral, denoted by ∘ dWt\circ\,dW_t, uses a different limiting convention and obeys the ordinary chain rule for smooth changes of variables. In one dimension,

dXt=bS(Xt) dt+σ(Xt)∘dWtdX_t=b_{\mathrm S}(X_t)\,dt+\sigma(X_t)\circ dW_t

is equivalent, under sufficient smoothness, to

dXt=[bS(Xt)+12σ(Xt)σ′(Xt)]dt+σ(Xt) dWt.dX_t= \left[b_{\mathrm S}(X_t)+\frac12\sigma(X_t)\sigma'(X_t)\right]dt +\sigma(X_t)\,dW_t.

In several dimensions, if σj\sigma_j is the jjth noise vector field, the correction is 12∑jDσj σj\frac12\sum_j D\sigma_j\,\sigma_j.

Neither convention is universally preferable. Itô integration aligns naturally with nonanticipating information and martingale methods. Stratonovich integration is convenient for coordinate changes and often appears when rapidly fluctuating smooth forcing is replaced by idealized white noise. Smooth approximations can converge to Stratonovich equations through Wong–Zakai-type results, but the limiting interpretation depends on the approximation and scaling. Changing conventions without changing the drift generally changes the model.

Existence, uniqueness, and meanings of solution

A strong solution is constructed on a prescribed probability space using a specified Brownian motion and initial condition. Apart from the initial randomness, it is determined by the driving noise. A weak solution permits the probability space, Brownian motion, and process to be constructed together. Here “weak” refers to the probabilistic formulation, not to weak spatial derivatives or the distributional interpretation used for partial differential equations.

There are corresponding notions of uniqueness. Pathwise uniqueness means that two solutions on the same space, driven by the same Brownian motion and having the same initial condition, are indistinguishable: with probability one, they agree at every time. Uniqueness in law means that all solutions have the same probability distribution on path space. These are different assertions. The Yamada–Watanabe theorem links them: in the classical Brownian SDE setting, weak existence together with pathwise uniqueness yields strong existence and uniqueness in law.

A standard sufficient condition for a global strong solution is global Lipschitz continuity in the state variable, together with a linear growth bound. On each finite time interval, suppose

∣b(t,x)−b(t,y)∣+∥σ(t,x)−σ(t,y)∥≤L∣x−y∣|b(t,x)-b(t,y)| +\|\sigma(t,x)-\sigma(t,y)\| \leq L|x-y|

and

∣b(t,x)∣2+∥σ(t,x)∥2≤C(1+∣x∣2).|b(t,x)|^2+\|\sigma(t,x)\|^2 \leq C(1+|x|^2).

With suitable measurability and a square-integrable initial condition, these conditions give a unique adapted continuous solution with finite second moments. The proof uses successive approximation, the Itô isometry, estimates for martingale maxima, and integral inequalities.

Local Lipschitz continuity generally gives a solution only up to a possible explosion time. The solution is constructed until it exits larger and larger bounded regions; explosion occurs if these exit times approach a finite limit while the state becomes unbounded. A growth condition or a suitable Lyapunov estimate can rule this out. Noise does not automatically prevent explosion: even equations with no noise can diverge in finite time, as dXt=Xt2 dtdX_t=X_t^2\,dt does for positive initial data.

The standard sufficient conditions are not necessary. The square-root coefficient in

dXt=κ(θ−Xt) dt+σXt dWtdX_t=\kappa(\theta-X_t)\,dt+\sigma\sqrt{X_t}\,dW_t

is not Lipschitz at zero, yet the nonnegative solution is pathwise unique for the usual nonnegative parameters. Conversely, nonuniqueness can already occur without noise: the initial-value problem

dXt=2∣Xt∣ dt,X0=0,dX_t=2\sqrt{|X_t|}\,dt,\qquad X_0=0,

allows solutions that remain at zero for an arbitrary time before increasing.

Boundary behavior and the permitted state space are therefore part of a well-posed problem. A differential expression valid only inside a domain may not determine what happens at its boundary. Killing, absorption, reflection, or other boundary mechanisms can define different stochastic models with identical interior coefficients.

Canonical equations and explicit solutions

A basic SDE is Brownian motion with constant drift and volatility:

dXt=μ dt+σ dWt,Xt=X0+μt+σWt.dX_t=\mu\,dt+\sigma\,dW_t, \qquad X_t=X_0+\mu t+\sigma W_t.

For deterministic X0X_0, its distribution at time tt is normal with mean X0+μtX_0+\mu t and variance σ2t\sigma^2t. Its increments are stationary and independent. It models unconstrained diffusion with systematic transport, but its state can take any real value, which makes it unsuitable for quantities that must remain positive.

The Ornstein–Uhlenbeck process introduces mean reversion:

dXt=κ(θ−Xt) dt+σ dWt,κ>0.dX_t=\kappa(\theta-X_t)\,dt+\sigma\,dW_t, \qquad \kappa>0.

Multiplication by an integrating factor gives

Xt=θ+(X0−θ)e−κt+σ∫0te−κ(t−s) dWs.X_t=\theta+(X_0-\theta)e^{-\kappa t} +\sigma\int_0^t e^{-\kappa(t-s)}\,dW_s.

For deterministic X0X_0, this is Gaussian, with mean

θ+(X0−θ)e−κt\theta+(X_0-\theta)e^{-\kappa t}

and variance

σ22κ(1−e−2κt).\frac{\sigma^2}{2\kappa}(1-e^{-2\kappa t}).

Its invariant distribution is normal with mean θ\theta and variance σ2/(2κ)\sigma^2/(2\kappa). When initialized in that distribution, it is a stationary process, with covariance decaying exponentially in the time separation. The model originated in the study of Brownian velocity and remains a standard example of linear stochastic dynamics.

The geometric Brownian motion equation is

dXt=μXt dt+σXt dWt.dX_t=\mu X_t\,dt+\sigma X_t\,dW_t.

For X0>0X_0>0, Itô’s formula applied to the logarithm yields

Xt=X0exp⁡[(μ−12σ2)t+σWt].X_t=X_0\exp\left[ \left(\mu-\frac12\sigma^2\right)t+\sigma W_t \right].

The correction −σ2/2-\sigma^2/2 is essential. Although the expectation is X0eμtX_0e^{\mu t}, the almost-sure long-run rate of log⁡Xt\log X_t is μ−σ2/2\mu-\sigma^2/2. Expected growth and typical trajectory growth can therefore differ substantially. The process remains positive and has lognormal one-time distributions.

The square-root, or Cox–Ingersoll–Ross, diffusion uses

dXt=κ(θ−Xt) dt+σXt dWt.dX_t=\kappa(\theta-X_t)\,dt+\sigma\sqrt{X_t}\,dW_t.

For κ,θ,σ>0\kappa,\theta,\sigma>0, it has a gamma invariant distribution with shape 2κθ/σ22\kappa\theta/\sigma^2 and scale σ2/(2κ)\sigma^2/(2\kappa). Starting from a positive state, zero is unattainable when 2κθ≥σ22\kappa\theta\geq\sigma^2; when 2κθ<σ22\kappa\theta<\sigma^2, it can be reached. Its transition law is a scaled noncentral chi-squared law.

These models illustrate additive noise, multiplicative noise, mean reversion, and state-dependent boundary behavior. Explicit formulas are exceptional rather than typical, but they supply benchmarks for theoretical results, simulation algorithms, and statistical procedures.

Generators, transition laws, and partial differential equations

Under conditions ensuring a unique solution law, an SDE with deterministic coefficients defines a process with the Markov property: conditional on its present state, its future law does not depend on its earlier history. Time-dependent coefficients generally produce a time-inhomogeneous Markov process. In the time-homogeneous case, the transition operators

Ptf(x)=Ex[f(Xt)]P_tf(x)=\mathbb E_x[f(X_t)]

form a semigroup, satisfying Pt+s=PtPsP_{t+s}=P_tP_s. This identity is the operator form of the Chapman–Kolmogorov equations.

The infinitesimal generator describes the short-time action of this semigroup. For smooth ff,

Lf(x)=∑ibi(x)∂if(x)+12∑i,jaij(x)∂ijf(x).Lf(x)= \sum_i b_i(x)\partial_i f(x) +\frac12\sum_{i,j}a_{ij}(x)\partial_{ij}f(x).

Itô’s formula implies that

f(Xt)−f(X0)−∫0tLf(Xs) dsf(X_t)-f(X_0)-\int_0^t Lf(X_s)\,ds

is a local martingale, and a martingale when suitable integrability holds. This property can itself define the process through a martingale problem. That approach is particularly useful when coefficients are irregular or when convergence of approximate models is easier to establish through their generators than through their trajectories.

For a terminal payoff gg, let

u(t,x)=E[g(XT)∣Xt=x].u(t,x)=\mathbb E[g(X_T)\mid X_t=x].

When regularity permits a classical interpretation, uu solves the backward Kolmogorov equation

∂tu+Ltu=0,u(T,x)=g(x).\partial_tu+L_tu=0,\qquad u(T,x)=g(x).

The evolution of a probability density p(t,x)p(t,x) is described instead by the Fokker–Planck equation:

∂tp=−∑i∂i(bip)+12∑i,j∂ij(aijp).\partial_t p =-\sum_i\partial_i(b_ip) +\frac12\sum_{i,j}\partial_{ij}(a_{ij}p).

This is the forward equation, formally involving the adjoint of the generator. These equations connect SDEs with partial differential equations, including the heat equation as the special case of Brownian diffusion.

The Feynman–Kac formula extends the correspondence to equations containing a potential or discount term. For example, under suitable assumptions, the solution of

∂tu+Ltu−c(t,x)u=0,u(T,x)=g(x)\partial_tu+L_tu-c(t,x)u=0,\qquad u(T,x)=g(x)

has the representation

u(t,x)=Et,x[exp⁡(−∫tTc(s,Xs) ds)g(XT)].u(t,x)= \mathbb E_{t,x}\left[ \exp\left(-\int_t^T c(s,X_s)\,ds\right)g(X_T) \right].

Source terms can be incorporated through additional time integrals.

Smooth densities do not follow automatically from an SDE. Uniformly nondegenerate diffusion is a standard route to smoothing, while degenerate systems require more delicate conditions. Hörmander-type results show that noise acting in only some directions can still produce smooth densities when the drift and noise vector fields spread randomness through their commutators. The Langevin equation for position and velocity is a central example.

Long-time behavior, boundaries, and rare events

An invariant probability measure π\pi satisfies

∫Ptf(x) π(dx)=∫f(x) π(dx)\int P_tf(x)\,\pi(dx)=\int f(x)\,\pi(dx)

for suitable test functions. Starting the process with law π\pi makes its one-time distributions unchanged by time evolution. Existence, uniqueness, and convergence toward a stationary distribution are separate questions. A process can have several invariant measures, or none, and invariance alone does not ensure that every initial state approaches the same equilibrium.

A common route to long-time control is a Lyapunov function VV, typically increasing toward infinity, for which

LV(x)≤−cV(x)+CLV(x)\leq-cV(x)+C

with positive constants cc and CC. This inequality expresses an average restoring tendency outside a bounded region. Combined with appropriate accessibility and regularity properties, it can establish recurrence, existence of an invariant law, and quantitative convergence to equilibrium. Ergodic results then justify time-average limits such as

1T∫0Tf(Xt) dt⟶∫f dπ\frac1T\int_0^T f(X_t)\,dt \longrightarrow \int f\,d\pi

under the theorem’s assumptions.

For the overdamped gradient diffusion

dXt=−∇U(Xt) dt+2β−1 dWt,dX_t=-\nabla U(X_t)\,dt+\sqrt{2\beta^{-1}}\,dW_t,

a candidate equilibrium density is

p∞(x)=Z−1e−βU(x),p_\infty(x)=Z^{-1}e^{-\beta U(x)},

provided the normalizing constant ZZ is finite and the dynamics are well defined. The drift drives the state toward low-potential regions, while noise disperses it. With the usual conditions, this diffusion is reversible and satisfies detailed balance. Other diffusions possess stationary probability currents and are not reversible.

Boundary questions concern whether a process reaches or leaves the edge of its state space. In one dimension, scale functions and speed measures organize the classification of boundaries. An absorbing boundary retains the process after arrival; a killed process is sent to a cemetery state; a reflecting boundary pushes it back into the domain. Reflection can be represented schematically by

dXt=b(Xt) dt+σ(Xt) dWt+dKt,dX_t=b(X_t)\,dt+\sigma(X_t)\,dW_t+dK_t,

where the finite-variation process KK acts only at the boundary. In one-dimensional reflecting models, it is closely related to boundary local time.

Small noise introduces a further timescale. For

dXt=−∇U(Xt) dt+2ε dWt,dX_t=-\nabla U(X_t)\,dt+\sqrt{2\varepsilon}\,dW_t,

trajectories can remain near one local minimum of UU for long periods before crossing a potential barrier. Under appropriate nondegeneracy assumptions, mean escape times have leading exponential dependence eΔU/εe^{\Delta U/\varepsilon}, where ΔU\Delta U is the barrier height. Large deviation theory describes the exponentially small probabilities of atypical paths and supplies the mathematical basis for this metastability analysis. Such rare transitions may dominate system behavior even when short simulations show only local fluctuations.

Numerical approximation and simulation

Most SDEs do not have explicit solutions, so numerical approximation is essential. For a step size hh, the Euler–Maruyama method updates

Xn+1=Xn+b(tn,Xn)h+σ(tn,Xn)ΔWn,X_{n+1}=X_n+b(t_n,X_n)h +\sigma(t_n,X_n)\Delta W_n,

where independent Brownian increments satisfy

ΔWn∼N(0,hIm).\Delta W_n\sim N(0,hI_m).

The simulation must preserve the intended covariance between noise components. Replacing Brownian increments by deterministic perturbations or by random variables with incorrect scaling changes the model.

Two principal error criteria serve different purposes. Strong error compares an approximation with the exact solution driven by the same Brownian path, for example

(E∣XT−XN∣2)1/2.\left(\mathbb E|X_T-X_N|^2\right)^{1/2}.

Weak error compares expectations,

∣E[φ(XT)]−E[φ(XN)]∣,\left|\mathbb E[\varphi(X_T)]-\mathbb E[\varphi(X_N)]\right|,

for a suitable class of test functions. Under standard Lipschitz assumptions, Euler–Maruyama has strong order 1/21/2; with additional smoothness and growth assumptions, it has weak order 11. These rates concern discretization error, not statistical sampling error.

For a scalar autonomous equation, the Milstein method adds a correction:

Xn+1=Xn+b(Xn)h+σ(Xn)ΔWn+12σ(Xn)σ′(Xn)((ΔWn)2−h).X_{n+1}=X_n+b(X_n)h+\sigma(X_n)\Delta W_n +\frac12\sigma(X_n)\sigma'(X_n) \big((\Delta W_n)^2-h\big).

Under suitable regularity it has strong order 11. In multidimensional systems with noncommuting noise vector fields, analogous higher-order schemes require iterated stochastic integrals, including Lévy areas. Their simulation can be substantially more expensive than generating ordinary Gaussian increments.

Standard convergence claims can fail outside their assumptions. Explicit Euler approximations may have divergent moments for equations with superlinearly growing coefficients, even when the exact solution has finite moments. Tamed, truncated, and implicit methods modify the update to control this behavior. Numerical schemes also need to respect structural features: an unconstrained Euler step can make a nonnegative square-root diffusion negative, while a generic method may fail to preserve a manifold constraint or an equilibrium law. Numerical stability and preservation of the state space can therefore matter as much as formal order.

Simulation-based expectation estimates combine time discretization with Monte Carlo sampling. For independent paths with finite payoff variance, sampling error decreases proportionally to the inverse square root of the number of paths. Reducing the step size does not eliminate that error. Multilevel Monte Carlo couples simulations on coarse and fine grids so that most samples are computed cheaply, while fewer fine-grid samples estimate the smaller correction between levels.

In sensitivity calculations and inverse problems, the coupling of random increments is particularly important. Using common Brownian paths across parameter values can greatly reduce the variance of differences, whereas independently resimulating each parameter value can obscure small effects behind simulation noise.

Physical modeling, finance, control, and inference

In statistical physics, the underdamped Langevin equation separates position QtQ_t and momentum PtP_t:

dQt=M−1Pt dt,dQ_t=M^{-1}P_t\,dt,
dPt=−∇U(Qt) dt−γM−1Pt dt+2γkBT dWt.dP_t=-\nabla U(Q_t)\,dt-\gamma M^{-1}P_t\,dt +\sqrt{2\gamma k_{\mathrm B}T}\,dW_t.

Here MM is the mass matrix, UU the potential energy, γ\gamma a scalar friction coefficient, kBk_{\mathrm B} Boltzmann’s constant, and TT temperature. The noise amplitude and friction are linked by the fluctuation–dissipation relation. Under appropriate confinement, the invariant density is proportional to the exponential of minus total energy divided by kBTk_{\mathrm B}T. This model supports molecular simulation and coarse-grained descriptions of thermal motion.

In population biology and chemical kinetics, diffusion models often approximate discrete birth, death, and reaction events. For a reaction channel with state-change vector νr\nu_r and propensity ar(x)a_r(x), a formal diffusion approximation contributes

νrar(Xt) dt+νrar(Xt) dWt(r).\nu_r a_r(X_t)\,dt +\nu_r\sqrt{a_r(X_t)}\,dW_t^{(r)}.

The approximation is most defensible when many reaction events occur over the relevant timescale. Near extinction or with small molecule counts, the underlying jump process may be necessary because a continuous approximation can misrepresent discreteness and boundary behavior.

In mathematical finance, geometric Brownian motion underlies the Black–Scholes model introduced in 1973. Under its pricing assumptions, a suitable change of probability measure replaces a traded asset’s physical drift by the risk-free rate, adjusted for payouts when present. Discounted prices then have a martingale structure. The Girsanov theorem formalizes changes of drift under appropriate absolute-continuity and integrability conditions; it does not arbitrarily change the diffusion covariance. Stochastic volatility and jump models extend the framework beyond constant volatility and continuous price paths.

Controlled SDEs allow the drift or diffusion to depend on an intervention utu_t:

dXt=b(t,Xt,ut) dt+σ(t,Xt,ut) dWt.dX_t=b(t,X_t,u_t)\,dt+\sigma(t,X_t,u_t)\,dW_t.

Optimizing an expected running and terminal cost connects the model with mathematical optimization and dynamic programming. The resulting Hamilton–Jacobi–Bellman equation contains the same second-order diffusion operator as the generator, together with optimization over admissible controls. Partial observation adds a filtering problem: the state must be estimated from noisy measurements before or alongside control decisions.

Statistical inference typically observes the process at discrete times rather than continuously. Exact transition densities, when available, support maximum likelihood estimation. Otherwise, methods use approximate transitions, estimating equations, simulation, or Bayesian inference. Drift and diffusion parameters carry different information: high-frequency observations over a fixed interval can reveal quadratic variation accurately, but generally do not provide unlimited information about drift. Long-span observation is often needed for consistent estimation of drift parameters. Measurement noise, hidden variables, and model misspecification further distinguish inference from merely fitting a numerical trajectory.

Jump noise, infinite-dimensional equations, and geometric extensions

Brownian noise describes continuous fluctuations, but many systems undergo abrupt changes. An SDE with jumps can be written

dXt=b(Xt−) dt+σ(Xt−) dWt+∫Eγ(Xt−,z) N~(dt,dz),dX_t=b(X_{t-})\,dt+\sigma(X_{t-})\,dW_t +\int_E \gamma(X_{t-},z)\,\widetilde N(dt,dz),

when the compensated integral is well defined. Here Xt−X_{t-} denotes the state just before time tt, NN is a Poisson random measure of jumps with marks zz, and N~\widetilde N subtracts its intensity measure. More general formulations separate compensated small jumps from uncompensated large jumps. Solutions typically have paths that are right-continuous with left limits.

Jump equations have a nonlocal calculus. Itô’s formula includes the finite difference f(Xt)−f(Xt−)f(X_t)-f(X_{t-}) at each jump rather than only a local second-derivative correction. Their generators therefore contain integral terms, and the corresponding distributional equations are often integro-differential equations. Lévy processes provide a broad class of stationary independent-increment drivers containing Brownian motion and Poisson processes as special cases.

When the state is a spatial field, the model becomes a stochastic partial differential equation. A symbolic example is

du=(Δu+F(u)) dt+G(u) dWt.du=(\Delta u+F(u))\,dt+G(u)\,dW_t.

The state may live in a Hilbert space or Banach space, and WW may be an infinite-dimensional noise. Spatial dimension and noise regularity become decisive: a solution may exist only as a generalized function, making nonlinear operations such as powers ill-defined without additional construction. Mild solutions combine an evolution semigroup with a stochastic convolution; variational solutions use appropriate function spaces and duality.

SDEs can also evolve on a manifold. In Stratonovich form,

dXt=V0(Xt) dt+∑j=1mVj(Xt)∘dWt,dX_t=V_0(X_t)\,dt+\sum_{j=1}^m V_j(X_t)\circ dW_t,

tangent vector fields VjV_j give an intrinsically geometric description. Ordinary coordinate transformations preserve this form. Brownian motion on a Riemannian manifold has generator one-half of the Laplace–Beltrami operator. Local Itô coordinates generally introduce additional drift terms reflecting the geometry, so merely projecting Euclidean noise into a coordinate chart is not sufficient.

Finally, rough path theory studies differential equations driven by irregular signals by augmenting a path with iterated-integral information. This makes it possible to define a continuous solution map for appropriately enhanced drivers. Brownian motion admits such enhancements, but different second-order enhancements correspond to different integration conventions. Ordinary uniform convergence of driving paths alone does not capture this information, explaining why apparently similar smooth approximations can produce different limiting equations. Fractional Brownian drivers and path-dependent equations extend the framework further, often beyond the semimartingale or finite-dimensional Markov setting.