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 (Xt)(X_t).
  • The ACF at lag hh, written ρX(h)\rho_X(h), measures how strongly XtX_t is correlated with XthX_{t-h}.
  • We always have ρX(0)=1\rho_X(0)=1 and (for stationary series) ρX(h)=ρX(h)\rho_X(-h)=\rho_X(h).

The strategy here is:

  1. Start from the model equation (AR or ARMA).
  2. Multiply both sides by XthX_{t-h}​, take expectations.
  3. Use properties of white noise and causality to simplify.
  4. Obtain a recurrence relation for γX(h)\gamma_X(h) (autocovariance) or directly for ρX(h)\rho_X(h) (autocorrelation).
  5. Solve the recurrence using a small set of “initial values.”

2) ACF of a causal AR(p): the recurrence and why you need pp constants

The AR(p) model

Xtϕ1Xt1ϕpXtp=Wt,X_t – \phi_1 X_{t-1} – \cdots – \phi_p X_{t-p} = W_t,

where (Wt)(W_t) is white noise with variance σW2\sigma_W^2​.

Key step: multiply by XthX_{t-h}​ and take expectations

For causal AR(p), when h1h \ge 1, the term E(WtXth)=0E(W_t X_{t-h}) = 0 because XthX_{t-h}​ depends only on past shocks and is uncorrelated with the “new shock” WtW_t​.

That produces the recurrence (for autocovariances):γX(h)=ϕ1γX(h1)++ϕpγX(hp),h1.\gamma_X(h)=\phi_1\gamma_X(h-1)+\cdots+\phi_p\gamma_X(h-p),\quad h\ge 1.

Divide by γX(0)\gamma_X(0) to get the ACF recurrence:ρX(h)=ϕ1ρX(h1)++ϕpρX(hp),h1.\rho_X(h)=\phi_1\rho_X(h-1)+\cdots+\phi_p\rho_X(h-p),\quad h\ge 1.

Why you need pp “starting values”

This is a p-th order recurrence. To generate ρ(1),ρ(2),\rho(1),\rho(2),\ldots you need:

  • ρ(0)=1\rho(0)=1 plus
  • ρ(1),,ρ(p1)\rho(1),\ldots,\rho(p-1)

Those ρ(1),,ρ(p1)\rho(1),\ldots,\rho(p-1) are found by plugging h=1,2,,p1h=1,2,\ldots,p-1 into the recurrence and using symmetry ρ(k)=ρ(k)\rho(-k)=\rho(k). That yields a linear system of p1p-1 equations in p1p-1 unknowns.

What the closed-form solution looks like

Let the AR polynomial beϕ(z)=1ϕ1zϕpzp.\phi(z)=1-\phi_1 z-\cdots-\phi_p z^p.

If its roots are r1,,rpr_1,\ldots,r_p​, then (in the distinct-root case) solutions look like sums of terms:ρ(h)=c1r1h++cprph.\rho(h)=c_1 r_1^{-h}+ \cdots + c_p r_p^{-h}.

If a root is repeated, you get polynomial factors in hh. For example, if a root rr has multiplicity kk, it contributes:(polynomial of degree k1 in h)rh.(\text{polynomial of degree }k-1 \text{ in } h)\cdot r^{-h}.

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 rj>1|r_j|>1. Then rjh0|r_j^{-h}|\to 0, so the ACF decays to 0 as hh\to\infty.


3) Example: AR(3) and how initial conditions are computed

For an AR(3),Xtϕ1Xt1ϕ2Xt2ϕ3Xt3=Wt,X_t-\phi_1X_{t-1}-\phi_2X_{t-2}-\phi_3X_{t-3}=W_t,

the ACF recurrence is:ρ(h)=ϕ1ρ(h1)+ϕ2ρ(h2)+ϕ3ρ(h3),h1.\rho(h)=\phi_1\rho(h-1)+\phi_2\rho(h-2)+\phi_3\rho(h-3),\quad h\ge 1.

To determine ρ(1)\rho(1) and ρ(2)\rho(2), plug in h=1h=1 and h=2h=2, then use ρ(1)=ρ(1)\rho(-1)=\rho(1), ρ(2)=ρ(2)\rho(-2)=\rho(2), and ρ(0)=1\rho(0)=1. This produces a 2×2 linear system in ρ(1),ρ(2)\rho(1),\rho(2). Once those are known, the recurrence generates all larger lags.

