For a weakly stationary process with mean and nonzero variance, put and . The function is its autocorrelation function. For observations , one common sample autocorrelation function is
A correlogram plots these estimates against lag; the population analogue plots .
The lag- partial autocorrelation function measures the correlation between and after removing their linear projections on the intervening observations. Its sample counterpart can be calculated by the Yule-Walker equations: solve
and take , assuming the matrix is nonsingular. This defines a standard sample partial autocorrelation function.
For a minimal causal autoregressive model of order , the autocorrelation typically decays geometrically, possibly with damped oscillations, whereas the partial autocorrelation function is zero beyond lag : after those preceding values have been projected out, the innovation is orthogonal to older values. For a moving-average model of order , nonoverlapping sets of driving white noise give for ; its partial autocorrelation function generally tails off when the representation is invertible. Thus an ACF cutoff suggests an MA order; a PACF cutoff suggests an AR order. An ARMA model generally has neither cutoff. These are population properties; sample noise makes cutoffs approximate, so fitted residuals and uncertainty should also be inspected. Under independent white noise, fixed-lag sample correlations have approximate standard error , giving a rough diagnostic band rather than a universal simultaneous test.
For a discrete-time weakly stationary process, the spectral density of a stationary process, when it exists, is a nonnegative function satisfying
If , then
A general second-order stationary process has a spectral measure of a stationary time series, which need not have a spectral density: a centered random constant has an atom at zero. Thus the spectral density calculation below assumes that exists; the corresponding measure identity holds without that extra assumption.
Absolute summability of the filter coefficients gives mean-square convergence because
Consequently the bilateral filtered process is well defined, with constant mean . Its covariance is
The sum is absolutely convergent, since and . It depends only on lag, proving weak stationarity of .
Insert the spectral representation and interchange summation and integration using absolute summability and the finite total spectral mass. For real coefficients,
Therefore the spectral density transformation under a linear filter is
For a bilateral sequence, is guaranteed to converge on the unit circle. Its negative powers need not converge inside the disk: for example, makes the series diverge at . Only the unit-circle values are used here, so the unnecessarily broad domain printed for does not affect the proof.
Center the five coefficients at lags . Their transfer function is real:
Choosing consecutive causal lags instead only adds a phase and leaves the squared modulus unchanged. After applications, the white noise spectral density has become
Write . Completing the square gives
For , its range is , and its absolute maximum is , attained exactly when . Consequently, on the conventional nonnegative frequency range ,
On the two-sided range there is also a peak at ; the ratio there is one for every . This is a counterexample to the claim if read literally on a signed frequency domain. The correct two-sided exclusion is .
The result illustrates how repeated symmetric filtering can amplify an oscillation. Although preserves a constant component, amplifies period-six oscillations. Repetition selects an increasingly narrow frequency band around those peaks; it does not simply smooth all noise away. In fact the unnormalized output variance eventually grows without bound, since a fixed interval around either peak has .

Articles by others on the same topic (0)

There are currently no matching articles.