AR(p) Process

An autoregressive process of order describes a time series whose value at any time is a linear regression of its own most recent past values plus a random shock. The name is literal: auto (self) plus regression (linear prediction), so an AR model regresses the series on lagged copies of itself. In equation form,

where each coefficient is a fixed real constant, (otherwise the order would actually be smaller than ), and is a white-noise shock: an unpredictable disturbance, uncorrelated across time and with the past of . The same equation written through the backshift operator becomes the more compact with .

Whether or not the equation describes a sensible (stationary) time series depends on the coefficients. The condition is that all roots of the polynomial must lie strictly outside the unit circle in the complex plane; on this condition has constant mean, finite variance, and an autocovariance that depends only on lag, and the recursion can be unrolled into a convergent expression in past shocks (see 2.5.5 Causality and Invertibility).

The first-order case AR(1), , is the cleanest example. With and zero mean, the variance, autocovariance, and autocorrelation collapse to , , and . The variance grows toward infinity as approaches , which is the algebraic form of the stationarity condition . Once reaches the formula breaks down because the process accumulates past shocks indefinitely instead of forgetting them.

The data signature of an AR() is unmistakable: the autocorrelation decays smoothly toward zero (geometrically when the roots are real, with damped oscillation when complex), and the partial autocorrelation is exactly zero past lag . This combination, a slow tail in the ACF and a clean cutoff at lag in the PACF, is what allows the order to be read straight off two diagnostic plots.

Intuition

An AR process is a feedback loop. Each new value is a re-scaled echo of recent values plus a fresh, unforecastable shock. The coefficient in the AR(1) controls how loud that echo is. When is positive and close to , today’s value is almost the same as yesterday’s, with only a small new shock added: the series drifts slowly, takes long excursions away from its mean, and “remembers” past disturbances for many time steps. As shrinks toward , the echo fades and the series collapses toward white noise: the past tells you nothing, and each value is just the current shock.

The phrase mean-reverting describes what happens between any two consecutive steps when the long-run mean is zero and . Take the conditional expectation . If sits a distance above zero, the expected next value is only above zero, closer to the mean by a factor of . Each step pulls the series partway back toward its long-run level, which is why values that wander far from the mean tend to walk back. With negative the same shrinkage happens, but with a sign flip, so the series alternates above and below zero in a saw-tooth pattern.

Once , the dynamics split into two regimes determined by the roots of the polynomial . When the roots are real and outside the unit circle, the autocovariance is a sum of decaying exponentials and the process slides smoothly back to its mean (overdamped in the language of mechanical oscillators). When the roots are complex conjugates, the autocovariance is a product of an exponential decay and a cosine, and realizations ring at a characteristic frequency before dying out. The location of the roots in the complex plane therefore translates directly into observable behavior: how persistent the memory is, whether and at what rate the series oscillates, how sharply concentrated the energy is in any one frequency band.

Properties

(Stationarity Condition) All roots of outside the unit circle.

The series has a constant mean and a lag-only autocovariance (the two conditions for weak stationarity) exactly when every solution of satisfies . For AR(1), has the single root , so the condition reduces to . For AR(2), the same condition translates to the parameter region , , and , an open triangle in the -plane on whose boundary the variance and autocovariance formulas blow up.

(MA() Representation) A stationary AR() writes today’s value as a convergent infinite sum of past shocks.

Inverting the operator polynomial gives , where the weights are determined by the algebraic identity and satisfy . For AR(1) the weights work out to the simple geometric series , so . This expression makes explicit that today’s value is an exponentially weighted average of all past shocks, and that the influence of any single shock decays geometrically with rate , which is the algebraic source of the autocorrelation .

(Yule-Walker Equations) The autocovariances satisfy a linear recursion at every lag.

Multiplying the defining equation by and taking expectations gives

because is uncorrelated with everything in the past. The equations at form a linear system in the unknowns and , and solving the system gives the autocovariance directly from the AR coefficients. Reading the system in the other direction (substituting sample autocovariances on the left and solving for the ) produces the Yule-Walker estimator, the method-of-moments fit that is often used as a starting point for maximum-likelihood estimation.

(ACF Tails Off) The autocorrelation never reaches exact zero.

By the Yule-Walker recursion, at large lags is a fixed linear combination of with the same coefficients as the AR equation itself. The general solution is a sum of terms of the form where are the AR roots, so the tail decays geometrically (real roots) or as a decaying cosine (complex conjugate roots), but is non-zero at every finite lag. This continual non-vanishing of is the structural opposite of the moving-average case, whose autocorrelation reaches exact zero past lag .

(PACF Cuts Off at Lag ) The partial autocorrelation is exactly zero for every .

The partial autocorrelation at lag measures the correlation between and after the linear effect of the intermediate values has been removed. Because the AR() equation says exactly that those intermediate values, plus the shock , are everything that matters for , no additional past observation can add predictive information beyond lag , and the corresponding partial correlation vanishes. This sharp cutoff is the diagnostic that identifies the AR order from data: a sample PACF whose only significant entries are at lags points unambiguously at AR().

(Spectral Density) The frequency-domain shape of an AR process is the reciprocal of a polynomial.

By the linear-filter identity (see 2.3.4 Linear Filters and Frequency Response), the spectral density is

the variance of the white-noise driver divided by the squared magnitude of the AR polynomial evaluated on the unit circle. This rational form is what gives AR spectra their characteristic peaks: wherever comes close to zero (a pole of the spectrum), the density spikes upward, and the closer the corresponding root is to the unit circle, the sharper the spike. For AR(1) with positive the peak sits at , capturing the slow, long-memory drift; with negative it sits at , capturing the rapid alternation. For AR(2) with complex roots at angle , the peak sits near , the natural ringing frequency.

Examples

AR(1) with

What does the variance, the lag-5 autocorrelation, and a typical realization look like?

AR(2) with complex roots

For , locate the roots of the AR polynomial, decide whether the process is stationary, and estimate the natural ringing frequency.

Yule-Walker estimation of AR(2)

Given sample autocovariances from data believed to be AR(2), recover the coefficients .