MA(q) Process
An MA() process expresses each as a fixed weighted sum of the present white-noise shock and the previous shocks. The name moving average refers to the construction: a length- window slides one step forward at every , applying the same weights to whichever shocks fall inside it. Writing this out,
or in backshift form with .An MA process is automatically stationary: the mean is zero, and the autocovariance comes from the overlap of two windows of fixed length, which depends only on the lag. The autocovariance is non-zero only when the windows overlap, so it cuts off exactly at lag :
with . The MA(1) case specializes to , , and the lag-1 autocorrelation , whose absolute value is bounded by for every choice of .What does need to be checked is invertibility: the condition that the MA polynomial can be inverted as a power series, expressing in terms of past observations. Two MA processes whose roots of are reciprocals of each other (e.g., and for MA(1)) produce identical second-order distributions, so the convention is to keep only the representative whose roots all lie outside the unit circle. See 2.5.5 Causality and Invertibility.
Intuition
The sliding-window picture explains everything. Two values and can only be correlated when their length- windows over the noise stream overlap; once exceeds the windows are disjoint and the correlation vanishes exactly. This finite memory is the structural opposite of AR processes, whose memory decays geometrically but never reaches zero.
The bound on MA(1) follows from optimizing over : the maximum is at . So an observed sample lag-1 correlation noticeably above is by itself enough to rule out an MA(1).
Properties
(Always Stationary) Every finite MA() is weakly stationary regardless of the coefficients.
The mean is zero because each shock has zero mean, and the autocovariance depends only on the lag because the same fixed window is averaged at every . No parameter restriction is needed, in contrast to AR processes that require the unit-circle root condition for stationarity to even hold.
(ACF Cuts Off at Lag ) The autocorrelation drops to exactly zero past lag .
This is the diagnostic signature: a sample ACF whose entries fall inside the confidence band for every lag past identifies an MA() directly. The dual signature, a PACF that tails off geometrically, completes the identification.
(Invertibility) Roots of outside the unit circle pick a unique representative from each equivalence class.
Two MA processes with reciprocal-root parametrizations have identical autocovariance and (under Gaussianity) identical distributions. The convention is to choose the version with all MA roots outside the unit circle, which is the only one for which converges as an AR() recursion in past observations: the form needed for forecasting.
(Spectral Density) The MA spectrum is a polynomial in .
Applying the linear-filter identity to gives . Specialized to MA(1), the magnitude expands to : low-pass when (power concentrated near , matching the smooth realizations), high-pass when (power near , matching the alternating realizations). Unlike AR spectra, MA spectra cannot have peaks; they can only have notches at the MA roots.
Examples
MA(1) at vs.
How do the lag-1 correlations and typical realizations compare?
Solution for (almost the maximum value of ), and the mirror for . Realizations at look like white noise lightly smoothed by adjacent-value averaging; at they look saw-toothed, with each value tending to the opposite side of zero from its predecessor. Both have for , so neither has any longer-range structure.
The lag-1 correlation is
Non-invertible MA(1) and its invertible twin
Show that with has the same autocovariance as with .
Solution : and . For : and . The MA root for is (inside the unit circle, non-invertible); for it is (outside, invertible). The flip rule: replace each inside-the-circle root by its reciprocal and rescale the noise variance by . Software returns the parametrization.
For
MA(2) autocovariance
Compute for with .
Solution with : and for since the windows no longer overlap. Dividing by , the ACF is : a sharp cutoff at lag 3, the MA(2) signature.
From