Stochastic processes and noisy evolution
Move from one random variable to correlated histories, Markov dynamics, Brownian motion, and an honest introduction to Itô calculus.
On this page
The question for today
What you’ll understand
- Distinguish sample paths, time marginals, and dependence across time.
- Interpret transition matrices and the Markov property using conditional information.
- Explain the extra Itô term and connect diffusion to a density evolution equation.
A random variable describes one uncertain quantity. A stochastic process describes a family of uncertain quantities indexed by time, including how they depend on one another. Knowing every time's histogram still does not determine the joint history. This matters for queueing, simulation, generative diffusion, and noisy optimization. We begin with finite Markov chains, then move to Brownian motion, where continuous sample paths are rough enough that ordinary calculus must be modified.
A history is more than a sequence of unrelated histograms
A process X_t assigns a random variable to each time on a common probability space. Fixing an outcome gives a sample path; fixing time gives a marginal distribution. Two processes can have the same marginal distribution at every time but different dependence. For example, repeatedly reusing one fair coin and tossing a new independent fair coin at every integer time both give a fair marginal at each step. Their paths and conditional predictions are very different.
A filtration records information available up to each time. The Markov property says that, given the current state, the conditional future does not need additional information from the past. It does not mean successive states are independent. For a finite time-homogeneous chain, a transition matrix P has nonnegative entries and rows summing to one. With row-vector distributions, the next distribution is πP. A stationary distribution satisfies πP=π, but stationarity alone does not prove that every starting distribution converges to it.
Brownian motion is continuous without ordinary smoothness
Standard Brownian motion begins at zero, has independent stationary Gaussian increments, and has continuous paths. Over an interval of length Δt its increment has variance Δt, so its typical size scales as the square root of elapsed time. This differs from a smooth trajectory's increment, which scales linearly with elapsed time. Brownian paths are almost surely nowhere differentiable. Drawing them with straight segments is an approximation for display, not evidence that a finite velocity exists between infinitely close times.
The accumulated squared increments over increasingly fine partitions converge to elapsed time in the appropriate probabilistic sense. This quadratic variation makes a second-order Taylor term survive in stochastic calculus. In an Itô integral, the integrand is adapted and evaluated using information available before each increment. Itô and Stratonovich conventions are different limiting rules; converting between them changes drift terms. The convention must be stated whenever multiplicative noise depends on the current state.
From noisy trajectories to evolving densities
An Itô stochastic differential equation combines deterministic drift with Brownian forcing. For globally Lipschitz drift and diffusion coefficients with suitable growth control, standard theorems give a unique nonexplosive strong solution from appropriate initial data. Rougher coefficients need different conditions. Itô's formula adds one half of the squared diffusion coefficient times the second derivative of a test function. Taking expectations leads, under suitable regularity and boundary assumptions, to the Fokker–Planck equation for the density.
This bridge connects simulation of individual paths with a deterministic PDE for probability mass. It underlies diffusion models, but a trained generative system also needs a specified forward process, learned score or reverse dynamics, and discretization analysis. Similarly, treating minibatch gradient noise as Brownian forcing is an approximation, not an identity: its covariance can depend on parameters, batches may be correlated, and finite step sizes matter. Stochastic models should expose these assumptions before their predictions are trusted.
Work it through
Mean reversion with persistent uncertainty
For the Ornstein–Uhlenbeck equation dX_t=−θX_t dt+σ dW_t with θ>0, constant σ, and deterministic X_0=x_0, find the mean and long-time variance.
Multiply by the deterministic integrating factor e^(θt). The product rule gives , since a deterministic smooth factor adds no Brownian quadratic cross term.
Integrate and rearrange: . The Itô integral has mean zero, so the mean is x_0e^(−θt).
By the Itô isometry, the variance is .
As t grows, the mean approaches zero but the variance approaches σ²/(2θ). Individual paths keep fluctuating. Mean reversion does not mean that every path converges to the mean value.
The drift forgets the initial mean while the noise sustains a nonzero stationary variance. A mean curve alone hides this continuing uncertainty.
The living notebook
Explore the model
Interactive lab · probability
Follow spread as well as the center
Change success probability p and integer trial count n in an exact binomial distribution; inspect its mean np and variance np(1−p). These are one-time marginals of independent Bernoulli sums, not a temporal process. The lab does not simulate Brownian paths or the Ornstein–Uhlenbeck equation; use the derivation for that process.
- Mean · np
- 5
- Variance · np(1−p)
- 2.5
- Total probability
- 1
These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA marginal mean and variance describe spread at one time; they do not specify transitions or dependence across time.
Pause & reason
Check your understanding
Your turn
Try it yourself
A two-state chain has transition rows (0.8,0.2) and (0.3,0.7). Find its stationary distribution and explain why this does not make successive states independent.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Write π=(a,1−a) and solve πP=π. Then compare conditional next-step probabilities.
Compare with the solution
The first component equation is a=0.8a+0.3(1−a), giving a=0.6. Thus π=(0.6,0.4). Even in stationarity, the chance of the next state being state one is 0.8 when the present state is one and 0.3 when it is two. Dependence remains. The positive transition entries also make this finite chain irreducible and aperiodic, so its distributions converge to π from any starting distribution.
Keep the idea
Take it with you
- Time marginals do not determine temporal dependence or complete sample-path behavior.
- Markov dependence uses the present state as sufficient information, not independence across time.
- Brownian roughness changes calculus, and stochastic approximations require explicit conventions and assumptions.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.