Big picture: what you are trying to compute
When you have a time-ordered data series (today, yesterday, two days ago, …), a common question is:
- How strongly is $X_t$ related to its past values $X_{t-1}, X_{t-2}, \dots$?
That relationship is summarized by the autocorrelation function (ACF):
- = correlation between and
- is the lag (how many time steps back)
Key facts:
- (a value is perfectly correlated with itself)
- If is large in magnitude for some , the series has “memory” at that lag.
- If quickly decays to 0, the series forgets quickly.
The model: AR(1) and AR(2) in plain words
White noise
Think of as the completely unpredictable “new shock” at time .
It has mean 0 and no correlation over time.
AR(1)
Interpretation:
- Today is a fraction of yesterday, plus a new shock.
AR(2)
Interpretation:
- Today depends on the last two values, plus a new shock.
Why “causal” matters (in everyday terms)
A model is causal if can be written using only today and earlier shocks:
So you do not need future information to define the present.
This is crucial for forecasting: a model that needs future shocks is not usable as a practical forward-looking model.
Two ways to get the ACF — and why this method is simpler
A standard method is:
- Rewrite as an infinite sum of past shocks (-weights),
- Compute covariances from those weights.
That can be messy for anything beyond AR(1).
The alternative method here is cleaner:
Use the model equation itself to create a difference equation for
A “difference equation” is like a recurrence rule:
- it tells you how relates to earlier values like , , etc.
Once you have that recurrence and a couple of starting values, you can compute the entire ACF.
Part A. AR(1): ACF via a difference equation
Start with:
Multiply both sides by and take expectations.
For , the key idea is:
- is independent of the past, and if the model is causal then depends only on shocks at time and earlier.
- So for .
That gives:
Divide by to convert to ACF:
So:
and by symmetry of correlation:
Meaning: AR(1) correlations decay geometrically.
Part B. AR(2): difference equation for the ACF
Start with:
Do the same trick (multiply by , take expectations). For , again under causality, so you get:
Divide by :
This is a second-order recurrence: each value depends on the previous two.
So if you know:
then you can compute , then , and so on.
How to get for AR(2)
Use the same recurrence at :
And use the symmetry , plus :
Now you have the two starting points, and the recurrence generates all lags.
Closed-form “shape” of the ACF for AR(2)
To understand what looks like, you connect the recurrence to the roots of a polynomial.
Define the AR polynomial:
Its roots determine the form of the solution.
Case 1: Two distinct real roots
If , then:
This means the ACF is a sum of two decaying exponentials, possibly with sign changes depending on the roots.
Case 2: One repeated real root
If , then:
So it’s still decaying, but the extra “” term can change the curvature.
Case 3: Complex conjugate roots
If the roots are complex conjugates, the ACF has the form:
That is:
- $\beta^h$ gives exponential decay
- $\cos(\cdot)$ gives oscillation (alternating positive/negative in a wave pattern)
This explains why some AR(2) processes have an ACF that “wiggles” around zero while shrinking.
Why roots outside the unit circle means “causal”
The causality condition for AR(2) is:
- both roots satisfy and
Practical meaning:
- the influence of past shocks fades over time instead of exploding
- the process can be represented using past shocks only (no future terms needed)
What the examples are illustrating
Example 3.1 (real distinct roots, negative inverses)
You get something like:
Because the bases are negative, the sign flips as increases:
- ACF alternates +/− and decays.
Example 3.2 (repeated root)
You get:
This is:
- always positive (since )
- decays very fast, but the factor changes the early-lag shape.
Example 3.3 (complex roots)
You get:
So the ACF:
- oscillates (wave pattern)
- shrinks over time (because decays)
The practical “recipe” to compute an AR(2) ACF
- Check causality
Find the roots of .
If both roots have magnitude , it is causal. - Write the recurrence
- Set initial values
- Either
- compute recursively for as many lags as you want, or
- use the closed-form formula based on the root type (distinct, repeated, complex)
Why this method is valuable
- You avoid computing an infinite series representation of the process.
- You get a direct recurrence rule for the ACF.
- The root structure immediately explains the qualitative shape:
- monotone decay,
- alternating decay,
- oscillatory decay.
