Module 1 — Processes, Dependence, and Stationarity
Module 1 — Processes, Dependence, and Stationarity
Core question
We observe one sequence . What assumptions let that one path reveal a population mean, variance, and dependence structure?
Learning outcomes
You will be able to:
- distinguish a stochastic process, a random variable, and one sample path;
- construct the mean vector and Toeplitz covariance matrix of a stationary finite block;
- calculate and interpret autocovariance and autocorrelation;
- separate strict stationarity, weak stationarity, and ergodicity;
- distinguish white noise from independence and Gaussianity;
- derive the dependence and shock persistence of a stationary AR(1);
- state exactly what the Wold representation does and does not promise.
1. Process versus path
A stochastic process is a collection of random variables indexed by time:
The capital letters describe the population mechanism. The data are one realised path. Observing 120 months is not the same as observing 120 independent copies: adjacent values may share shocks.
| Object | Example | Question |
|---|---|---|
| random variable | next month's demand | what values and probabilities are possible? |
| process | over all months | how does the joint distribution change with time? |
| sample path | 102, 108, 105, ... | what can this one history reveal? |
2. Finite blocks expose the matrix structure
For any selected times , define
Its first two moments are
For consecutive observations from a weakly stationary process,
is symmetric Toeplitz: each diagonal is constant. It must also be positive semidefinite because
for every . The bounds are necessary but not sufficient; all lags must fit together into valid covariance matrices.
Construct and verify a stationary covariance block
Change to : alternating covariances appear, but validity remains. Move it to : the smallest eigenvalue and condition number reveal near-collinearity even before estimation.
3. Dependence is indexed by lag
For a weakly stationary process,
retains the unit squared; is unit-free and lies between and . Neither measures nonlinear dependence completely.
Worked sample calculation
Take one short path:
The deviations are . Using divisor ,
so . The sample is far too short for a strong conclusion; the exercise teaches what each ACF bar aggregates.
4. Three kinds of stability
| Concept | Requirement | Why it matters |
|---|---|---|
| strict stationarity | every finite joint distribution is unchanged by a time shift | complete distributional stability |
| weak stationarity | constant finite mean/variance; covariance depends only on lag | ARMA, linear prediction, spectra |
| ergodicity | time averages converge to population quantities | learning from one long path |
Strict stationarity implies weak stationarity only when second moments exist. For a Gaussian process, weak stationarity is enough to determine shift-invariant finite-dimensional distributions. Stationarity alone does not guarantee that one path explores the population adequately; that is the role of ergodic conditions.
Why persistence reduces effective information
For a stationary mean-zero series,
Positive autocovariances make the sample mean noisier than the iid formula . One hundred highly persistent months need not contain one hundred months' worth of independent information.
5. White noise is not one assumption
| Label | Required claim |
|---|---|
| white noise | zero mean, constant variance, zero autocovariance at non-zero lags |
| independent white noise | white noise observations are also independent |
| Gaussian white noise | independent observations follow |
Uncorrelated does not imply independent outside special families such as jointly Gaussian variables. A squared-noise series can be predictable in variance even when the level has zero autocorrelation.
6. The AR(1) as a complete dependence example
Let
If , repeated substitution gives the causal representation
Therefore
With and :
- long-run variance is ;
- lag-3 correlation is ;
- a unit shock has about half its effect after periods.
If , signs alternate; if , shocks do not decay and the process becomes a random walk.
7. Linear processes and Wold's result
A causal linear process has the form
with coefficients that decay sufficiently for the sum to exist. Its autocovariance is
Wold's decomposition says that every covariance-stationary, purely non-deterministic process can be represented as an infinite moving average of uncorrelated innovations. It does not say that a short finite ARMA model is true, that innovations are independent, or that the coefficients are easy to estimate.
8. Diagnostic distinctions
| Observation | Supported interpretation | Unsupported leap |
|---|---|---|
| ACF decays slowly | strong linear persistence or unremoved low-frequency structure | “the process has a unit root” |
| residual ACF is near zero | little remaining linear serial correlation at inspected lags | “residuals are iid Gaussian” |
| sample mean stabilises | evidence consistent with mean ergodicity | proof of stationarity |
| variance changes after an intervention | possible break or volatility shift | automatic need for first differencing |
Practice
- For with innovation variance 3, calculate and .
- Construct two dependent variables with zero correlation; explain why an ACF cannot detect their dependence.
- For the six-point path above, recompute using divisor .
- Explain why stationarity and ergodicity answer different questions.
- Construct for an AR(1) with and innovation variance , then find as a quadratic form.
Answers
- Variance ; correlations are .
- If is symmetric around zero, and are dependent but can have zero covariance because .
- .
- Stationarity concerns invariance across calendar shifts; ergodicity concerns whether one long path recovers population quantities.
- , so and .
Takeaway
Time-series inference begins by stating what is random, what is observed once, and which form of stability connects one to the other. Continue to ARMA and ARIMA to encode that stable dependence with lag polynomials.