An autoregressive model expresses the current value as a linear combination of finitely many past values plus white noise.
For , let . The autoregressive polynomial factors as . Its roots lie outside the closed unit disk exactly when . In that causal region,The coefficients follow from and . They are absolutely summable in the stated region. Causality makes future white noise orthogonal to the observation past, giving forecasts and at horizons one and two.
For a causal autoregressive model with centered white noise of variance , multiplying by past values and taking expectations yields for , and . These Yule-Walker equations determine the autocovariance from the coefficients and noise variance, or estimate coefficients from observed autocovariances. Causality supplies the needed orthogonality of the current noise to past observations.
For independent fair signs, almost surely from every deterministic initial value. Outside with , the sign is preserved and . To reach that region, choose so . At the beginning of each -step block, choose the sign of the current value; a block of that sign pushes the absolute value past and has conditional probability . The chance of remaining inside after blocks is at most . This proof avoids any assumption about a density of the limiting random series.
With two fixed initial states and iid N(0,1) errors, the parameter likelihood is the product of conditional transition densities. For , it is proportional to . The initial observation is a point mass and the first nonzero observation has a parameter-independent likelihood term.
The autoregressive polynomial is . Substituting the backshift operator gives the autoregressive filter. Zeros outside the unit disk give the causality root criterion for an autoregressive model; zeros on the unit circle obstruct a nondegenerate stationary innovation-driven solution.
The autoregressive operator acts as . Its coefficients are encoded by the autoregressive polynomial. An ARMA equation equates this filtered observation to the noise filtered by the moving-average operator.
A unit root is a zero of an autoregressive polynomial on the unit circle. A zero at is removed by first differencing. A conjugate pair corresponds to the real factor . Nonzero white-noise excitation at an uncancelled unit root prevents a finite-variance stationary solution.
A large, slowly damping oscillatory sample autocorrelation function suggests autoregressive zeros near a conjugate pair on the unit circle. For period , the pair is near , with minimal real filter . Such a plot is evidence, not proof: a finite sample cannot distinguish a near-unit stationary model or a random sinusoid solely from the shape.
A causal time series satisfying with nondegenerate white noise has a square-summable present-and-past filter. The identity excludes roots inside the unit disk; a pole of on its boundary also prevents square summability. Thus all roots of lie strictly outside the unit circle.
The inverse autoregressive polynomial is an analytic function on a disk larger than the unit disk. The Cauchy estimate gives exponentially decaying coefficients of its infinite moving-average representation. Summing their products gives for some .
A weakly stationary process satisfying an autoregressive model can depend on future driving white noise. For with , the convergent in the sense of mean-square convergence solution is . Its autocovariance is . This is different from a causal time series.
If an autoregressive model has white noise of positive variance, a unique weakly stationary process solving its equation on all integer times exists precisely when its autoregressive polynomial has no root on the unit circle. In that case has an absolutely summable Laurent series on an annulus containing the unit circle; its coefficients define a bilateral linear filter of a stationary time series. Applying that inverse also proves uniqueness among bounded second-moment solutions. A root on the unit circle forces the candidate spectral density of a stationary process to have a nonintegrable singularity. The stronger causality root criterion for an autoregressive model requires every root outside the closed unit disk.
An autoregressive polynomial with a root at one gives a unit-root model. The basic example is a random walk, whose variance grows with time when the increments have positive variance. Differencing removes this root and recovers its white noise increments.
The Dickey–Fuller test detects a unit-root autoregressive process against a stationary causal alternative. Regress on , with deterministic terms appropriate to the model. Under the null, the usual regression statistic has a nonnormal Brownian motion functional limit, so ordinary normal critical values are inappropriate.
A centered model , with , has season-dependent coefficients and white noise innovations. In the nondegenerate case, the causal stability condition is . Individual coefficients can exceed one in modulus while the product remains stable. Its second-order law is a periodically correlated process.
For unit-variance innovations, orthogonality to the past givesConsequently and . Replacing autocovariance by matched sample estimates yields seasonal regression estimators. The unit innovation variance is necessary to identify the noise scale separately.
An autoregressive process of order one obeyswhere is real and is centered white noise of variance . The zero-mean version is ; in the affine form , the stationary mean satisfies .
For , its unique weakly stationary process solution on all integer times is the causal time-series representationThe sum converges in the sense of mean-square convergence because . It is an infinite moving-average representation using only present and past driving noise. Weak white noise suffices for this second-order conclusion; strong white noise also gives strict stationarity. The autocovariance of an AR(1) process is , so its variance is and its ACF is . See Bartlett, lecture 5: AR(1) representation and causality.
The appeal of an AR(1) is that one coefficient expresses how a deviation persists. For , disturbances propagate with weights . For , these weights alternate sign. With , , and , the recursive forecasts of an autoregressive process give and one and two steps ahead. If , the stationary variance is , while the one-step forecast error variance is only . Under weak white noise these are best linear forecasts; independent driving noise also makes them conditional expectations given the observed past.
The condition describes a stationary causal solution, not every finite recursion with those coefficients. Starting from a prescribed value gives the transient in finite initialization of an AR(1) process. Nor is it a condition for all possible two-sided stationary solutions: when , noncausal stationary autoregression uses future driving noise. See stationary versus causal solution of a two-sided AR(1) equation for the boundary cases.
For the stationary causal AR(1) with , matching terms in its infinite moving-average representation gives, for ,Symmetry of the autocovariance extends this to negative lags. Dividing by gives the autocorrelation . The geometric series explains both the enlarged stationary variance and the diminishing memory: all past disturbances contribute to the present, but their squared weights have a finite sum. At , the process reduces to shifted white noise and all nonzero-lag autocorrelations vanish. See Bartlett, lecture 4: AR(1) representation and mean-square convergence.
For , iterating an AR(1) from a fixed value gives the displayed finite sum. With centered white noise of variance and ,For , its covariance is , which depends on . Even setting leaves a changing variance. At , , and , the variances at times zero through three are , approaching ; this finite initialized record is not weakly stationary.
To initialize in weak stationarity, give mean , variance , and zero covariance with every future driving noise value. The full stationary construction sets . For discrete Gaussian white noise, equivalently draw from independently of future noise. This gives exact strict stationarity from the first plotted point; it is the initialization used in the figure in time series. Matching these first two moments alone does not guarantee strict stationarity for non-Gaussian inputs. See also stationary initialization of a scalar linear state-space model.
For , the bilateral sum equals on the unit circle. Multiplying by gives the one-sided autoregressive spectrum and reads off its covariance coefficients.
For a causal AR(1) plus uncorrelated observation white noise, cross covariances vanish by L2 convergence of the autoregressive noise expansion. Its covariance is . The additional noise changes only lag zero, attenuating the normalized positive-lag correlations.
Filtering the observations by gives covariance at zero, at lag one and zero elsewhere. Set and . Then , and . Applying defines actual white-noise innovations with variance , proving an at-most-(1,1) ARMA representation without assuming Gaussianity.
With nondegenerate white noise, a two-sided AR(1) equation has a unique weakly stationary solution exactly when . The solution is causal for and anticausal for . At , an n-term noise sum has variance , while its difference-of-stationary-values representation has variance at most four times the stationary variance, a contradiction.
For a stationary autoregressive process of order one with mean , autoregressive coefficient and innovation variance , an interior observation conditional on its neighbors hasThe Markov property makes the same law valid when all other observations are also conditioned on.
For , independent innovations and stationary initial variance , the full likelihood function isConditioning on gives a different likelihood.
Conditioning on the first observation of a centered autoregressive process of order one makes the maximum-likelihood estimator of its coefficient the least-squares ratio above, when the optimum is interior. The stationary initial normal distribution contributes an additional factor and quadratic term . These change the exact maximizer, but for a fixed interior stationary parameter their score is order one while the conditional score has order , giving the same leading estimator.
For , the autocovariance equation is . Replacing both autocovariances by sample sums divided by the same yields , the lag-one sample autocorrelation function.
For a stationary unit-variance normal distribution autoregression with coefficient , its vector of length has precision matrix that is tridiagonal: the two endpoint diagonal entries are , interior entries are , and adjacent off-diagonal entries are . An independent observation , with covariance , updates precision and information vector toThe conditional law is multivariate normal distribution .
Articles by others on the same topic
An autoregressive (AR) model is a type of statistical model used for analyzing and forecasting time series data. It is based on the idea that the current value of a time series can be expressed as a linear combination of its previous values. The basic concept is that past values have a direct influence on current values, allowing the model to capture temporal dependencies.