An autoregressive process of order one obeys
where 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 representation
The 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 has
The 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 is
Conditioning 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 to
The conditional law is multivariate normal distribution .

Ancestors (7)

  1. Autoregressive model
  2. Autoregressive moving-average model
  3. Time series
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7. Home

Synonyms (1)

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.