Sei sulla pagina 1di 36

TIME SERIES

Contents

Syllabus

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

iii

Books

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

iii

Keywords

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

iv

1 Models for time series

 

1

1.1 Time series data

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

1

1.2 Trend, seasonality, cycles and residuals

 

1

1.3 Stationary processes

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

1

1.4 Autoregressive processes

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

2

1.5 Moving average processes

 

.

.

.

.

.

.

.

.

.

.

.

3

1.6 White noise

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

4

1.7 The turning point test

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

4

2 Models of stationary processes

 

5

2.1 Purely indeterministic processes

 

5

2.2 ARMA processes

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

5

2.3 ARIMA processes

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

6

2.4 Estimation of the autocovariance function

 

6

2.5 Identifying a MA( q ) process

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

7

2.6 Identifying an AR( p ) process .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

7

2.7 Distributions of the ACF and PACF

 

8

3 Spectral methods

 

9

3.1 The discrete Fourier transform

 

.

.

.

.

.

.

.

.

.

.

.

9

3.2 The spectral density

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

9

3.3 Analysing the effects of smoothing

 

12

4 Estimation of the spectrum

 

13

4.1 The periodogram

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

13

4.2 Distribution of spectral estimates

 

15

4.3 The fast Fourier transform

 

.

.

.

.

.

.

.

.

.

.

.

1 6

5 Linear filters

 

17

5.1 The Filter Theorem

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

17

5.2 Application to autoregressive processes

 

17

5.3 Application to moving average processes

 

18

5.4 The general linear process

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

1 9

 

i

5.5 Filters and ARMA processes

 

.

.

.

.

.

.

.

.

.

.

.

20

5.6 Calculating autocovariances in ARMA models

 

20

6 Estimation of trend and seasonality

 

21

6.1 Moving averages .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

21

6.2 Centred moving averages

 

.

.

.

.

.

.

.

.

.

.

.

22

6.3 The Slutzky-Yule effect

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

22

6.4 Exponential smoothing

 

.

.

.

.

.

.

.

.

.

.

.

23

6.5 Calculation of seasonal indices

 

.

.

.

.

.

.

.

.

.

.

.

24

7 Fitting ARIMA models

 

25

7.1 The Box-Jenkins procedure

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

25

7.2 Identification

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

25

7.3 Estimation .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

25

7.4 Verification

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

27

7.5 Tests for white noise

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

27

7.6 Forecasting with ARMA models

 

.

.

.

.

.

.

.

.

.

.

.

28

8 State space models

 

29

8.1 Models with unobserved states

 

.

.

.

.

.

.

.

.

.

.

.

29

8.2 The Kalman filter

 

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

30

8.3 Prediction

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

31

8.4 Parameter estimation revisited

 

.

.

.

.

.

.

.

.

.

.

.

32

ii

Syllabus

Time series analysis refers to problems in which observatio ns are collected at regular time intervals and there are correlations among successive observations. Applications cover virtually all areas of Statistics but some of the most important include economic and financial time series, and many areas of environmental or ecological data. In this course, I shall cover some of the most important metho ds for dealing with these problems. In the case of time series, these include the basic definitions of autocorrelations etc., then time-domain model fitting including autoregressive and moving average processes, spectral methods, and some discussion of the effect of time series correlations on other kinds of statistical inference, such as the estimation of means and regression coefficients.

Books

1. P.J. Brockwell and R.A. Davis, Time Series: Theory and Methods , Springer Series in Statistics (1986).

2. C. Chatfield, The Analysis of Time Series: Theory and Practice , Chapman and Hall (1975). Good general introduction, especially for those completely new to time series.

3. P.J. Diggle, Time Series: A Biostatistical Introduction , Oxford University Press

(1990).

4. M. Kendall, Time Series , Charles Griffin (1976).

iii

Keywords

ACF, 2 AR(p), 2 ARIMA(p,d,q), 6 ARMA(p,q), 5 autocorrelation function, 2 autocovariance function, 2, 5 autoregressive moving average process, 5 autoregressive process, 2

Box-Jenkins, 18

classical decomposition, 1

estimation, 18

filter generating function, 12

Gaussian process, 5

