Understanding ACFs via Difference Equations for AR(p) and ARMA(p, q)
1) Big picture: what we are trying to compute
- A time series is .
- The ACF at lag , written , measures how strongly is correlated with .
- We always have and (for stationary series) .
The strategy here is:
- Start from the model equation (AR or ARMA).
- Multiply both sides by , take expectations.
- Use properties of white noise and causality to simplify.
- Obtain a recurrence relation for (autocovariance) or directly for (autocorrelation).
- Solve the recurrence using a small set of “initial values.”
2) ACF of a causal AR(p): the recurrence and why you need constants
The AR(p) model
where is white noise with variance .
Key step: multiply by and take expectations
For causal AR(p), when , the term because depends only on past shocks and is uncorrelated with the “new shock” .
That produces the recurrence (for autocovariances):
Divide by to get the ACF recurrence:
Why you need “starting values”
This is a p-th order recurrence. To generate you need:
- plus
Those are found by plugging into the recurrence and using symmetry . That yields a linear system of equations in unknowns.
What the closed-form solution looks like
Let the AR polynomial be
If its roots are , then (in the distinct-root case) solutions look like sums of terms:
If a root is repeated, you get polynomial factors in . For example, if a root has multiplicity , it contributes:
If there are complex conjugate roots, the ACF becomes a damped oscillation (a decaying cosine wave).
Causality condition and decay
Causality for AR(p) corresponds to all roots satisfying . Then , so the ACF decays to 0 as .
3) Example: AR(3) and how initial conditions are computed
For an AR(3),
the ACF recurrence is:
To determine and , plug in and , then use , , and . This produces a 2×2 linear system in . Once those are known, the recurrence generates all larger lags.
Then, if you want an explicit closed-form formula, you:
- factor ,
- write the general form (including -polynomials for repeated roots),
- plug in to solve for the constants.
4) How to compute the variance once you know the ACF
Working with gives correlations, but not the variance .
For a causal AR(p), one can derive:
so
Interpretation:
- The variance of is the white-noise variance “amplified” by feedback from past values, captured by the and the ACF values.
5) What changes for ARMA(p, q): why “small lags” become special
ARMA(p, q) model
where
- ,
- .
A causal ARMA process can be written as a linear process:
The “minor complication”
When you repeat the earlier step (multiply by , take expectations), the right-hand side now contains terms like and , etc.
- For large lags , these expectations become 0.
- But for small lags (roughly and nearby), they are not necessarily 0.
Result:
- For sufficiently large , the ACF (or autocovariance) satisfies the same AR-type recurrence
- But to “start” the recurrence, you must solve a finite system for the first few , where
Those equations depend on the first few coefficients.
Practical point: getting the
For ARMA(1,1), can be derived by hand. In general ARMA(p,q), doing this manually is tedious, so software computes numerically (e.g., converting ARMA to an MA() representation).
Conceptually:
- tells you how a shock flows into .
- You only need the first several to set up the initial autocovariance equations.
6) Recognizing model classes from ACF shape
MA(q): sharp cutoff
For MA(q),
the ACF is exactly zero beyond lag :
So MA(q) is often visually identifiable because the ACF cuts off.
AR(p): no cutoff, but decay (possibly oscillatory)
For causal AR(p), the ACF does not cut off. It decays toward 0, often as a mixture of exponentials and possibly damped oscillations (if complex roots exist).
ARMA: also no cutoff, and can resemble AR
Causal ARMA typically also has an ACF that tails off (no sharp cutoff). This makes it harder to distinguish AR vs ARMA using ACF alone—both can show gradual decay.
That is why another function is introduced in the next step of the typical toolkit: PACF (partial autocorrelation), which is especially helpful for identifying AR order.
7) Summary
Difference equations provide a clean way to compute ACFs for AR and ARMA models: for AR(p), the ACF satisfies a p-th order linear recurrence whose solution is built from the roots of the AR polynomial (with polynomial-in- factors when roots repeat and damped oscillations when roots are complex). The unknown constants are pinned down by the initial values , found via a linear system. For ARMA(p,q), the same AR-type recurrence holds after a certain lag, but the first few autocovariances must be solved from additional equations that depend on the MA side; this requires a few coefficients from the MA() representation. In plots, MA(q) is notable for a hard cutoff in the ACF, while AR and ARMA generally show tailing decay, making them harder to separate using ACF alone.
