Stationarity
A stochastic process is stationary when its probabilistic structure does not depend on the absolute placement of time. Two sharpenings of this idea are used in practice, differing in how much of the structure is required to be time-invariant.
Strict stationarity. The process is strictly stationary when the joint distribution of any finite collection of values is invariant under arbitrary time shifts: for every , every , and every choice of times ,
This is the strong condition: not just the mean, not just the covariance, but the entire joint distribution must look the same after shifting. Strict stationarity implies that every individual has the same distribution, every pair has the same joint distribution as any other pair separated by the same lag, and so on for all finite-dimensional marginals.Weak stationarity. The process is weakly stationary (also second-order stationary or wide-sense stationary) when only the first two moments are time-invariant:
The mean is a constant rather than a function of , and the autocovariance depends only on the lag rather than on the absolute times. Higher moments and the joint distribution itself are unconstrained. This is the working definition used throughout time-series analysis, because it is the minimal assumption needed for the autocorrelation function to be well-defined and the sample autocovariance to estimate it consistently.Strict implies weak (when second moments exist), but weak does not imply strict in general. The exception is the Gaussian case: a Gaussian process is fully determined by its mean and covariance, so weak stationarity forces the entire joint distribution to be shift-invariant, and the two notions coincide.
"Stationary" Without Qualifier weakly stationary. That is the convention in Shumway-Stoffer, in
statsmodels, and in nearly every applied time-series source. Strict stationarity is invoked when the argument needs joint distributions (ergodic theorems, mixing conditions, non-Gaussian limit theorems); weak stationarity is invoked everywhere else.In practice, “stationary” almost always means
Intuition
Stationarity is the assumption that lets a single observed path of a stochastic process tell us about the underlying distribution. Without some form of time invariance, every time point would have its own mean, variance, and dependence structure, and a single realization would give exactly one data point per time index, not enough to estimate anything. Stationarity says “the rules of the process are the same at every ,” so observations at many different times can be pooled to estimate properties of those rules. This is the time-series analogue of the i.i.d. assumption in classical statistics: not that observations are independent, but that they come from the same data-generating mechanism applied at every step.
The two-tier weak/strict split exists because most of what time-series analysis actually does only needs the first two moments. Estimating the autocorrelation, fitting an ARMA, computing a periodogram, running the Kalman filter: all of these rely on the mean and covariance, not on higher moments. So the weaker assumption suffices, and weakening it is a real win because more processes satisfy weak stationarity than strict stationarity. The strict version becomes essential only when the analysis hinges on the joint distribution itself, for example when proving central limit theorems for non-linear functionals of the series, or when reasoning about ergodicity beyond the mean.
Properties
(Strict Implies Weak) If is strictly stationary and has finite second moments, it is weakly stationary.
If the joint distribution of depends only on , then so does any function of it, including . The mean is the same for every because all marginal distributions agree. The converse fails because matching just the first two moments leaves higher moments free to vary with time. The implication does require finite second moments: a strictly stationary process with infinite variance (e.g., one driven by Cauchy innovations) is strictly but not weakly stationary, because the autocovariance is not even defined.
(Gaussian Equivalence) A Gaussian process is strictly stationary if and only if it is weakly stationary.
A Gaussian process is determined entirely by its mean function and covariance function, so once those are time-invariant, the entire joint distribution is time-invariant too. This is the only large family of processes for which the two notions coincide universally. It is why much of Gaussian-process theory and Kalman-filter theory does not need to distinguish between the two: for Gaussian models, “stationary” is unambiguous.
(Mean is Constant) Under weak stationarity, for every .
This is half of the definition. The practical consequence is that the sample mean is an unbiased estimator of , regardless of the dependence structure of the series. The variance of does depend on the dependence (through the autocovariances), but the mean is unbiased even under serial correlation.
(Autocovariance Depends Only on Lag) Under weak stationarity, .
The autocovariance is a function of one variable (the lag) rather than two (the absolute times). This is what makes the function plottable and estimable: a single sample autocovariance is computed from all pairs of observations separated by lag , pooling information across the time axis. Without lag-only dependence, each would be its own quantity to estimate, and there would be no way to estimate it from one realization.
(Sample Estimators Are Consistent Under Ergodicity) When the process is stationary and ergodic, sample moments converge to population moments.
Ergodicity is the additional condition that allows time averages to substitute for ensemble averages. Under stationarity alone, is unbiased but might not converge: the realization could persist forever in some atypical region. Under ergodicity, as , and similarly . A standard sufficient condition for ergodicity in the mean is that the autocovariance decays to zero, as , which is satisfied by all causal ARMA processes.
(Differencing as a Stationarity Tool) Many non-stationary processes become stationary after differencing.
The random walk is the canonical example: is non-stationary (variance grows with ), but the first difference is white noise, which is strictly stationary. More generally, if with a polynomial of degree in and stationary, then is stationary. This is the algebraic basis for the integration order in ARIMA(p, d, q) models: non-stationary series are differenced until a stationary residual remains, then ARMA structure is fit to that residual.
(Increment Stationarity is Weaker Than Stationarity Itself) A process can have stationary increments without being stationary.
Brownian motion is the canonical example: depends only on , so the increments are strictly stationary, yet is not constant in , so itself is not stationary. The same dichotomy holds for the random walk. A useful operational test: if differencing the process makes it stationary, the original was integrated of order one, with stationary increments but non-stationary levels.
Examples
White noise is strictly stationary
Let be i.i.d. with mean and variance . Verify both weak and strict stationarity.
The mean is for every , so it is constant. The autocovariance is if and otherwise, which depends on alone. So is weakly stationary. For strict stationarity, the joint distribution of any is a product of marginals (by independence), and each marginal is the same regardless of , so the joint distribution is shift-invariant. White noise is therefore both strictly and weakly stationary; the strongest form of stationarity is automatic when the variables are i.i.d.
Random walk is not stationary
Let with i.i.d. mean zero. Show that is not weakly stationary.
The mean function is constant (so the first condition holds), but the autocovariance is , which depends on rather than only on . Specifically but , even though both pairs have lag . The second condition of weak stationarity fails, so the random walk is not stationary. The differenced process is white noise, however, so the random walk is integrated of order one: non-stationary in levels, stationary in increments.
Linear trend is not stationary
Let with and stationary. Show that is not stationary, but that one differencing fixes it.
The mean is , which is linear in rather than constant. So the first condition of weak stationarity fails immediately. Differencing once: . The constant has constant mean , and is stationary because differencing is a fixed linear filter on a stationary input. So has constant mean and lag-only autocovariance, which is the definition of weakly stationary. This is the deterministic-trend version of the more general result that polynomial trends of degree are removed by differences.
Weakly stationary but not strictly stationary
Construct a process that satisfies the weak conditions but not the strict ones.
Let for even and for odd , all independent. Both distributions have mean and variance , so and if and otherwise, which is weakly stationary. But the marginal distribution of is Laplace while the marginal of is Gaussian, so the joint distribution of differs from that of , and the process is not strictly stationary. This kind of example shows that weak stationarity is a genuine relaxation: it really does allow the higher-moment structure to vary in time.
See Also
- 4.4 Random Walks: canonical non-stationary example; differencing recovers stationarity.
- 4.6 Brownian Motion: non-stationary process with strictly stationary increments.
- 2.1. Time Series: applied treatment of stationarity inside time-series analysis.
- 2.2.2 Autocovariance Function: the lag-only function whose existence requires weak stationarity.
- 2.5.6 ARIMA(p,d,q) Process: differencing integer order to bring a non-stationary series to stationarity.
- 3.10 Gaussian Processes: stationarity for GPs corresponds to using a stationary kernel like RBF or Matérn.