identifiability, 14 identification, 18 integrated autoregressive moving average process, 6 invertible process, 4

iv

MA(q), 3 moving average process, 3

nondeterministic, 5 nonnegative definite sequence, 6

PACF, 11 periodogram, 15

sample partial autocorrelation coefficient, 11 second order stationary, 2 spectral density function, 8 spectral distribution function, 8 strictly stationary, 1 strongly stationary, 1

turning point test, 4

verification, 20

weakly stationary, 2 white noise, 4

Yule-Walker equations, 3

1

Models for time series

1.1 Time series data

A time series is a set of statistics, usually collected at reg ular intervals. Time series data occur naturally in many application areas.

economics - e.g., monthly data for unemployment, hospital admissions, etc.

finance - e.g., daily exchange rate, a share price, etc.

environmental - e.g., daily rainfall, air quality readings.

medicine - e.g., ECG brain wave activity every 2 8 secs.

The methods of time series analysis pre-date those for gener al stochastic processes and Markov Chains. The aims of time series analysis are to describe and summarise time series data, fit low-dimensional models, and make forecasts.

., a

doubly infinite sequence of real-valued random variables indexed by Z .

We write our real-valued series of observations as

, X 2 , X 1 , X 0 , X 1 , X 2 ,

1.2 Trend, seasonality, cycles and residuals

One simple method of describing a series is that of classical decomposition. The notion is that the series can be decomposed into four element s:

Trend ( T t ) — long term movements in the mean;

Seasonal effects ( I t ) — cyclical fluctuations related to the calendar;

Cycles ( C t ) — other cyclical fluctuations (such as a business cycles);

Residuals ( E t ) — other random or systematic fluctuations.

The idea is to create separate models for these four elements and then combine them, either additively

X t = T t + I t + C t + E t

or multiplicatively

X t = T t · I t · C t · E t .

1.3 Stationary processes

1. A sequence { X t , t Z } is strongly stationary or strictly stationary if

( X t 1 ,

for all sets of time points t 1 ,

D

, X t k ) =( X t 1 + h ,

, t k and integer

, X t k + h )

h.

2. A sequence is weakly stationary , or second order stationary if

1

(a)

E ( X t ) = µ, and

(b)

cov( X t , X t + k ) = γ k ,

where µ is constant and γ k is independent of t.

3. The sequence { γ k , k Z } is called the autocovariance function.

4. We also define

ρ k = γ k 0 = corr( X t , X t + k )

and call { ρ k , k Z } the autocorrelation function (ACF).

Remarks.

1.

A strictly stationary process is weakly stationary.

2.

If the process is Gaussian, that is ( X t 1 ,

, X t k ) is multivariate normal, for all

t 1 ,

, t k , then weak stationarity implies strong stationarity.

3.

γ 0 = var( X t ) > 0, assuming X t is genuinely random.

4.

By symmetry, γ k = γ k , for all k .

1.4

Autoregressive processes

The autoregressive process of order p is denoted AR( p ), and defined by

X t =

p

r =1

φ r X t r + ǫ t

(1.1)

where φ 1 ,

related) random variables with mean 0 and variance σ 2 .