Then, if you want an explicit closed-form formula, you:

  1. factor ϕ(z)\phi(z),
  2. write the general form (including hh-polynomials for repeated roots),
  3. plug in ρ(0),ρ(1),ρ(2)\rho(0),\rho(1),\rho(2) to solve for the constants.

4) How to compute the variance γX(0)\gamma_X(0) once you know the ACF

Working with ρ(h)\rho(h) gives correlations, but not the variance γ(0)=Var(Xt)\gamma(0)=\mathrm{Var}(X_t).

For a causal AR(p), one can derive:γX(0)(1h=1pϕhρX(h))=σW2,\gamma_X(0)\left(1-\sum_{h=1}^{p}\phi_h\,\rho_X(h)\right)=\sigma_W^2,

soγX(0)=σW21h=1pϕhρX(h).\boxed{\gamma_X(0)=\frac{\sigma_W^2}{1-\sum_{h=1}^{p}\phi_h\,\rho_X(h)}}.

Interpretation:

  • The variance of XtX_t​ is the white-noise variance “amplified” by feedback from past values, captured by the ϕh\phi_h​ and the ACF values.

5) What changes for ARMA(p, q): why “small lags” become special

ARMA(p, q) model

ϕ(B)Xt=θ(B)Wt,\phi(B)X_t=\theta(B)W_t,

where

  • ϕ(B)=1ϕ1BϕpBp\phi(B)=1-\phi_1B-\cdots-\phi_pB^p,
  • θ(B)=1+θ1B++θqBq\theta(B)=1+\theta_1B+\cdots+\theta_qB^q.

A causal ARMA process can be written as a linear process:Xt=j=0ψjWtj,ψ0=1.X_t=\sum_{j=0}^{\infty}\psi_j W_{t-j},\quad \psi_0=1.

The “minor complication”

When you repeat the earlier step (multiply by XthX_{t-h}, take expectations), the right-hand side now contains terms like E(WtXth)E(W_t X_{t-h}) and E(Wt1Xth)E(W_{t-1}X_{t-h}), etc.

  • For large lags hh, these expectations become 0.
  • But for small lags (roughly hqh \le q and nearby), they are not necessarily 0.

Result:

  • For sufficiently large hh, the ACF (or autocovariance) satisfies the same AR-type recurrence

γ(h)ϕ1γ(h1)ϕpγ(hp)=0.\gamma(h)-\phi_1\gamma(h-1)-\cdots-\phi_p\gamma(h-p)=0.

  • But to “start” the recurrence, you must solve a finite system for the first few γ(0),,γ(r1)\gamma(0),\ldots,\gamma(r-1), where

r=max{p,  q+1}.r=\max\{p,\;q+1\}.

Those equations depend on the first few ψj\psi_j​ coefficients.

Practical point: getting the ψj\psi_j

For ARMA(1,1), ψ0,ψ1,\psi_0,\psi_1,\ldots can be derived by hand. In general ARMA(p,q), doing this manually is tedious, so software computes ψj\psi_j​ numerically (e.g., converting ARMA to an MA(\infty) representation).

Conceptually:

  • ψj\psi_j tells you how a shock WtjW_{t-j}​ flows into XtX_t​.
  • You only need the first several ψj\psi_j​ to set up the initial autocovariance equations.

6) Recognizing model classes from ACF shape

MA(q): sharp cutoff

For MA(q),Xt=Wt+θ1Wt1++θqWtq,X_t=W_t+\theta_1W_{t-1}+\cdots+\theta_qW_{t-q},

the ACF is exactly zero beyond lag qq:ρ(h)=0for h>q.\rho(h)=0\quad\text{for } h>q.

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-hh factors when roots repeat and damped oscillations when roots are complex). The unknown constants are pinned down by the initial values ρ(0),,ρ(p1)\rho(0),\ldots,\rho(p-1), 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 ψj\psi_j​ coefficients from the MA(\infty) 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.

Similar Posts

Questions, corrections, or additional insights?