A moving-average process of order one has the formwith centered white noise of finite positive variance . Each disturbance enters the current observation with weight and the next observation with weight , then leaves the filter. It is a weakly stationary process for every real : the mean is and the autocovariance of an MA(1) process depends only on lag. Strong white noise additionally makes it a strictly stationary process. No restriction is needed for stationarity.
For a worked observation calculation, take , , and consecutive noise values , , . Then and ; the same disturbance appears in both. If , the variance is , the lag-one autocovariance is , and the lag-one autocorrelation is . All higher-lag autocorrelations vanish, as shown in autocorrelation.
An MA(1) is useful for brief dependence caused by overlapping disturbances or measurements. Its name refers to a weighted moving sum of noise; its weights need not be positive or sum to one, and it differs from the data smoother in seasonal extraction by a centred moving average. Under strong white noise, observations more than one interval apart depend on disjoint independent noise families and are independent. Under weak white noise, the same cutoff establishes only uncorrelated random variables.
Invertibility of a moving-average model is a separate question: can the specified driving noise be recovered by a stable linear filter of present and past observations? For an MA(1) the answer, with the absolutely summable filter convention, is exactly :Thus gives a stationary MA(1) that is not invertible in this sense. At it is still stationary, but the inverse coefficients are not absolutely summable. The case is simply shifted white noise. See Bartlett, lecture 5: MA(1) and stable invertibility.
For the MA(1) , centered white noise givesOnly products of noise values with matching time indices have nonzero expectation. At lag zero there are two squared weights, and ; at lag one there is one shared noise term with weight product ; at higher lags there are none. The calculation needs zero covariance between distinct noise values, not independence. This tridiagonal finite covariance structure makes the finite-sample innovations of an MA(1) process particularly simple.
The lag-one autocorrelation can never exceed in magnitude, since . For , replacing by leaves the entire ACF unchanged. For example and both give ; rescaling the latter noise variance by also matches every autocovariance. Moving-average root reflection explains this ambiguity and why a stable invertibility convention helps identify a representation. Equality of second-order laws need not imply equality of all joint probability distributions unless the processes are Gaussian processes. See Bartlett, lecture 6: equivalent representations and covariance of ARMA processes.
Articles by others on the same topic
There are currently no matching articles.