Normal family: Difference between revisions
en>777sms No edit summary |
en>Toby Bartels m disambiguation |
||
Line 1: | Line 1: | ||
:''"Backshift" redirects here. For the linguistic sense see [[Sequence of tenses]].'' | |||
In [[time series]] analysis, the '''lag operator''' or '''back[[shift operator]]''' operates on an element of a time series to produce the previous element. For example, given some time series | |||
:<math>X= \{X_1, X_2, \dots \}\,</math> | |||
then | |||
:<math>\, L X_t = X_{t-1} </math> for all <math>\; t > 1\,</math> | |||
or equivalently | |||
:<math>\, X_t = L X_{t+1}</math> for all <math>\; t \geq 1\,</math> | |||
where ''L'' is the lag operator. Sometimes the symbol ''B'' for backshift is used instead. Note that the lag operator can be raised to arbitrary integer powers so that | |||
:<math>\, L^{-1} X_{t} = X_{t+1}\,</math> | |||
and | |||
:<math>\, L^k X_{t} = X_{t-k}.\,</math> | |||
==Lag polynomials== | |||
Also polynomials of the lag operator can be used, and this is a common notation for [[autoregressive moving average|ARMA]] (autoregressive moving average) models. For example, | |||
:<math> \varepsilon_t = X_t - \sum_{i=1}^p \varphi_i X_{t-i} = \left(1 - \sum_{i=1}^p \varphi_i L^i\right) X_t\,</math> | |||
specifies an AR(''p'') model. | |||
A [[polynomial]] of lag operators is called a '''lag polynomial''' so that, for example, the ARMA model can be concisely specified as | |||
:<math> \varphi (L) X_t = \theta (L) \varepsilon_t\,</math> | |||
where <math> \varphi (L)</math> and <math>\theta (L)</math> respectively represent the lag polynomials | |||
:<math> \varphi (L) = 1 - \sum_{i=1}^p \varphi_i L^i\,</math> | |||
and | |||
:<math> \theta (L)= 1 + \sum_{i=1}^q \theta_i L^i.\,</math> | |||
Polynomials of lag operators follow similar rules of multiplication and division as do numbers and polynomials of variables. For example, | |||
:<math> X_t = \frac{\theta (L) }{\varphi (L)}\varepsilon_t,</math> | |||
means the same thing as | |||
:<math>\varphi (L) X_t = \theta (L) \varepsilon_t\, .</math> | |||
As with polynomials of variables, a polynomial in the lag operator can be divided by another one using [[polynomial long division]]. In general dividing one such polynomial by another, when each has a finite order (highest exponent), results in an infinite-order polynomial. | |||
An '''annihilator operator''', denoted <math>[\ ]_+</math>, removes the entries of the polynomial with negative power (future values). | |||
==Difference operator== | |||
{{main|Finite difference}} | |||
In time series analysis, the first difference operator ''Δ'' is a special case of lag polynomial. | |||
:<math> | |||
\begin{array}{lcr} | |||
\Delta X_t & = X_t - X_{t-1} \\ | |||
\Delta X_t & = (1-L)X_t ~. | |||
\end{array} | |||
</math> | |||
Similarly, the second difference operator works as follows: | |||
:<math> | |||
\begin{align} | |||
\Delta ( \Delta X_t ) & = \Delta X_t - \Delta X_{t-1} \\ | |||
\Delta^2 X_t & = (1-L)\Delta X_t \\ | |||
\Delta^2 X_t & = (1-L)(1-L)X_t \\ | |||
\Delta^2 X_t & = (1-L)^2 X_t ~. | |||
\end{align} | |||
</math> | |||
The above approach generalises to the ''i''th difference operator | |||
<math> \Delta ^i X_t = (1-L)^i X_t \ .</math> | |||
==Conditional expectation== | |||
It is common in stochastic processes to care about the expected value of a variable given a previous information set. Let <math>\Omega_t</math> be all information that is common knowledge at time ''t'' (this is often subscripted below the expectation operator); then the expected value of the realisation of ''X'', ''j'' time-steps in the future, can be written equivalently as: | |||
:<math>E [ X_{t+j} | \Omega_t] = E_t [ X_{t+j} ] \,.</math> | |||
With these time-dependent conditional expectations, there is the need to distinguish between the backshift operator (''B'') that only adjusts the date of the forecasted variable and the Lag operator (''L'') that adjusts equally the date of the forecasted variable and the information set: | |||
:<math>L^n E_t [ X_{t+j} ] = E_{t-n} [ X_{t+j-n} ] \, ,</math> | |||
:<math>B^n E_t [ X_{t+j} ] = E_t [ X_{t+j-n} ] \, .</math> | |||
==References== | |||
*{{cite book | first = James Douglas| last = Hamilton| year = 1994| title = Time series analysis | publisher = Princeton University Press | id = ISBN 0-691-04289-6 }} | |||
*{{cite book | first = Marno| last = Verbeek| year = 2008| title = A guide to modern econometrics | publisher = John Wiley and Sons | id = ISBN 0-470-51769-7 }} | |||
{{More footnotes|date=January 2011}} | |||
==See also== | |||
* [[Autoregressive model]] | |||
* [[Autoregressive moving average model]] | |||
* [[Moving average model]] | |||
* [[Shift operator]] | |||
* [[Z-transform]] | |||
{{DEFAULTSORT:Lag Operator}} | |||
[[Category:Stochastic processes]] |
Revision as of 17:51, 16 November 2013
- "Backshift" redirects here. For the linguistic sense see Sequence of tenses.
In time series analysis, the lag operator or backshift operator operates on an element of a time series to produce the previous element. For example, given some time series
then
or equivalently
where L is the lag operator. Sometimes the symbol B for backshift is used instead. Note that the lag operator can be raised to arbitrary integer powers so that
and
Lag polynomials
Also polynomials of the lag operator can be used, and this is a common notation for ARMA (autoregressive moving average) models. For example,
specifies an AR(p) model.
A polynomial of lag operators is called a lag polynomial so that, for example, the ARMA model can be concisely specified as
where and respectively represent the lag polynomials
and
Polynomials of lag operators follow similar rules of multiplication and division as do numbers and polynomials of variables. For example,
means the same thing as
As with polynomials of variables, a polynomial in the lag operator can be divided by another one using polynomial long division. In general dividing one such polynomial by another, when each has a finite order (highest exponent), results in an infinite-order polynomial.
An annihilator operator, denoted , removes the entries of the polynomial with negative power (future values).
Difference operator
Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church. In time series analysis, the first difference operator Δ is a special case of lag polynomial.
Similarly, the second difference operator works as follows:
The above approach generalises to the ith difference operator
Conditional expectation
It is common in stochastic processes to care about the expected value of a variable given a previous information set. Let be all information that is common knowledge at time t (this is often subscripted below the expectation operator); then the expected value of the realisation of X, j time-steps in the future, can be written equivalently as:
With these time-dependent conditional expectations, there is the need to distinguish between the backshift operator (B) that only adjusts the date of the forecasted variable and the Lag operator (L) that adjusts equally the date of the forecasted variable and the information set:
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534