Stochastic Processes
The language of uncertain signals: stochastic processes, their mean and autocovariance, weak vs strong stationarity, the Toeplitz condition that makes a covariance valid, white noise, and Wold's decomposition — everything the exam's first problem is built on.
01 · Definitions
Processes and their first two moments
A stochastic process is an infinite sequence of random variables — one signal per outcome of a single random experiment. We never know it exactly, only its statistics, and two of them carry almost everything we need.
Formally a discrete-time process is , where is the outcome of a random experiment and the time index. Fix the outcome and you get one ordinary signal — a realization. Fix the time and you get a random variable. A full probabilistic description would assign a joint distribution to every finite collection of samples — infinitely many functions. We almost always work instead with the first- and second-order characteristics:
The mean is the value the signal fluctuates around; the autocovariance measures how the process at two different times moves together. Setting recovers the variance . Two normalised cousins appear constantly: the autocorrelation (equal to when the mean is zero), and the Pearson correlation coefficient , which lives in by Cauchy–Schwarz.
This is the exam's first problem
On every recent structured MIDA1 paper, Problem 1 is “Mean, covariance and spectrum”: you are handed a system that filters white noise and asked — is the output stationary? compute , , a lag-covariance , and the spectrum at one frequency. It is pure, boxed-answer computation. Graders want the number and a one-line justification of stationarity. Master the mechanics in this chapter and the spectrum piece in Chapter 4, and you own eight points.
02 · Core
Stationarity: weak vs strong
Almost everything simplifies if the process’s statistics do not drift over time. A process is strongly stationary if all its joint distributions are invariant to a time shift — a complete but unusable description. The workable version keeps only the first two moments:
Weak (wide-sense) stationarity
A process is weakly stationary if (i) the mean is constant, ; (ii) the variance is constant; and (iii) the autocovariance depends only on the lag , so we write . A Gaussian weakly-stationary process is automatically strongly stationary.
A weakly stationary process is completely characterised by a number (its mean) and a function of one variable (its covariance ) — two processes with the same pair are “equivalent”. And if the process is ergodic, its statistics can be recovered from a single realization: the sample average converges to the expected value, . That is what lets us estimate anything from one recorded signal.
The setup
Let with and , and let with independent of . This is the shape of every Problem-1 process. Take , , , .
Stationarity
is an AR(1) with pole inside the unit circle, hence a stable filter driven by white noise — stationary. is the sum of two stationary, independent processes, so is stationary. Always argue it this way: stable-filter-of-white-noise + independent-stationary = stationary.
Mean
Take expectations of the state equation: . Then .
Variance of x
Square the AR(1) equation and use : , so . (This is the Yule–Walker variance of Chapter 3.)
Lag-1 covariance of y
For the independent white drops out, so . The measurement noise only ever touches .
Now do one yourself — the July 2026 Problem 1, with an AR(1) that has a non-zero-mean noise (watch the mean feed while the variance feeds ):
03 · Property
What makes a valid covariance
The autocovariance of a stationary process is not an arbitrary function. Three properties hold, and the third is deeper than it looks:
Non-negative variance
— the covariance at lag zero is the variance.
Bounded & even
(Cauchy–Schwarz — a signal is most correlated with itself) and (an even function).
Toeplitz PSD
The Toeplitz matrix built from must be positive semi-definite for every size .
A plausible-looking γ(τ) can still be illegal
The first two properties are necessary but not sufficient. An even, bounded sequence is a genuine covariance function iff its Toeplitz matrix is positive semi-definite for all . Exam traps ask “can this be the covariance of a stationary process?” — a sequence can pass the eyeball test and still fail because a (or larger) Toeplitz minor goes negative.
Proof Why the Toeplitz matrix must be PSD
Stack centred samples into a vector . Its covariance matrix is , whose entry is — exactly the Toeplitz matrix of the covariance sequence. Any covariance matrix is positive semi-definite (for any vector , — it is the variance of a scalar random variable). Since this must hold for every window length , the whole family of Toeplitz matrices is PSD. That is why “is this a valid ?” reduces to a definiteness check.
04 · Building block
White noise: the atom
White noise is the simplest stationary process and the building block of every model to come. It is a sequence of independent, identically distributed variables:
Because for every , knowing the past tells you nothing about the future: white noise is completely unpredictable. If the distribution is Gaussian we write . This is the same white noise as Chapter 1’s optimal residual — the two ideas are the same object seen from two directions.
05 · Structure
Wold’s decomposition
How can an arbitrary stationary process be built from white noise? Wold’s theorem says any stationary process splits into two uncorrelated pieces:
where is purely deterministic — knowing its past predicts its entire future exactly (e.g. a constant, an alternating sequence, or a sinusoid ) — and is purely non-deterministic: everything you cannot pin down from the past. The crucial fact is that the non-deterministic part is a convolution of white noise,
i.e. the output of a dynamical filter driven by white noise. That is precisely the object the next chapter parameterises as MA, AR and ARMA models. Because a non-zero mean is just a purely deterministic constant component (predicted exactly), we lose nothing by developing the theory for zero-mean processes, where autocovariance and autocorrelation coincide.
Why Wold matters
Wold turns “model a stationary signal” into “find the filter that colours white noise into it”. Prediction (Chapter 5) and identification (Chapters 6–7) are both about recovering that filter — and the residual left after the best filter is, once more, white noise.
A zero-mean stationary process has γ(0)=2, γ(1)=3. Can this be a valid autocovariance function?
Load-bearing ideas
- A stochastic process is summarised by its mean and autocovariance ; the Pearson coefficient normalises correlation into .
- Weak stationarity = constant mean and variance + covariance depending only on the lag . Ergodicity lets you estimate the statistics from one realization.
- is even, bounded by , and — the deep condition — has a positive semi-definite Toeplitz matrix; that is what makes a candidate a legal covariance.
- White noise has for and is completely unpredictable.
- Wold: every stationary process = a purely deterministic part + white noise pushed through a filter . Modelling and prediction are about recovering that filter.
Exam radar. Re-derive the StepThrough cold before the exam: given , , produce stationarity + + + . Keep the validity trap in mind, and remember independent measurement noise touches only .