, φ r are fixed constants and { ǫ t } is a sequence of independent (or uncor-

The AR(1) process is defined by

X t = φ 1 X t 1 + ǫ t .

To find its autocovariance function we make successive subst itutions, to get

X t = ǫ t + φ 1 ( ǫ t 1 + φ 1 ( ǫ t 2 + · · · )) = ǫ t + φ 1 ǫ t 1 + φ 2 ǫ t 2 + · · ·

The fact that { X t } is second order stationary follows from the observation that E ( X t ) = 0 and that the autocovariance function can be calculated as follows:

(1.2)

1

γ 0 = E ǫ t + φ 1 ǫ t 1 + φ 2 ǫ t 2 + · · · 2 = 1 + φ 2

1

1

+ φ 4 + · · · σ 2 =

1

γ k = E

r

=0

φ

r

1

ǫ

t r

s

=0

φ

s

1

ǫ t + k s =

σ 2 φ k 1 φ 2

1

1

.

σ 2

1 φ 2

1

2

There is an easier way to obtain these results. Multiply equa tion (1.2) by X t k and take the expected value, to give

E ( X t X t k ) = E ( φ 1 X t 1 X t k ) + E ( ǫ t X t k ) .

Thus γ k = φ 1 γ k 1 , k = 1 , 2 , Similarly, squaring (1.2) and taking the expected value gives

2

E ( X ) =

t

φ 1 E ( X 1 ) + 2 φ 1 E ( X t 1 ǫ t ) + E ( ǫ ) = φ 2 E ( X 1 ) + 0 + σ 2

2

t

2

t

1

2

t

and so γ 0 = σ 2 / (1 φ 2 ). More generally, the AR( p ) process is defined as

X t = φ 1 X t 1 + φ 2 X t 2 + · · · + φ p X t p + ǫ t .

Again, the autocorrelation function can be found by multiplying (1.3) by X t k , taking the expected value and dividing by γ 0 , thus producing the Yule-Walker equations

1

(1.3)

ρ k = φ 1 ρ k 1 + φ 2 ρ k 2 + · · · + φ p ρ k p ,

k = 1 , 2 , .

.

.

These are linear recurrence relations, with general soluti on of the form

ρ k = C 1 ω

|k |

1

|k |

+ · · · + C p ω

p

,

where ω 1 ,

ω p φ 1 ω p 1 φ 2 ω p 2 − · · · − φ p = 0

and C 1 ,

is natural to require γ k 0 as k → ∞ , in which case the roots must lie inside the

unit circle, that is, |ω i | < 1. Thus there is a restriction on the values of φ 1 ,

that can be chosen.

, φ p

, p 1. It

, ω p are the roots of

, C p are determined by ρ 0 = 1 and the equations for k = 1 ,

1.5 Moving average processes

The moving average process of order q is denoted MA( q ) and defined by

where θ 1 ,

X t =

q

s =0

θ s ǫ t s

(1.4)

, θ q are fixed constants, θ 0 = 1, and { ǫ t } is a sequence of independent

(or uncorrelated) random variables with mean 0 and variance σ 2 . It is clear from the definition that this is second order stati onary and that

γ k =

0 ,

σ 2 q −|k |

s

=0

θ s θ s + k ,

3

|k | > q |k | ≤ q

We remark that two moving average processes can have the same autocorrelation function. For example,

X t = ǫ t + θǫ t 1 and X t = ǫ t + (1 ) ǫ t 1

both have ρ 1 = θ/ (1 + θ 2 ), ρ k = 0, |k | > 1. However, the first gives

ǫ t = X t θǫ t 1 = X t θ ( X t 1 θǫ t 2 ) = X t θX t 1 + θ 2 X t 2 − · · ·

This is only valid for |θ | < 1, a so-called invertible process. No two invertible processes have the same autocorrelation function.

1.6 White noise

The sequence { ǫ t } , consisting of independent (or uncorrelated) random variables with mean 0 and variance σ 2 is called white noise (for reasons that will become clear later.) It is a second order stationary series with γ 0 = σ 2 and γ k = 0, k = 0.

1.7 The turning point test

We may wish to test whether a series can be considered to be whi te noise, or whether a more complicated model is required. In later chapters we shall consider various ways to do this, for example, we might estimate the autocovariance function, say { γˆ k } , and observe whether or not γˆ k is near zero for all k > 0. However, a very simple diagnostic is the turning point test, which examines a series { X t } to test whether it is purely random. The idea is that if { X t } is purely random then three successive values are equally likely to occur in any of the six possible orders.

equally likely to occur in any of the six possible orders. In four cases there is
equally likely to occur in any of the six possible orders. In four cases there is
equally likely to occur in any of the six possible orders. In four cases there is
equally likely to occur in any of the six possible orders. In four cases there is
equally likely to occur in any of the six possible orders. In four cases there is
equally likely to occur in any of the six possible orders. In four cases there is

In four cases there is a turning point in the middle. Thus in a series of n points we might expect (2 / 3)( n 2) turning points. In fact, it can be shown that for large n , the number of turning points should be distributed as about N (2 n/ 3 , 8 n/ 45). We reject (at the 5% level) the hypothesis that the series is unsystematic if the number of turning points lies outside the range

2 n/ 3 ± 1 . 96 8 n/ 45.

4

2

Models of stationary processes

2.1 Purely indeterministic processes

Suppose { X t } is a second order stationary process, with mean 0. Its autocovariance function is

1.

2.

3.

2.2

γ k = E ( X t X t + k ) = cov( X t , X t + k ) ,

k Z .

As { X t } is stationary, γ k does not depend on t.

A process is said to be purely-indeterministic if the regression of X t on

has explanatory power tending to 0 as q → ∞ . That is, the

residual variance tends to var( X t ).

An important theorem due to Wold (1938) states that every purely- indeterministic second order stationary process { X t } can be written in the form

X t = µ + θ 0 Z t + θ 1 Z t 1 + θ 2 Z t 2 + · · ·

where { Z t } is a sequence of uncorrelated random variables.

A Gaussian process is one for which X t 1 ,

bution for all t 1 ,

autocovariance function.

, t n . No two distinct Gaussian processes have the same

, X t n has a joint normal distri-

X t q , X t q 1 ,

ARMA processes

The autoregressive moving average process, ARMA( p, q ), is defined by

p q

X t

r

=1

φ r X t r =

s

=0

θ

s ǫ t s

where again { ǫ t } is white noise. This process is stationary for appropriate φ, θ .

Example 2.1 Consider the state space model

X t = φX t 1 + ǫ t ,

Y t = X t + η t .

Suppose { X t } is unobserved, { Y t } is observed and { ǫ t } and { η t } are independent white noise sequences. Note that { X t } is AR(1). We can write

ξ t = Y t φY t 1

= ( X t + η t ) φ( X t 1 + η t 1 )

= ( X t φX t 1 ) + ( η t φη t 1 )

= ǫ t + η t φη t 1

5

Now ξ t is stationary and cov( ξ t , ξ t + k ) = 0, k 2. As such, ξ t can be modelled as a MA(1) process and { Y t } as ARMA(1 , 1).

2.3 ARIMA processes

If the original process { Y t } is not stationary, we can look at the first order difference

process

X t = Y t = Y t Y t 1

or the second order differences

X t = 2 Y t = ( Y ) t = Y t 2 Y t 1 + Y t 2

and so on. If we ever find that the differenced process is a stati onary process we can look for a ARMA model of that. The process { Y t } is said to be an autoregressive integrated moving average process, ARIMA( p, d, q ), if X t = d Y t is an ARMA( p, q ) process. AR, MA, ARMA and ARIMA processes can be used to model many time series.

A key tool in identifying a model is an estimate of the autocovariance function.

2.4 Estimation of the autocovariance function

Suppose we have data ( X 1 ,

, X T ) from a stationary time series. We can estimate

the mean by X = (1 /T ) T X t ,

¯

1

the autocovariance by c k = γˆ k = (1 /T )

the autocorrelation by r k = ρˆ k = γˆ k / γˆ 0 .

T t = k +1 ( X t

¯ ¯

X )( X t k X ),

and

The plot of r k against k is known as the correlogram. If it is known that µ is 0 there is no need to correct for the mean and γ k can be estimated by

γˆ k = (1 /T )

T t = k +1 X t X t k .

Notice that in defining γˆ k we divide by T rather than by ( T k ). When T is large relative to k it does not much matter which divisor we use. However, for mathematical simplicity and other reasons there are advantages in dividing by T . Suppose the stationary process { X t } has autocovariance function { γ k } . Then

var

T

t

=1

a t X t =

T

T

t

=1

s

=1

a t a s cov( X t , X s ) =

T

T

t

=1

s

=1

a t a s γ |t s | 0 .

, a T )

