Autoregressive process of order one Created 2026-09-28 Updated 2026-10-14
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 driven by centered unit-variance iid noise with a finite fourth moment, put and . Independence gives
The sum of the two linear-quadratic cross covariances is . The cumulant term disappears for Gaussian noise. Merely assuming strong white noise does not justify the Gaussian formula; a fourth moment is needed for the variance of the quadratic transform.
With absolutely summable autocovariance, the asymptotic variance of the sample mean satisfies
The sum is signed, rather than a sum of absolute values. It can be zero: the first difference of strong white noise has telescoping partial sums. A central limit theorem needs further dependence assumptions.
Moving-average process of order one Created 2026-09-28 Updated 2026-10-14
A moving-average process of order one has the form
with centered white noise of finite positive variance . Each disturbance enters the current observation with weight and the next observation with weight , then leaves the filter. It is a weakly stationary process for every real : the mean is and the autocovariance of an MA(1) process depends only on lag. Strong white noise additionally makes it a strictly stationary process. No restriction is needed for stationarity.
For a worked observation calculation, take , , and consecutive noise values , , . Then and ; the same disturbance appears in both. If , the variance is , the lag-one autocovariance is , and the lag-one autocorrelation is . All higher-lag autocorrelations vanish, as shown in autocorrelation.
An MA(1) is useful for brief dependence caused by overlapping disturbances or measurements. Its name refers to a weighted moving sum of noise; its weights need not be positive or sum to one, and it differs from the data smoother in seasonal extraction by a centred moving average. Under strong white noise, observations more than one interval apart depend on disjoint independent noise families and are independent. Under weak white noise, the same cutoff establishes only uncorrelated random variables.
Invertibility of a moving-average model is a separate question: can the specified driving noise be recovered by a stable linear filter of present and past observations? For an MA(1) the answer, with the absolutely summable filter convention, is exactly :
Thus gives a stationary MA(1) that is not invertible in this sense. At it is still stationary, but the inverse coefficients are not absolutely summable. The case is simply shifted white noise. See Bartlett, lecture 5: MA(1) and stable invertibility.
Reflecting an inside-unit-circle zero across the unit circle produces an invertible moving-average model with the same spectral density of a stationary process, after rescaling the driving white noise variance. For real , . The transformed driving sequence is a linear innovation process; without Gaussianity it need not be strong white noise.
Here the innovation process consists of linear innovations, the linear one-step prediction errors: , where is the closed linear span of the past 's in . For Gaussian processes this is also the conditional expectation prediction error. For general non-Gaussian strong white noise these two notions can differ.
The given is not the linear innovation process. The moving-average factor has its zero at , inside the unit disk, and is noninvertible as a causal moving-average filter. The identity
is the moving-average root reflection that places this zero outside the unit disk. Thus the causal invertible representation has innovation variance , rather than the given variance .
For an explicit verification, define
The filter has constant squared modulus , so is weak white noise with variance . The new moving-average factor has root and is invertible, while its autoregressive factor is causal. Hence the past spans of and agree, and belongs to that past span. Orthogonality of to past therefore identifies it as the linear innovation process. The variance difference proves that it cannot be . If the original noise is Gaussian, the new linear innovations are independent Gaussian variables; without Gaussianity they need only be uncorrelated random variables.
The printed strong white noise assumption does not imply a normal distribution or even a finite fourth moment. Thus it does not, by itself, determine the covariance of a quadratic transform. We give the intended Gaussian calculation, and then the general finite-fourth-moment answer.
If is Gaussian, is a centered Gaussian process. Put and . Since and , the centered transform is
The supplied Hermite polynomial identity makes the cross terms vanish and gives
Equivalently,
The constant has no effect on covariance.
For a general iid noise with , put and , its fourth cumulant. Independence and expansion of third and fourth moments give, for ,
where
Summing the geometric series explicitly gives
The covariance of quadratic transforms of a linear process follows from a fourth-moment expansion consisting of the three Isserlis theorem pairings, plus the fourth-cumulant contribution when all four noise indices coincide. The third-moment contribution similarly requires three coincident indices. This proves the general formula without assuming a normal distribution. For Gaussian white noise , recovering the simpler answer. If and the noise has infinite fourth moment, need not have finite variance, so an autocovariance function may not exist.
For an integer period , uses the backshift operator as . It annihilates a deterministic period- mean. If with and strong white noise, the result is the stationary moving average .
If with a deterministic periodic scale and strong white noise of variance , then . Its variance is , still seasonal when varies. A periodic scale model or variance standardization is more appropriate than blindly applying differencing.
Stationary process Created 2026-09-28 Updated 2026-10-14
A stationary process, in the strict sense, has the same joint probability distribution after every common shift of its time indices. More precisely, for every positive integer , every choice of times , and every integer shift ,
Here equality means equality of probability distributions, not equality of realized observations. A sample path can fluctuate, stay positive for a while, or show accidental runs while its generating law remains stationary. Strong white noise is a basic example: shifting time preserves every joint law of its independent and identically distributed random variables.
The distinction between strict stationarity and weak stationarity is useful. The former preserves all finite joint laws; the latter preserves only the finite mean and covariance structure. Strict stationarity with finite second moments implies weak stationarity, but strict stationarity itself does not require finite variance. A Gaussian process with weak stationarity is also strictly stationary, because each of its finite-dimensional distributions, a joint normal distribution, is determined by its mean vector and covariance matrix.
White noise Created 2026-09-28 Updated 2026-10-14
For the AR(1) and MA(1) formulas here, white noise means a real sequence indexed by all integer times with
These are the weak white noise assumptions: zero mean, a common finite positive variance, and uncorrelated random variables at distinct times. Independence and a normal distribution are additional assumptions. Strong white noise requires independent and identically distributed random variables; discrete Gaussian white noise is the jointly Gaussian special case. Some definitions allow a constant nonzero mean; subtract it before using the centered formulas here.
For a concrete dependent example, let equal or with equal probabilities, independently of a sequence of independent Rademacher random variables , and put . Its mean is zero, its variance is , and its nonzero-lag autocovariances vanish. Nevertheless every equals the same : seeing one magnitude determines all the others. This is white noise with dependence invisible to its ACF, and is also an example of the issue discussed in ergodic stationary process.