• Aucun résultat trouvé

Time Series Analysis: TD4.

N/A
N/A
Protected

Academic year: 2022

Partager "Time Series Analysis: TD4."

Copied!
2
0
0

Texte intégral

(1)

Time Series Analysis: TD4.

Olivier Wintenberger: olivier.wintenberger@upmc.fr

Exercise 1. Consider (Zt) WN(σ2) and the AR(p) model (φp 6= 0) Xt1Xt−12Xt−2+· · ·+φpXt−p+Zt, t∈Z. 1. Discuss the existence of a causal solutionXt=P

j≥0ψjZt−j withP

j≥0ψj2<∞.

2. Denote Xt = (Xt, . . . , Xt−p+1)> ∈ Rp and show that (Xt) is an homogeneous Markov chain of the formXt=AXt−1+Zt,t≥0. Identify A andZt.

3. Show that zpφ(z−1) with φ(z) = 1−φ1z− · · · −φpzp is the characteristic polynomial ofA.

4. Deduce that the largest eigenvalueρ(A) of A has modulus smaller than 1 if and only if the roots ofφare outside the unit disc.

5. Show that

Xt=X

j≥0

AjZt−j, t∈Z,

and that the series is normally convergent inL2.

6. Deduce an algorithm to compute the coefficients ψj using the A and check that they decrease exponentially fast.

Exercise 2. We have the following theorem

Theorem 1 (Hannan). If (Xt) satisfies an ARMA(p, q) model φ(L)Xt = γ(L)Zt with θ = (φ1, . . . , φp, γ1, . . . , γq)> ∈ C and (Zt) SWN(σ2), σ2 > 0, then the QMLE is asymptotically

normal √

n(ˆθn−θ0)−d.→ Np+q 0,Var(ARp, . . . , AR1, M Aq, . . . , M A1)−1 where (ARt) and(M At) are the stationary AR(p) and AR(q) satisfying

φ(L)ARtt, γ(L)M Att, t∈Z, with the same SWN(1) (ηt).

Let us consider the ARMA(1,1) model

Xt=φXt−1+Zt+γZt−1, withθ= (φ, γ)>.

1

(2)

1. Determine the causal representation of the time series (ARt) and (M At) under the appropriate condition on θ.

2. Compute the matrix of variance-covariance Var(AR1, M A1).

3. Determine the assumption for inverting the matrix and interpret it.

4. Invert the matrix.

5. Deduce a consistent estimator of the asymptotic variance by plugging in the QMLE ˆθn. 6. Deduce a confidence region of asymptotic level 1−α for the coefficientθ.

2

Références

Documents relatifs

For a probabilistic study of these fast variants, a precise description of the evolution of the distribution during the execution of the plain Euclid Algorithm is of crucial

In this work, we will examine some already existing algorithms and will present a Two-Phase Algorithm that will combine a novel search algorithm, termed the Density Search Algorithm

We view such a fast algorithm as a sequence of what we call interrupted algorithms, and we obtain two main results about the (plain) Euclid Algorithm which are of independent

In this study, “the ankle pressure change after exercise ranged from -27 mmHg to +35 mmHg, 95 per cent of the post-exercise results were between -25 mmHg et +22 mmHg.” 4

Figure 8 details, for cases E and F, the distribution of LH pulse amplitudes (left panels) and successive LH levels at the basal line (right panels) both for the

As said in the introduction of their paper, [24, Algorithm 1] is “a suitable adapta- tion of the half-gcd algorithm”: a call to their algorithm uses polynomial multiplication

For each method, we obtain formulas that provide bounds on the total number of vector additions in F k b required to perform any of the following three computations, given a vector S

[r]