is called a nonnegative definite sequence. The following theorem states that { γ k }

is a valid autocovariance function if and only if it is nonnegative definite.

A sequence { γ k } for which this holds for every T 1 and set of constants ( a 1 ,

6

Theorem 2.2 (Blochner) The following are equivalent.

1. There exists a stationary sequence with autocovariance function { γ k } .

2. { γ k } is nonnegative definite.

3. The spectral density function,

f ( ω ) = 1

π

is positive if it exists.

k

= −∞

γ k e ikω =

1

π γ 0 + 2

π

k

=1

γ k cos( ωk ) ,

Dividing by T rather than by ( T k ) in the definition of γˆ k

ensures that { γˆ k } is nonnegative definite (and thus that it could be the autoco- variance function of a stationary process), and

can reduce the L 2 -error of r k .

2.5

Identifying a MA( q ) process

In a later lecture we consider the problem of identifying an ARMA or ARIMA model for a given time series. A key tool in doing this is the correlogram. The MA( q ) process X t has ρ k = 0 for all k , |k | > q . So a diagnostic for MA( q ) is that |r k | drops to near zero beyond some threshold.

2.6 Identifying an AR( p ) process

The AR( p ) process has ρ k decaying exponentially. This can be difficult to recognise in the correlogram. Suppose we have a process X t which we believe is AR( k ) with

X t =

k

j =1

φ j,k X t j + ǫ t

with ǫ t independent of X 1 , Given the data X 1 , tained by minimizing

, X t 1 . , X T , the least squares

estimates of ( φ 1 ,k ,

1

T

t = k +1 X t

T

k

j =1

φ j,k X t j 2

.

, φ k,k ) are ob-

This is approximately equivalent to solving equations similar to the Yule-Walker equations,

γˆ j =

k

=1

ˆ

φ ,k γˆ |j | ,

j

=

1 , .

.

. , k

These can be solved by the Levinson-Durbin recursion :

7

2

Step 0. σ := γˆ 0 ,

0

ˆ

φ 1 ,1 = γˆ 1 / γˆ 0 ,

ˆ

k := 0

Step 1. Repeat until φ k,k near 0:

k := k + 1

φ ˆ k,k := γˆ k

ˆ

ˆ

ˆ

φ j,k :=

φ j,k 1 φ k,k

k 1

j =1

ˆ

φ ˆ j,k 1 γˆ k j σ

φ k j,k 1 , for j = 1 ,

2

σ k := σ

2

k 1 (1

ˆ

φ

2

k,k )

2

k

1

, k 1

We test whether the order k fit is an improvement over the order k 1 fit by looking

ˆ

to see if φ k,k is far from zero.

ˆ

The statistic φ k,k is called the k th sample partial autocorrelation coefficient (PACF). If the process X t is genuinely AR( p ) then the population PACF, φ k,k , is

exactly zero for all k > p . Thus a diagnostic for AR( p ) is that the sample PACFs are close to zero for k > p .

2.7 Distributions of the ACF and PACF

Both the sample ACF and PACF are approximately normally distributed about

their population values, and have standard deviation of about 1 / T , where T is the length of the series. A rule of thumb it that ρ k is negligible (and similarly φ k,k ) if

r k (similarly φ k,k ) lies between ±2 / T . (2 is an approximation to 1.96. Recall that

if Z 1 ,

, Z n N ( µ, 1), a test of size 0 . 05 of the hypothesis H 0 : µ = 0 against

ˆ

¯

H 1 : µ = 0 rejects H 0 if and only if Z lies outside ±1 . 96 / n ).

Care is needed in applying this rule of thumb.

It is important to realize

., (and sample partial autocorrelations,

.) are not independently distributed. The probability that any one r k

that the sample autocorrelations, r 1 , r 2 ,

ˆ

ˆ

φ 1 ,1 , φ 2 ,2 ,

should lie outside ±2 / T depends on the values of the other r k . A ‘portmanteau’ test of white noise (due to Box & Pierce and Ljung & Box) can be based on the fact that approximately

Q m = T ( T + 2)

m

k =1

( T k ) 1 r k χ

2

2

m .

The sensitivity of the test to departure from white noise dep ends on the choice of m. If the true model is ARMA( p, q ) then greatest power is obtained (rejection of the white noise hypothesis is most probable) when m is about p + q .

8

3

Spectral methods

3.1 The discrete Fourier transform

If h( t) is defined for integers t, the discrete Fourier transform of h is

H ( ω ) =

t = −∞

h( t) e iωt ,

π ω π

The inverse transform is

h( t) =

π

2 π

1

π

e iωt H ( ω ) dω .

If h( t) is real-valued, and an even function such that h( t) = h( t), then

and

H ( ω ) = h(0) + 2

t =1

h( t) cos( ωt)

h( t) =