Stochastic Processes: Foundations

a stochastic process

A single random variable is a one-shot gamble: you flip once and read off a number. But the world rarely holds still — a stock price wanders day after day, a queue grows and shrinks, a molecule jitters through water. A stochastic process is the mathematical object for randomness that unfolds over time: not one random number, but a whole sequence (or continuum) of them, watched as the clock runs.

Precisely, a stochastic process is a collection of random variables { X_t } indexed by a parameter t, all defined on the same underlying probability space. You should picture it two ways at once. Fix the time t and X_t is an ordinary random variable — a snapshot, with its own distribution. Fix instead a single outcome of the underlying randomness (one run of the universe) and the whole family { X_t } becomes one definite function of t, a single trajectory you can plot. The process is the bundle of all these possible trajectories, each weighted by how likely it is.

This double view is the heart of the subject. Questions about a process come in two flavours: marginal questions about one instant (what is the distribution of X_10?) and path questions about the whole journey (will the price ever hit 200? how long until the queue empties?). The grammar in this field — index set, state space, sample path, increments, stationarity, the Markov property — is just the shared vocabulary every particular process (random walk, Poisson process, Brownian motion, Markov chain) is then built from.

Toss a fair coin once per second forever; let X_t be the number of heads so far after t tosses. This is a stochastic process. At a fixed time, say t = 100, X_100 is a Binomial(100, 1/2) random variable. Along a single run, X_t is one staircase that only steps up, by 1 on a head and 0 on a tail. The process is the collection of all such possible staircases, weighted by probability.

One process, two readings: a snapshot at fixed t (a random variable) and a whole staircase along one run (a sample path).

Do not collapse the two views: the distribution of X_t at each instant does NOT by itself tell you about the path — whether the trajectory is smooth or jumpy, whether two times are correlated — that lives in the joint behaviour across times, not in any single marginal.

Also called
random processrandom function隨機過程隨機程序