Monitoring procedure for parameter change in causal time series

Size: px
Start display at page:

Download "Monitoring procedure for parameter change in causal time series"

Transcription

1 Moitorig procedure for parameter chage i causal time series Jea-Marc Bardet, William Chakry Kege To cite this versio: Jea-Marc Bardet, William Chakry Kege. Moitorig procedure for parameter chage i causal time series. 22. <hal-7342v> HAL Id: hal Submitted o 2 Sep 22 (v), last revised 2 Ja 23 (v2) HAL is a multi-discipliary ope access archive for the deposit ad dissemiatio of scietific research documets, whether they are published or ot. The documets may come from teachig ad research istitutios i Frace or abroad, or from public or private research ceters. L archive ouverte pluridiscipliaire HAL, est destiée au dépôt et à la diffusio de documets scietifiques de iveau recherche, publiés ou o, émaat des établissemets d eseigemet et de recherche fraçais ou étragers, des laboratoires publics ou privés.

2 Moitorig procedure for parameter chage i causal time series Jea-Marc BARDET ad William KENGNE September 2, 22 SAMM, Uiversité Paris Pathéo-Sorboe, 9 rue de Tolbiac Paris Cedex 3, Frace. Jea-Marc.Bardet@uiv-paris.fr ; William-Charky.Kege@malix.uiv-paris.fr Abstract : We propose a ew sequetial procedure to detect chage i the parameters of a process X = (X t ) t Z belogig to a large class of causal models (such as AR( ), ARCH( ), TARCH( ), ARMA-GARCH processes). The procedure is based o a differece betwee the historical parameter estimator ad the updated parameter estimator, where both these estimators are based o the quasi-likelihood of the model. Ulike classical recursive fluctuatio test, the updated estimator is computed without the historical observatios. The asymptotic behavior of the test is studied ad the cosistecy i power as well as a upper boud of the detectio delay are obtaied. Some simulatio results are reported with comparisos to some other existig procedures exhibitig the accuracy of our ew procedure. The procedure is also applied to the daily closig values of the Nikkei 225, S&P 5 ad FTSE stock idex. We show i this real-data applicatios how the procedure ca be used to solve off-lie multiple breaks detectio. Keywords: Sequetial chage detectio; Chage-poit; Causal processes; Quasi-imum likelihood estimator; Weak covergece. Itroductio I statistical iferece, may authors have poited out the dager of omittig the existece of chages i the data. May papers have bee devoted to the problem of test for parameter chages i time series models whe all data are available, see for istace Horváth [5], Icla ad Tiao [7], Kokoszka ad Leipus [2], Kim et al. [9], Aue et al. [4], Bardet et al. [5], Kege [8]. These papers cosider retrospective (off-lie) chages i.e. chages i parameters whe all data are available. Aother poit of view is the chage detectio whe ew data arrive; this is sequetial chage-poit problem. A importat turig o this topic was made i 996 with the paper of Chu et al.. They cosidered the sequetial chage i regressio model ad poited out the effects of repeatig retrospective test everytime whe ew dataare observed; this ca icreasethe probability oftype errorofthe test. They successfully applied a fluctuatio test to solve the sequetial chage-poit problem. Two procedures are developed based o cumulative sum (CUSUM) of residuals ad recursive parameter fluctuatios. Their idea has bee geeralized ad several procedures are ow based o this approach. Leisch et al. [23] itroduced the geeralized fluctuatio test based o the recursive movig estimator which cotais the test of Chu et al. [2] as a special case. Horváth et al. [6] itroduced residual CUSUM moitorig procedure where the recursive parameter is based o the historical data. This procedure has bee geeralized by Aue et al. [2] to the class of liear model with depedet errors. Berkes et al. [6] cosidered sequetial chages i the parameters of GARCH process. Accordig to the fact that the fuctioal limit theorem assumed by Chu et al. [2] is ot satisfied by the squares of residuals of GARCH process, they developed a procedure based o quasi-likelihood scores. Na et al. [25] developed a moitorig procedure for Supported by Uiversité Paris ad AUF (Agece Uiversitaire de la Fracophoie).

3 2 the detectio of parameter chages i geeral time series models. They show that uder the ull hypothesis of o chage, their detector statistic coverges weakly to a kow distributio. However, the asymptotic behavior of this detector is ukow uder the alterative of parameter chages. I this ew cotributio, we cosider a large class of causal time series ad ivestigate the asymptotic behavior uder the ull hypothesis of o chage but also uder the alterative hypothesis of chage. More precisely, let M,f : IR IN IR be measurable fuctios, (ξ t ) t Z be a sequece of cetered idepedet ad idetically distributed (iid) radom variables satisfyig var(ξ ) = σ 2 ad let Θ be a fixed compact subset of IR d. Let T Z, ad for ay θ Θ, defie Class M T (M θ,f θ ): The process X = (X t ) t Z belogs to M T (M θ,f θ ) if it satisfies the relatio: X t+ = M θ ( (Xt i ) i IN ) ξt +f θ ( (Xt i ) i IN ) for all t T. () The existece ad properties of this geeral class of causal ad affie processes were studied i Bardet ad Witeberger [4]. Numerous classical time series (such as AR( ), ARCH( ), TARCH( ), ARMA-GARCH or biliear processes) are icluded i M Z (M,f). The off-lie chage detectio for such a class of models has already bee studied i Bardet et al. [5] ad Kege [8]. Suppose ow that we have observed X,,X which are available historical data. We assume that the historical data depeds o oe parameter i.e. there exists θ Θ such as (X,,X ) belogs to M {,,} (M θ,f θ ). The, we observe ew data X +,X +2,X k, : the moitorig starts. For each ew observatio, we would like to kow if a chage occurs i the parameter θ. More precisely, we cosider the followig test : H : θ is costat over the observatio X,,X,X +, i.e. the observatios X,,X,X +, belog to M IN (M θ,f θ ); H : there exist k >, θ Θ such that X,,X,X +,,X k,x k +, belogs to M {,,k }(M θ,f θ ) M {k +, }(M θ,f θ ). Whe ew data arrive, Chu et al. [2] proposed to compute a estimator of the parameter based o all the observatios ad to compare it to a estimator based o historical data. A large distace betwee both these estimators meas that ew data come from a model with differet parameters. The the ull hypothesis H is rejected ad the moitorig stops; otherwise, the moitorig cotiues. I their procedure, Leisch et al. [23] suggested to compute the recursive estimators o a movig widow with a fixed width. They fixed a moitorig horizo so that, the procedure will stop after a fixed umber of steps eve if o chage is detected. As Chu et al. [2], the recursive estimators computed by Na et al. [25] are based o all the observatios. As we will see i the ext sectios, their procedure caot be effective i terms of detectio delay or if a small chage i the parameter occurs. For ay k, l,l {,,k} (with l l ) let θ(x l,,x l ) be the quasi-imum likelihood estimator (QMLE i the sequel) of the parameter computed o {l,,l } (see its defiitio i (6)). Whe ew data arrive at time k, we explore the segmet {l,l+,,k} with l { v, v + k v } (where (v ) IN is a fixed sequece of iteger umbers) that the distace betwee θ(x l,,x k ) ad θ(x,,x ) is the largest. If the orm θ(x l,,x k ) θ(x,,x ) is greater tha a suitable critical value, the H is rejected ad the moitorig stops; otherwise, the moitorig cotiues. More precisely, we costruct a detector that takes ito accout the distace betwee θ(x l,,x k ) ad θ(x,,x ). It is show that this detector is almost surely fiite uder the ull hypothesis ad almost surely diverges to ifiity uder the alterative. Hece, the cosistecy of our procedure follows. Simulatios results compared to the procedure of Horváth et al. [6] (see also Aue et al. [2]) ad Na et al. [25] show that our procedure outperforms i terms of test power ad detectio delay.

4 3 I the forthcomig Sectio 2 the assumptios ad the defiitio of the quasi-likelihood estimator are provided. I Sectio 3 we preset the moitorig procedure ad the asymptotic results. Sectio 4 is devoted to a simulatio study for AR() ad GARCH(,) processes. I Sectio 5 we apply our procedure to Nikkei 225, S&P 5 ad FTSE stock idex. After coclusios i Sectio 6, the proofs of the mai results are provided i Sectio 7. 2 Assumptios ad defiitio of the quasi-likelihood estimator 2. Assumptios o the class of models M Z (f θ,m θ ) Let θ IR d ad M θ ad f θ be umerical fuctios such that for all (x i ) i IN IR IN, M θ ( (xi ) i IN ) ad ( ) f θ (xi ) i IN IR. Deote hθ := Mθ 2. We will use the followig classical otatios:. applied to a vector deotes the Euclidea orm of the vector; 2. for ay compact set K IR d ad for ay g : K IR d, g K = θ K ( g(θ) ); 3. for ay set K IR d, K deotes the iterior of K. Throughout the sequel, we will assume that the fuctios θ M θ ad θ f θ are twice cotiuously differetiable o Θ. Let Ψ θ = f θ, M θ ad i =,, 2, the for ay compact set K Θ defie Assumptio A i (Ψ θ,k): Assume that i Ψ θ ()/ θ i Θ < ad there exists a sequece of o-egative real umbers (α (i) j (Ψ θ,k)) j such that α (i) j (Ψ θ, ) < ad i Ψ θ (x) θ i j= i Ψ θ (y) K θ i j= α (i) j (Ψ θ,k) x j y j for all x,y IR IN. I the sequel we refer to the particular case called ARCH-type process if f θ = ad if the followig assumptio holds with h θ = M 2 θ : Assumptio A i (h θ,k): Assume that i h θ ()/ θ i Θ < ad there exists a sequece of o-egative real umbers (α (i) j (h θ,k)) j such as α (i) j (h θ,k) < ad j= i h θ (x) θ i i h θ (y) K θ i j= α (i) j (h θ,k) x 2 j y 2 j for all x,y IR IN. The Lipschitz-type hypothesis A i (Ψ θ,k) are classical whe studyig the existece of solutios of the geeral model (see for istace [3]). Usig a result of [4], for each model M Z (M θ,f θ ) it is iterestig to defie the followig set: Θ(r) := { θ Θ, A (f θ,{θ}) ada (M θ,{θ})hold with α () j (f θ,{θ})+(e ξ r ) /r } α () j (M θ,{θ}) < j j { θ Θ, f θ = ad A (h θ,{θ})holds with(e ξ r ) 2/r } α () j (h θ,{θ}) <. j The, if θ Θ(r) the existece of a uique causal, statioary ad ergodic solutio X = (X t ) t Z M Z (f θ,m θ ) is esured (see more details i [4]). The subset Θ(r) is defied as a reuio to cosider accurately geeral causal models ad ARCH-type models simultaeously. Here there are assumptios required for studyig QMLE asymptotic properties: Assumptio D(Θ): h > such that if θ Θ ( h θ(x) ) h for all x IR IN.

5 4 Assumptio Id(Θ): For all (θ,θ ) Θ 2, ( ) f θ (X,X, ) = f θ (X,X, ) ad h θ (X,X, ) = h θ (X,X, ) a.s. θ = θ. AssumptioVar(Θ): Forallθ Θ,oeofthefamilies ( f θ θ i(x,x, ) ) i d is a.s. liearly idepedet. or ( h θ θ i (X,X, ) ) i d Assumptio K(f θ,m θ,θ): for i=,, 2, A i (f θ,θ) ad A i (M θ,θ) (or A i (h θ,θ)) hold ad there exists l > 2 such that α (i) j (f θ,θ)+α (i) j (M θ,θ)+α (i) j (h θ,θ) = O(j l ) for j IN. Note that i this last assumptio, as i [4], we use the covetio that if A i (M θ,θ) holds the α (i) l (h θ,θ) = ad if A i (h θ,θ) holds the α (i) l (M θ,θ) =. 2.2 Two first examples. ARMA(p, q) processes. Cosider the ARMA(p, q) process defied by: X t + p a i X t i = i= q b j ξ t j, t Z (2) with b, θ = (a,,a p,b,,b q) Θ IR p+q+ ad (ξ t ) a white oise such as E(ξ 2 ) =. Whe q j= b j Xj ad + p i= a i Xi for all X, this process ca be also writte as: X t = b ξ t + j= φ j (θ )X t i, t Z j= where θ Θ φ j (θ) are fuctios oly depedig o θ ad decreasig expoetially fast to (j ). The process (2) belogs to the class M Z (M θ,f θ ) where f θ (x, ) = j φ j(θ)x j ad M θ b for all θ Θ. The Assumptios D(Θ), A (f θ,θ), A (M θ,θ) hold with h = b > ad α() j (f θ,θ) = φ j (θ) Θ while α () j (M θ,θ) = for j IN. Assumptio K(f θ,m θ,θ) holds sice there exists c > ad C > such as φ j Ce cj for j IN. Moreover, if (ξ t ) is a sequece of o-degeerate radom variables (i.e. ξ t are ot equal to a costat), Assumptios Id(Θ) ad Var(Θ) hold. Fially, for ay r such that E ξ r <, the Θ(r) = {θ IR p+q+, φ j (θ) < }. Note that if θ Θ(r) with r the the previous coditios of statioarity q j= b jx j ad + p i= a ix i for all X are satisfied. j 2. GARCH(p, q) processes. Cosider the GARCH(p, q) process defied by: p q X t = σ t ξ t, σt 2 = α + α j X2 t j + βj σ2 t j, t Z (3) j= with E(ξ 2) = ad θ := (α,,α p,β,,β q ) Θ where Θ is a compact subset of ], [ [, [p+q such that p j= α j + q j= β j < for all θ Θ. The there exists (see Bollerslev [] or Nelso ad Cao [26]) a oegative sequece (ψ j (θ)) j such that σt 2 = ψ (θ)+ j ψ j(θ)x t j 2 with ψ (θ) = α /( q j= β j ). This process belogs to the class M Z (M θ,f θ ) where f θ ad M θ (x, ) = ψ (θ)+ j ψ j(θ)x 2 j for all θ Θ. Assumptio D(Θ) holds with h = if θ Θ (ψ (θ)) >. If there exists < ρ < such that for ay j=

6 5 q θ Θ, j= α j + p j= β j ρ the the sequeces ( ψ j (θ) Θ ) j, ( ψ j (θ) Θ) j ad ( ψ j (θ) Θ) j decay expoetially fast (see Berkes et al. [7]) ad Assumptio K(f θ,m θ,θ) holds. Moreover, (ξt) 2 is a sequece of o-degeerate radom variables (i.e. ξt 2 are ot equal to a costat), Assumptios Id(Θ) ad Var(Θ) hold. Fially for r 2 we obtai Θ(r) = { θ Θ ; (E ξ r ) 2/r φ j (θ) < }. 2.3 The quasi-imum likelihood estimator Let k 2, if (X,,X k ) M {,,k} (M θ,f θ ), the for T {,,k}, the coditioal quasi-(log)likelihood computed o T is give by: L(T,θ) := 2 t T j= q t (θ) with q t (θ) = (X t f t θ )2 h t θ +log(h t θ ) (4) where f t θ = f θ( Xt,X t 2... ), M t θ = M θ( Xt,X t 2... ) ad h t θ = Mt θ2. The classical approximatio of this coditioal log-likelihood is give by: L(T,θ) := ( Xt q t (θ) where q t (θ) := f t 2 θ) 2 t T ĥ t θ +log ( ĥ t ) θ with f t θ = f θ( Xt,...,X,,, ), M t θ = M θ( Xt,...,X,,, ) ad ĥt θ = ( M t θ )2. For T {,,k}, defie the quasi imum-likelihood estimator (QMLE) of θ computed o T by (5) θ(t) := arg( L(T,θ)). (6) θ Θ IBardetadWiteberger[4]itwasestablishedthatif(X,,X )isaobservedtrajectoryofx M Z (f θ,m θ ) with θ Θ(4) ad if Θ is a compact set such as Assumptios A i (f θ,m θ,θ) (or A i (h θ,θ)) hold for i =,,2 ad uder Assumptios D(Θ), Id(Θ), Var(Θ), K(f θ,m θ,θ), the ( θ(t, ) θ ) D N (, F G F ), (7) with [ q (θ G := E ) q (θ ) ] [ 2 q (θ ad F := E ) ] θ θ θ θ, (8) where deotes the traspose ad with q defied i (4). Note that uder assumptios D(Θ) ad Var(Θ), G is symmetric positive defiite (see [8]) ad F is o-sigular (see [4]). Also defie the matrix Ĝ(T) := Card(T) ( qt ( θ(t)) )( qt ( θ(t)) θ θ t T ) 2 ( 2 Lm (T, θ(t)) ) ad F(T) := Card(T) θ θ. (9) Uder the previous assumptios, Ĝ(T,) ad F(T, ) coverge almost surely to G ad F respectively. Hece, Ĝ(T, ) /2 F(T, ) ( θ(t, ) θ ) D N (, I d ) with I d the idetity matrix. This result will be the startig poit of the followig moitorig procedure. () 3 The moitorig procedure ad asymptotic results 3. The moitorig procedure Ithesequel,(X,,X )isposedtobethehistoricalavailableobservatiosbelogigtotheclassm {,,} (f θ,m θ ). For l l, deote T l,l := {l,l+,,l }.

7 6 At a moitorig istat k, our idea is to evaluate the differece betwee θ(t l,k ) ad θ(t, ) for ay l =,,k. More precisely, from (), for ay k > defie the statistic (called the detector) Ĉ k,l := k l k Ĝ(T, ) /2 F(T, ) ( θ(tl,k ) θ(t, ) ) for l =,,k. Sice the matrix Ĝ(T,) is asymptotically symmetric ad positive defiite (see [8]), Ĝ(T,) /2 exists for large eough ad Ĉk,l is well defied. At the begiig of the moitorig ad whe l is close to k, the legth of T l,k is too small, therefore the umerical algorithm used to compute θ(t l,k ) caot coverge. This ca itroduce a large distortio i the procedure. To avoid this, we itroduce a sequece of iteger umbers (v ) IN with v << ad compute Ĉk,l for l { v, v +,,k v }. Thus, for ay k > deote For techical reasos, assume that, Π,k := { v, v +,,k v }. v ad v / ( ). Accordig to Remark of [8], we ca choose v = [(log) δ ] with δ >. Note that, if chage does ot occur at time k >, for ay l Π,k, the two estimators θ(t l,k ) ad θ(t, ) are close ad the detector Ĉk,l is ot large eough. Hece, the moitorig stops ad reject H at the first time k > where there exists l Π,k satisfyig Ĉk,l > c for a fixed costat c >. To be more geeral, we will use a b : (, ) (, ), called a boudary fuctio satisfyig: Assumptio B: b : (, ) (, ) is a o-icreasig ad cotiuous fuctio such as If b(t) >. <t< The the moitorig procedure stops at the first time k > such as there exists l Π,k satisfyig Ĉk,l > b((k l)/). Hece defie the stoppig time: Therefore, we have τ() := If{k > / l Π,k, Ĉ k,l > b((k l)/)} = If { k > / { P{τ() < } = P Ĉ } k,l l Π,k b((k l)/) > for some k > { = P k> l Π,k The challege is to choose a suitable boudary fuctio b( ) such as for some give α (,) ad lim P H {τ() < } = α lim P H {τ() < } = where the hypothesis H ad H are specified i Sectio. Ĉ k,l b((k l)/) > }. Ĉ } k,l l Π,k b((k l)/) >. () I the case where b( ) is a costat positive value, b c with c >, these coditios lead to compute a threshold c = c α depedig o α. If chage is detected uder H i.e. τ() < ad τ() > k, the the detectio delay is defied by d = τ() k. Usig the previous otatios, Na et al. [25] used the followig detector D k := Ĝ(T, ) /2 F(T, ) ( θ(t,k ) θ(t, ) ). At the step k of the moitorig, their recursive estimator is based o X,,X,,X k. Oe ca see that this estimator is highly iflueced by the historical data. Assume that a chage occurs at time k k, i the sequel of

8 7 the procedure, the recursiveestimator cotets the observatiosx,,x,,x k which depeds o θ. The, oe must wait loger before the differece betwee θ(x,,x ) ad θ(x,,x,,x k ) becomes sigificat at a step k > k. Therefore, their procedure caot be effective i terms of detectio delay. Moreover, if teds to ifiity, it is ot almost sure that this chage will be detected. These are cofirmed by the results of simulatios (see Sectio 4). Berkes et al. (24) cosidered a estimator based o historical data to compute the quasi-likelihood scores. They used the fact that the partialderivatives applied to a vectoruis equal to if ad oly if u is the true parameter of the model. So, whe chage occurs, their detector growths asymptotically to ifiity. Therefore, their procedure is cosistet. They proved this result for GARCH(p,q) models. 3.2 Asymptotic behaviour uder the ull hypothesis Uder H, the parameter θ does ot chage over the ew observatios. Thus we have the result Theorem 3. Assume D(Θ), Id(Θ), Var(Θ), K(f θ,m θ,θ), B ad θ Θ(4). Uder the ull hypothesis H, the { lim P{τ() < } = P where W d is a d-dimesioal stadard Browia motio. t> <s<t W d (s) sw d ()) t b(s) I the simulatios, we will use the most atural boudary fuctio b( ) = c with c a positive costat sice it satisfies the above assumptios imposed to b( ). I such case, the forthcomig corollary idicates that the asymptotic distributio of Theorem 3. ca be easily computed: } > Corollary 3. Assume b(t) = c > for t. Uder the assumptios of Theorem 3., { lim P{τ() < } = P t> <s<t where U d = <u< f(u) W d (u) with f(u) = } t W d(s) sw d ()) > c = P{U d > c} 9 u+ u ( 9 u+3 u Remark 3. By the law of the iterated logarithm, it comes that <s<t t W d(s) sw d ()) a.s. W d()). t 2 3 u+ (9 u)( u) So, the two distributios <s<t t W d(s) sw d ()) as t (resp. t ) ad f(u) W d (u) as u (resp. u ) are equal. It is easy to show (see proof of Corollary 3.) that t> <s<t t W d(s) sw d ()) D = <u< f(u) W d (u). Therefore, at a omial level α (,), take c = c(α) be the ( α)-quatile of the distributio of U d = <u< f(u) W d (u) which ca be computed through Mote-Carlo simulatios. Table shows the ( α)- quatile of this distributio for α =.,.5,. ad d =,,5. d = d = 2 d = 3 d = 4 d = 5 α = α = α = Table : Empirical ( α)-quatile of the distributio of U d, for d =,,5. ) /2.

9 8 3.3 Asymptotic behaviour uder the alterative hypothesis Uder the alterative H, the parameter chages from θ to θ at k >, where θ Θ ad θ θ. The Theorem 3.2 Assume D(Θ), Id(Θ),Var(Θ), K(f θ,m θ,θ) ad B. Uder the alterative H, if θ θ ad θ,θ Θ(4) the for k = k () such as lim k ()/ < ad k = k ()+ δ with δ (/2,), l Π,k Ĉ k,l b((k l)/) a.s. The forthcomig Corollary 3.2 ca be immediately deduced from the relatio (). Corollary 3.2 Uder assumptios of Theorem 3.2, lim P{τ() < } =. Remark 3.2 We kow that the moitorig is stopped ad rejects H at the first time k where. l Π,k Ĉ k,l b((k l)/) >. Therefore, it follows from Theorem 3.2 that uder the hypothesis H, the detectio delay d of the procedure ca be bouded by O P ( /2+ε ) for ay ε > (or eve by O P ( (log) a ) with a > usig the same kid of proof). 3.4 Examples 3.4. AR( ) processes Cosider the geeralizatio of ARMA(p, q) processes defied i (2) i.e. a AR( ) processes defied by: X t = φ (θ)+ j (θ)x j φ t j +ξ t, t Z (2) with θ Θ, where we ca chose Θ as a compact subset of Θ(4) IR d where Θ(4) = { θ IR d ; φ j (θ) < }. This process belogs to the class M Z (M θ,f θ ) where f θ (x, ) = j φ j(θ)x j ad M θ φ (θ) for all θ Θ ad therefore α () j (f θ,θ) = φ j (θ) Θ ad α () j (M θ,θ) = for j IN. The Assumptio D(Θ) holds if h = if θ Θ ( φ (θ) ) > ; j Assumptio K(f θ,m θ,θ) holds if there exists l > 2 ad ad if θ φ j (θ) are twice differetiable fuctios satisfyig ( ψ j (θ) Θ, φ j (θ) Θ, φ j (θ) Θ) = O(j l ) for j IN. if (ξ t ) is a sequece of o-degeerate radom variables (i.e. ξ t are ot equal to a costat), Assumptios Id(Θ) ad Var(Θ) hold. Case of AR(p) process Assume that p X t = φ + φ jx t j +ξ t with p IN. j= The true parameter of the model is deoted by θ = (φ,φ,,φ p ) Θ where Θ = {θ = (φ,φ,,φ p ) IR p+ / p φ j < }. The, Θ(r) = Θ for ay r. Assume that a trajectory (X,,X k ) has bee observed, j=

10 9 for ay t =,,k ad θ Θ we have, q t (θ) = ( X t φ p ) 2, q t (θ) φ j X t j = 2 ( X t φ p ) φ j X t j j= θ j= 2 q t (θ) 2 q t (θ) (,X t,x t 2,,X t p ). Moreover, = 2, for j =,,p, = 2X t j ad for i,j p, φ φ φ φ j 2 q t (θ) = 2X t i X t j. φ i φ j ARCH( ) processes Cosider the geeralizatio GARCH(p, q) processes defied i (3) i.e. a ARCH( ) processes defied by: X t = σ t ξ t ad σt 2 = ψ (θ )+ ψ j (θ )X2 t j, t Z (3) j= with θ Θ, where we ca chose Θ as a compact subset of Θ(4) IR d where Θ(4) = { θ IR d ; (E ξ 4 ) /2 φ j (θ) < }. Thisprocess,itroducedbyRobiso[28], belogstotheclassm Z (f θ,m θ,)wheref θ (x, ) admθ 2(x, ) = ψ (θ) + j ψ j(θ)x 2 j for all θ Θ ad therefore α() j (f θ,θ) = ad α () j (h θ,θ) = φ j (θ) Θ for j IN (X is of course a ARCH-type process). The Assumptio D(Θ) holds if h = if θ Θ (ψ (θ)) > ; Assumptio K(f θ,m θ,θ) holds if there exists l > 2 ad ad if θ φ j (θ) are twice differetiable fuctios satisfyig ( ψ j (θ) Θ, ψ j (θ) Θ, ψ j (θ) Θ) = O(j l ) for j IN. if (ξ 2 t) is a sequece of o-degeerate radom variables (i.e. ξ 2 t are ot equal to a costat), Assumptios Id(Θ) ad Var(Θ) hold. j= Case of GARCH(, ) process Assume that X t = σ t ξ t with σ 2 t = α +α X 2 t +β σ 2 t with θ = (α,α,β) Θ ], [ [, [ 2 ad satisfyig α + β <. The ARCH( ) represetatio is σt 2 = α /( β )+α (β )j Xt j 2. If a trajectory (X,,X k ) has bee observed, for ay t =,,k ad θ Θ we have, j Thus, it follows that q t(θ) θ ĥ t θ = α /( β )+α X 2 t +α = ĥ t θ ( )( X2 t ĥ t θ ĥ t θ t t j=2 ), ĥt θ, ĥt θ α α β ad ĥt θ = α /( β ) 2 +α Xt 2 2 +α (j )β j 2 Xt k 2 β. j=3 Let θ = (α,α,β ) = (θ,θ 2,θ 3 ) Θ, for i,j 3, we have with ĥt θ β 2 2ĥt θ α 2 =, 2ĥt θ α α =, 2 q t (θ) = ( 2X 2 t θ i θ j (ĥt θ )2 ĥ t θ 2ĥt θ α 2 = 2α /( β ) 3 +2α X 2 t 3 +α =, β j X 2 t j ad q t (θ) = X 2 t / ĥt θ +log(ĥt θ ). with ĥt θ α = X 2 t + t j=2 ĥ ) t θ ĥt θ + ( ) X2 t 2 ĥ t θ θ i θ j ĥ t θ ĥ t θ θ i θ j 2ĥt θ = Xt 2 2 α β + t t (j )(j 2)β j 3 Xt j 2. j=4 j=3 β j X 2 t j ĥt θ α = /( β ), (j )β j 2 Xt j 2, 2ĥt θ = /( β ) 2 ad α β

11 3.4.3 TARCH( ) processes The process X is called Threshold ARCH( ) (TARCH( ) i the sequel) if it satisfies X t = σ t ξ t ad σ t = b (θ )+ [ ] b + j (θ )(X t j,) b j (θ )mi(x t j,), t Z (4) j= where the parameters b (θ), b + j (θ) ad b j (θ) are assumed to be o egative real umbers ad θ Θ where Θ is a compact subset of Θ(4) where Θ(4) = {θ / IR d ( E ξ 4) /4 ( } b j (θ),b+ j (θ)) < sice α () j (M,{θ}) = ( b j (θ),b+ j (θ)). This class of processes is a geeralizatio of the class of TGARCH(p,q) processes (itroduced by Rabemaajara ad Zakoïa [27]). The, Assumptio D(Θ) holds if h = if θ Θ b (θ) > ; AssumptioK(f θ,m θ,θ)holdsifthereexistsl > 2adadifθ b j (θ) adθ b+ j (θ) aretwicedifferetiable fuctios satisfyig j= ( b j (θ) Θ, b + j (θ) Θ, θ b j (θ) Θ, θ b+ j (θ) Θ, 2 θ 2b j (θ) Θ, 2 θ 2b+ j (θ) ) Θ = O(j l ) for j IN. Ufortuately, for TARCH( ) it is ot possible to provide simple coditios for obtaiig Assumptios Id(Θ) ad Var(Θ) as for AR( ) or ARCH( ) processes. 4 Some simulatio ad umerical experimets First remark that, at a time k >, we eed to compute Ĉk,l for all l Π,k to test whether chage occurs or ot. O ca see that, the computatioal time is very log ad icreases with k. To reduce it, we itroduce a iteger sequece (u ) (satisfyig u / as ; typically u = [l()]) ad compute Ĉk,l oly for l Π,k := { v, v +u, v +2u,,k v }. We have Π,k Π,k ad for ay t = l with l Π,k, we ca fid a iteger j l such that v + j l u Π,k ad v +j l u l v +(j l +)u. This implies that v+j lu t v+j lu + u. Thus, we have asymptotically (as ), t v+j lu. It shows that the previous asymptotic results still hold by computig Ĉ k,l for l Π,k. The coditio u / esures that the Theorem 3.2 still holds by choosig k = k ()+ δ with δ (/2,). I practice, the use of Π,k ca itroduce a distortio i the detectio delay. But, the ew detectio delay must be betwee d ad d +u (where d is the detectio delay obtaied by usig Π,k ). I the sequel, we use u = [l()]. Moreover, if b c > is a costat fuctio, accordig to (), we have { P{τ() < } = P Thus, deote k> Ĉ k,l > c l Π,k Ĉ k = Ĉ k,l for ay k >. l Π,k }. (5) The procedure is moitored from k = + to k = +5. The set {+,,+5} is called moitorig period. Accordig to the Remark of [8], v = [(log) δ ] (with δ 3) is chose. We evaluated the performace of the procedure with v = [log], [(log) 3/2 ], [(log) 2 ], [(log) 3 ] ad we recommed to use v = [(log) 3/2 ] for liear model ad v = [(log) 2 ] for ARCH-type model. The omial level used i the sequel is α =.5.

12 a ) C k for GARCH(,) without chage b ) C k for GARCH(,) with oe chage at k*= k k Figure : Typical realizatio of the statistics Ĉk for = 5 ad k = 5,,. a-) The parameter θ = (.,.3,.2) is costat ; b-) the parameter θ = (.,.3,.2) chages to θ = (.5,.5,.2) at k = 75. The horizotal solid lie represets the limit of the critical regio, the vertical dotted lie idicates where the chage occurs ad the vertical solid lie idicates the time where the moitorig procedure detectig the chage. 4. A illustratio We cosider GARCH(,) process : X t = σ t ξ t with σt 2 = α +α X2 t +β σ2 t. Thus, the parameter of model is θ = (α,α,β ). The historical available data are X,,X 5 (therefore = 5) ad the moitorig period is {5,,}. At the omial level α =.5, the critical values of the procedure is C α = The Figure is a typical realizatio of the statistic (Ĉk) 5<k. We cosider a sceario without chage (Figure a-)) ad a sceario with chage at k = +25 = 75 (Figure b-)). Figure a-) shows that, the detector Ĉk is bellow uder the horizotal lie which represets the limit of the critical regio. O Figure b-) we ca see that, before chage occurs, Ĉk is bellow uder the horizotal lie ad icreases with a high speed after chage. Such growth over a log period idicates that somethig happeig i the model. 4.2 Moitorig mea shift i times series Let (X,,X ) be a (historical) observatio of a process X = (X t ) t Z. We assume that X satisfy { Xt = µ +ǫ t for t k X t = µ +ǫ t for t > k with k >, µ µ ad (ǫ t ) a zero mea statioary time series belogs to a class M Z (f θ,m θ ). Uder H, k =. The moitorig procedure start at k = + ad the aim is to test mea shift over the ew observatio X +,X +2,. This problem ca be see as moitorig chages i liear model (see Horváth et al. [6], Aue et al. [2]) with costat regressor. The empirical mea X = i= X i

13 2 is a cosistet estimator of µ. The recursive residual is defied by ǫ k = X k X ; for k >. Horváth et al. [6] ad Aue et al. [2] proposed the detector Q k = σ c ( k )( k )γ k i=+ where σ 2 is a cosistet estimator of the log-ru variace σ 2 = lim Var( ǫ i ). ǫ i k > ; c > ; γ < /2 If the process (ǫ t ) are ucorrelated (for istace GARCH-type model), empirical variace of the historical data ca be used as estimator of σ 2. If (ǫ t ) are correlated, the popular Bartlett estimator (see [8]) ca be used. Uder some regular coditios, it hold that (see [6] ad [2]) { lim P{τ() < } = P i= <s< W (s) s γ } > c. Hece, at a omial level α =.5, the critical value of the test is the ( α)-quatile of the distributio of W (s) /s γ. Whe γ =, these quatiles are kow (see Table of [25] for values obtaied through a Mote <s< Carlo simulatio). We compare our procedure to the previous residuals CUSUM oe (with γ = ) i two situatios. (ǫ t ) is a AR() process; ǫ t = φ ǫ t +ξ t with φ =.2; 2. (ǫ t ) is a GARCH(,) process; ǫ t = σ t ξ t with σt 2 = α +α ǫ2 t +β σ2 t ad (α,α,β ) = (.,.3,.2). The historical sample size are = 5 ad =. These procedure are evaluated at times k = +, + 2,+3,+4,+ 5, while the chage occurs at k = + 5 or k = Tables 2 ad 3 idicate the empirical levels ad the empirical powers based of 2 replicatios. The elemetary statistics of the empirical detectio delay are reported i Tables 4. The results of Table 2 ad Table 3 show that both procedure based o detectors Ĉk ad Q k are more coservative. Oe ca also see that, icreasig legth of historical data reduces the size distortio of these procedures. This is due to the fact that the legth of moitorig period is fixed ad ot icreasig with. Uder H, the chage has bee detected before the moitorig time k = +5. But, as we metioed above, the challege of this problem is to miimize the detectio delay. For this criteria, it is see i Table 4 that for the mea shift i AR process, our procedure works well as Horváth et al. s procedure whe the chage occurs at the begiig of the moitorig (k = +5) ad it is little better whe the chage occurs log time after the begiig of the moitorig (k = +25). For the mea shift i GARCH process, our test procedure outperforms the Horváth et al. s test i terms of mea, Q, media ad Q 3 of detectio delay. 4.3 Moitorig parameter chage i AR() ad GARCH(,) models I this subsectio, we preset some simulatios results for moitorig parameter chage i AR() ad GARCH(,) models ad compare our procedure to that proposed by Na et al. [25]. First recall that if the boudary fuctio b c > is costat, this procedure is based o the relatio { P{τ() < } = P k> } D k > c

14 3 k Empirical levels = 5 Ĉ k Q k = Ĉ k Q k Empirical powers = 5 ; k = +5 Ĉ k.3 Q k.335 = 5 ; k = +25 Ĉ k...9 Q k = ; k = +5 Ĉ k.75 Q k.95 = ; k = +25 Ĉ k...35 Q k Table 2: Empirical levels ad powers for moitorig meas shift i AR() with φ =.2. The empirical levels are computed whe µ = ad the empirical powers are computed whe the mea µ = chages to µ =.2. k Empirical levels = 5 Ĉ k Q k = Ĉ k Q k..... Empirical powers = 5 ; k = +5 Ĉ k Q k = 5 ; k = +25 Ĉ k..5 Q k...92 = ; k = +5 Ĉ k.995 Q k.985 = ; k = +25 Ĉ k...98 Q k Table 3: Empirical levels ad powers for moitorig meas shift i GARCH(,) with (α,α,β ) = (.,.3,.2). The empirical levels are computed whe µ = ad the empirical powers are computed whe the mea µ = chages to µ =.3.

15 4 d Mea SD Mi Q Med Q 3 Max AR() = 5 ; k = +5 Ĉ k Q k = 5 ; k = +25 Ĉ k Q k = ; k = +5 Ĉ k Q k = ; k = +25 Ĉ k Q k GARCH(,) = 5 ; k = +5 Ĉ k Q k = 5 ; k = +25 Ĉ k Q k = ; k = +5 Ĉ k Q k = ; k = +25 Ĉ k Q k Table 4: Elemetary statistics of the empirical detectio delay for moitorig mea shift i AR() ad GARCH(,).

16 5 where D k := Ĝ(T, ) /2 F(T, ) ( θ(t,k ) θ(t, ) ). Na et al. show that uder H, { lim P{τ() < } = lim P k> } { } D k > c = P W d (s) > c. <s< Hece, at a omial level α, the critical value of their procedure is the ( α)-quatile of the distributio of W d (s) which ca be foud i Table of [25]. <s< The comparisos are made i the followigs situatios.. For AR() model : X t = φ X t +ξ t. Uder H, θ = φ =.2. Uder H, θ chages to θ =.5 at k. 2. For GARCH(,) model : X t = σ t ξ t with σ 2 t = α +α X2 t +β σ2 t. Uder H, θ = (α,α,β ) = (.,.3,.2), while uder H, θ = (.,.3,.2) chages to θ = (.5,.5,.2) at k. The historical sample size are = 5 ad =. These procedure are evaluated at times k = +, + 2,+3,+4,+5,, while the chage occurs at k = +5 or k = +25. Tables 5 ad 6 idicate the empirical levels ad the empirical powers based of 2 replicatios. The elemetary statistics of the empirical detectio delay are reported i Tables 7. k Empirical levels = 5 Ĉ k D k = Ĉ k D k Empirical powers = 5 ; k = +5 Ĉ k.335 D k = 5 ; k = +25 Ĉ k D k = ; k = +5 Ĉ k D k = ; k = +25 Ĉ k D k Table 5: Empirical levels ad powers for moitorig parameter chage i AR() process. The empirical levels are computed whe θ = φ =.2 is costat ad the empirical powers are computed whe θ =.2 chages to θ =.5. The cosidered AR ad GARCH processes have zero mea. Cotrary to the mea shift studied above, this mea is ot estimated. For AR model, it appears i Table 5 that both procedures based o detector Ĉk ad D k are coservative. This is ot the case for GARCH model (Table 6). The high size distortios whe = 5 is due to the difficulty to estimate the parameter of GARCH model. This size distortio decreases whe icreases ad Corollary 3. esures that with ifiite moitorig period, the empirical level teds to the omial oe as. For both the cases of AR ad GARCH processes, the procedure based o detector Ĉk detect the chage after the moitorig time k = + 5. Ulike Na et al. [25], we cosider a sceario of GARCH model with moderate chage i parameter, it is see i Table 6 that the procedure based o detector D k provides usatisfactory results. At the moitorig time k = +5, it is ot sure that the chage must be detected eve whe k = +5. This

17 6 k Empirical levels = 5 Ĉ k D k = Ĉ k D k Empirical powers = 5 ; k = +5 Ĉ k.89 D k = 5 ; k = +25 Ĉ k D k = ; k = +5 Ĉ k.835 D k = ; k = +25 Ĉ k D k Table 6: Empirical levels ad powers for moitorig parameter chage i GARCH(,) process. The empirical levels are computed whe θ = (α,α,β ) = (.,.3,.2) is costat (hypothesis H ) ad the empirical powers are computed whe θ = (.,.3,.2) chages to θ = (.5,.5,.2) (hypothesis H ). d Mea SD Mi Q Med Q 3 Max AR() = 5 ; k = +5 Ĉ k D k = 5 ; k = +25 Ĉ k D k = ; k = +5 Ĉ k D k = ; k = +25 Ĉ k D k GARCH(,) = 5 ; k = +5 Ĉ k D k = 5 ; k = +25 Ĉ k D k = ; k = +5 Ĉ k D k = ; k = +25 Ĉ k D k Table 7: Elemetary statistics of the empirical detectio delay for moitorig parameter chage i AR() ad GARCH(,).

18 7 is ot surprisig accordig to the commet of subsectio 3.. Table 7 idicates the distributio of the detectio delay d. We ca see i Table 7 (eve i Table 4) that for our procedure, the relatio d /5 d 5 is globally satisfied (from Theorem 3.2, we deduced that d = O P ( /2 log ) whe is large eough). It is also see that, mea, Q, media ad Q 3 of our test are shorter tha Na et al. s oe. The results of Table 5, 6 ad 7 show that, our test is uiformly better ad the procedure based o detector Ĉk is highly recommeded. 5 Real-Data Applicatios We cosider the returs of the daily closig values of the Nikkei 225 stock idex (from Jauary 2, 995 to October 9, 998), S&P 5 ad FTSE (from Jauary 2, 24 to Jue, 22). These data are available o Yahoo! Fiace at They are represeted o Figure 2 ad Figure 6. These series are kow to represet ARCH effect ad GARCH(,2) (resp. GARCH(,)) ca be used to capture it i returs of Nikkei 225 (resp. S&P 5 ad FTSE ), see the book of Fracq ad Zakoïa 2. Let us take the observatios goig from Jauary 2, 995 to December 3, 996 (resp. Jauary 2, 24 to December 3, 25) as a historical data for the Nikkei 225 (resp. S&P 5 ad FTSE ) stock idex. These periods are kow to be stable i fiacial commuity. To verify it, we apply three procedures to test for parameter chage i the historical observatios. The ull hypothesis is that the parameter is costat over the observatios agaist the parameter chages alterative. The first test is proposed by Kege [8]. Defie the asymptotic covariace matrix (which take ito accout the chage possibility) of the estimator θ (T, ) by Σ,k := k F (T,k )Ĝ(T,k ) F (T,k ) det( Ĝ (T,k )) + k F (T k, )Ĝ(T k, ) F (T k, ) det( Ĝ (T k, )). The test is based o the statistic Q := ( Q() ) (2), Q where Q () := Q() v,k with k v Q (),k k2 := ( θ (T,k ) θ (T ) ) Σ,k ( θ (T k ) θ (T ) ), Q (2) := Q(2),k with v k v Q (2),k This test is applied with v = (log) δ where 2 δ 5/2. The secod test (see Lee ad Sog [22]) is based o the statistic with v = (log) 2. ( k)2 := ( θ (T k, ) θ (T, ) ) Σ,k ( θ (T k, ) θ (T k, ) ). ( k Q () 2 := ( θ (T,k ) v k v θ (T, ) ) Σ, ( θ (T,k ) θ (T, ) )) The third procedure is the CUSUM test see Kulperger ad Yu [2]. At a omial level α (,), each of these procedure rejects ull hypothesis if the test statistic is greater tha a critical value C α. Table 8 provides the results of these tests to the historical data that we have chose. Q Q CUSUM Nikkei (3.98) 2.3 (3.45).98 (.36) S&P (3.47) 2. (3.6).93 (.36) FTSE.95 (3.47) 2.3 (3.6).3 (.36) Table 8: Results of test for parameter chages i the historical data of Nikkei 225 (from Jauary 2, 995 to December 3, 996), S&P 5 ad FTSE (from Jauary 2, 24 to December 3, 25). Figures i brackets the critical values of the procedure at the omial level α =.5.

19 8 Note that, these series are very closed to a ostatioary process, i the sese that q j= α j + p j= β j (see (3)). Therefore, it would be difficult to compute the estimator θ (T k,l ) ( k < l ). For the statistics Q ad Q (), we cosider oly the time k that the computatio of θ (T,k ) ad θ (T k, ) coverges. This certaily itroduces distortios o these tests. O the other had, the CUSUM procedure eeds to compute oly the estimator θ (T, ) which covergece is obtaied. Accordig to these results, we coclude that the parameter does ot chage over these historical observatios. For Nikkei 225 data, moitorig startig at Jauary 2, 997. Figure 2 shows the realizatio of the sequece (Ĉk) for k goig from Jauary 2, 997 to October 9, 998. Moitorig procedure stops at October 27, 997. Recall that, the moitorig scheme ca be used as a alarm system. Whe it triggered, we eed to apply retrospective test to estimate the breakpoit. Accordig to Kege [8], the test based o Q () ad Q are more powerful tha the CUSUM test. Thus, i the retrospective procedure, we applied these two tests ad cosidered the oe which provides more sigificat result (i terms of p-value). Retrospective procedure is applied to the observatios goig from Jauary 2, 995 to October 27, 997 ad break is detected at t N September 7, 997; see Figure 2. This chage correspodsto the Asia fiacial crisis ( ) where the turmoil period started at July 997. We are goig to see for S&P 5 ad FTSE data how multiple chages ca be moitored. For these series, moitorig starts at Jauary 2, 26. Figure 3 represets the sequece (Ĉk) for k goig from Jauary 2, 26 to December 3, 28. Accordig to the Figure 3, the moitorig stops at November 6, 27 ad September 4, 27 for S&P 5 ad FTSE data respectively. Retrospective procedure is applied to the series goig from Jauary 2, 26 to November 6, 27 (for S&P 5 data) ad the series goig from Jauary 2, 26 to September 4, 27 (for FTSE data). Breaks are detected at t S, Jue 8, 27 (for S&P 5 data) ad t F, July 6, 27 (for FTSE data); see Figure 6. These breaks correspod to the begiig of the Subprime Crisis i US. After moitored the first chage, we eed to update the procedure. The ew historical data are the series goig from t S, to November 6, 27 (for S&P 5 data) ad the series goig from t F, to September 4, 27 (for FTSE data). Therefore, moitorig cotiues at November 9, 27 (for S&P 5 data) ad at September 5, 27 (for FTSE data). Figure 4 shows the curve of the sequece (Ĉk). The moitorig stops at October 7, 28 ad November, 28 for S&P 5 ad FTSE data respectively. The retrospective test is applied ad the break poit estimatio are t S,2 August 4, 28 ad t F,2 September 7, 28 respectively for these two series; see Figure 6. These breaks correspod to the Lehma Brothers Bakruptcy which affects the worldwide fiacial system. After that, the procedure is updated ad moitorig cotiues at October 2, 28 ad November, 28 for S&P 5 ad FTSE data. Figure 5 shows the sequece (Ĉk). The moitorig stopped at March 7, 29 (S&P 5) ad March 9, 29 (FTSE ) ad retrospective test detected chage at t S,3 Jauary 5, 29 (i S&P 5) ad t F,3 December 29, 28 (i FTSE data); see Figure 6. These breaks correspod to the worldwide govermets itervetio to solve the fiacial crisis. The procedure cotiues util Jue 22, other breaks are detected at t S,4 26 Jue 29, t S,5 5 April 2, t S,6 27 September 2, t S,7 9 July 2, t S,8 Jauary 22 (for S&P 5 data) ad t F,4 3 Jue 29, t F,5 27 July 2, t F,6 2 December 2 (for FTSE data). They are represeted o Figure 6. These breaks correspod to the turmoils periods i the Greece ad Europea debt crisis. Summary of the real-data applicatios Both moitorig procedure (based o detector Ĉk) ad retrospective test have bee applied to detect breaks i the Nikkei 225, S&P 5 ad FTSE stock idex. The followig results are obtaied :. For the Nikkei 225, from Jauary 2, 995 to October 9, 998 ; break is detected at t N 7 September 997 which correspod to the turmoil period of the Asia fiacial crisis ( ).

20 9 See also Figure For the S&P 5 ad FTSE, from Jauary 2, 24 to Jue, 22 ; break are detected at ( t S,i ad t F,i are referred to the breakpoit i the S&P 5 ad FTSE respectively) t S, 8 Jue 27 ad t F, 6 July 27 which correspod to the begiig of the Subprime Crisis i US; t S,2 4 August 28 ad t F,2 7 September 28 which correspod to the Lehma Brothers Bakruptcy; t S,3 5Jauary29ad t F,3 29December28whichcorrespodworldwidegovermetsitervetio to solve the fiacial crisis; t S,4 26 Jue 29, t S,5 5 April 2, t S,6 27 September 2, t S,7 9 July 2, t S,8 See also Figure 6. Jauary 22 ad t F,4 3 Jue 29, t F,5 27 July 2, t F,6 2 December 2. These breaks idicates the turmoils periods i the Greece ad Europea debt crisis. 6 Coclusios This paper is devoted to the sequetial chage-poit detectio i the parameters of a large class of causals models. We costruct a moitorig scheme based o a differece betwee the historical parameter estimate ad the updated parameter estimate computed without the historical observatios. The simulatio results for the moitorig mea shift i AR() ad GARCH(,) show that our procedure works well (i terms of power ad detectio delay) as Horváth et al. s procedure whe the chage occurs at the begiig of the moitorig ad it is preferable whe the chage occurs log time after the begiig of the moitorig. The simulatio results for the moitorig parameter chage i AR() ad GARCH(,) show that our procedure outperforms (i terms of power ad detectio delay) the Na et al. s oe. The real-data study shows the applicability of the procedure o the daily closig values of the Nikkei 225, S&P 5 ad FTSE stock idex. It is show how this moitorig scheme with retrospective test ca be used to off-lie multiple breaks detectio.

21 2 C k for the Nikkei Jul Oct Time Breaks detectio i the Nikkei 225 Returs Nikkei t N 998 Time Figure 2: The top figure is a realizatio of the statistics Ĉk with k goig from Jauary 2, 995 to October 9, 998 for Nikkei 225 data; the historical data cosidered are the series goig from Jauary 2, 995 to December 3, 996. The horizotal solid lie represets the limit of the critical regio, the vertical dotted lie idicates the date of the begiig of the Asia fiacial crisis ( ) ad the vertical solid lie idicates the time where the moitorig procedure will stop. The bottom figure is the returs of Nikkei 225 data from Jauary 2, 995 to October 9, 998; the vertical solid lie idicates the date where break have bee detected usig retrospective test after the moitorig stops.

22 2 C k for the S&P Jul Nov Time C k for the FTSE Jul Sep Time Figure 3: Realizatio of the statistics Ĉk with k goig from Jauary 2, 26 to December 3, 28 for S&P 5 ad FTSE data; the historical data cosidered are the series goig from Jauary 2, 24 to December 3, 25. The horizotal solid lie represets the limit of the critical regio, the vertical dotted lie idicates the date of the begiig of the Subprime Crisis i US ad the vertical solid lie idicates the time where the moitorig procedure stopped.

23 22 C k for the S&P Sep Oct 29 Time C k for the FTSE Sep Nov 29 Time Figure 4: Realizatio of the statistics Ĉk for S&P 5 ad FTSE data; the historical data are the series goig from Jue 8, 27 to November 6, 27 (for S&P 5 data) ad July 6, 27 to September 4, 27 (for FTSE data). The horizotal solid lie represets the limit of the critical regio, the vertical dotted lie idicates the date of the Lehma Brothers Crisis ad the vertical solid lie idicates the time where the moitorig procedure stopped.

24 23 C k for the S&P 5 C k for the FTSE Oct Mar 29 May 29 Time Nov Mar 29 Jul 29 Time Figure 5: Realizatio of the statistics Ĉk for S&P 5 ad FTSE data; the historical data are the series goig from August 4, 28 to October 7, 28 (S&P 5) ad September 7, 28 to November, 28 (FTSE ). The horizotal solid lie represets the limit of the critical regio, the vertical dotted lie idicates the date of the begiig of stabilizatio i fiacial system due to the worldwide govermets itervetio ad the vertical solid lie idicates the time where the moitorig procedure stopped. 7 Proofs of the mai results Let us prove first some useful lemmas. I the sequel, for ay x IR, [x] deotes the iteger part of x. Let (ψ ) ad (r ) be sequeces of radom variables. Throughout this sectio, we use the otatio ψ = o P (r ) to mea : for all ε >, P( ψ ε r ) as. Write ψ = O P (r ) to mea : for all ε >, there exists C > such that P( ψ C r ) ε for large eough. Recall that (X,,X ) is a observed trajectory of a process M Z (M θ,f θ ). Let k 2 ad T, = {,,}, T l,k = {l,l+,,k} with l Π,k = {v,v +,,k v }, ad defie with θ defied i (6). Lemma 7. Uder assumptios of Theorem 3., k> C k,l := k l G /2 F ( θ(tl,k ) k θ(t, ) ), Ĉk,l C k,l = op () as. l Π,k b((k l)/) Proof. For ay, we have k> l Π,k b((k l)/) Ĉ k,l C k,l = Now, proceed similarly as i the proof of Lemma 5.3 of [8]. if s> b(s) k> Ĉk,l C k,l. l Π,k

25 24 Breaks detectio i the S&P 5 Returs S&P t S, t S,2 t S,3 t S,4 t S,5 t S,6 t S,7 t S, Time Breaks detectio i the FTSE Returs FTSE t F, t F,2 t F,3 t F,4 t F,5 t F, Time Figure 6: Break detectio i the returs of S&P 5 ad FTSE data usig moitorig procedure based o Ĉk. The verticals lies idicate the dates where breaks have bee detected.

26 25 Lemma 7.2 Uder assumptios of Theorem 3. k> l Π,k b((k l)/) (k l)f ( θ(tl,k ) k θ(t, ) ) 2 ( θ L(T l,k,θ) k l θ L(T,,θ) ) = o P () as. Proof. Let k ad T {,,k}. By applyig the Taylor expasio to the coordiates of L(T, )/ θ, ad usig the fact that L(T, θ(t))/ θ = we have 2 Card(T) θ L(T,θ ) = F(T) ( θ(t) θ ) where F(T) = 2 ( Card(T) for some θ i (T) betwee θ(t) ad θ. Hece for ay l Π,k F ( θ(t l,k ) θ) = 2 k l θ L(T l,k,θ)+ ( F F(T l,k ) )( θ(tl,k ) θ ) ad 2 L(T, θi (T)) θ θ i ) i d + 2 ( l,k,θ k l θ L(T ) θ L(T l,k,θ) ). F ( θ(t, ) θ) = 2 θ L(T,,θ)+ ( F F(T, ) )( θ(t, ) θ ) 2( +,,θ θ L(T ) θ L(T,,θ) ). Therefore, for ay l Π,k k ( (k l)f ( θ(tl,k ) θ(t, ) ) 2 ( θ L(T l,k,θ) k l = k l k k l k For k > ad with some l k Π,k, we have θ L(T,,θ) )) ( F F(Tl,k ) )( θ(tl,k ) θ) ( +2 l,k,θ k θ L(T ) θ L(T l,k,θ )) ( F F(T, ) )( θ(t, ) θ) k l ( 2,,θ k θ L(T ) θ L(T,,θ )). (6) k l l Π,k b((k l)/) k F F(T l,k ) θ(t l,k ) θ k If b(s) lk F F(T lk,k) θ(t lk,k) θ. s> Accordig to [4] ad [5], F F(T lk,k) = o P () ad θ(t lk,k) θ = O P (/ k l k ) as k l k. Hece k> Similar argumets imply that k> k l l Π,k b((k l)/) k F F(T l,k ) θ(t l,k ) θ = o P() as. (7) k l l Π,k b((k l)/) k F F(T, ) θ(t, ) θ = o P() as. (8) For k > ad for some l k Π,k, we have l Π,k b((k l)/) k θ L(T l,k,θ) θ L(T l,k,θ) Accordig to [4], If b(s) lk,k,θ k lk θ L(T ) θ L(T l k,k,θ ). s> k lk θ L(T lk,k, ) θ L(T l k,k, ) Θ = o P () as k l k. Hece k> l Π,k b((k l)/) k θ L(T l,k,θ ) θ L(T l,k,θ ) = o P() as. (9)

27 26 Similar argumets show that k> l Π,k b((k l)/) k l k Thus, Lemma 7.2 follows from (6), (7), (8), (9) ad (2).,,θ θ L(T ) θ L(T,,θ) = o P () as. (2) Lemma 7.3 Uder assumptios of Theorem 3. k> k l l Π,k b((k l)/) k F ( θ(tl,k ) θ(t, ) ) D t> <s<t W G (s) sw G () t b(s) where W G is a d-dimesioal Gaussia cetered process with covariace matrix E(W G (s)w G (τ) ) = mi(s,τ)g. Proof. We are goig to apply Lemma 7.2 for specifyig the asymptotic behaviour of θ(t l,k ) θ(t, ). For k > ad l Π,k, we have 2 k ( θ L(T l,k,θ ) k l Now we are goig to proceed i two steps. Step. Let T >. We have <k<t l Π,k b((k l)/) = <k<t l Π,k b((k l)/) = 2 k k k θ L(T,,θ )) = k θ L(T l,k,θ ) k l i=l q i (θ ) θ t {,+,,T} s { v,2 v,,t v } k l b(([t] [s])/) i= ( k i=l+ θ L(T,,θ) q i (θ ) θ ( [t] q i (θ ) θ [t] i=[s]+ k l q i (θ ) θ i= q i (θ ) ). θ [t] [s] i= q i (θ) ). θ Defie the set S := {(t,s) [,T] [,T]/ s < t}. Accordig to [4], ( q i (θ ) ) is a statioary ergodic martigale θ t Z differece sequece with covariace matrix G. By Cramér-Wold device (see [9] p. 26), it holds that [t] i=[s]+ q i (θ ) θ D(S) W G(t s). with D(S) meas the weak covergece o the Skorohod space D(S). Hece ( [t] i=[s]+ q i (θ ) θ [t] [s] i= q i (θ ) θ ) D(S) W G(t s) (t s)w G (). Therefore 2 <k<t l Π,k b((k l)/) k θ L(T l,k,θ k l ) D D <t<t <t<t <s<t <s<t θ L(T,,θ ) W G (t s) (t s)w G () t b(t s) W G (s) sw G (). (2) t b(s) Step 2. We will show that the limit distributio (as,t ) of k>t 2 l Π,k b((k l)/) k θ L(T l,k,θ ) k l θ L(T,,θ )

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

ARTICLE IN PRESS. Statistics & Probability Letters ( ) A Kolmogorov-type test for monotonicity of regression. Cecile Durot

ARTICLE IN PRESS. Statistics & Probability Letters ( ) A Kolmogorov-type test for monotonicity of regression. Cecile Durot STAPRO 66 pp: - col.fig.: il ED: MG PROD. TYPE: COM PAGN: Usha.N -- SCAN: il Statistics & Probability Letters 2 2 2 2 Abstract A Kolmogorov-type test for mootoicity of regressio Cecile Durot Laboratoire

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

INFINITE SERIES KEITH CONRAD

INFINITE SERIES KEITH CONRAD INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

Inference on Proportion. Chapter 8 Tests of Statistical Hypotheses. Sampling Distribution of Sample Proportion. Confidence Interval

Inference on Proportion. Chapter 8 Tests of Statistical Hypotheses. Sampling Distribution of Sample Proportion. Confidence Interval Chapter 8 Tests of Statistical Hypotheses 8. Tests about Proportios HT - Iferece o Proportio Parameter: Populatio Proportio p (or π) (Percetage of people has o health isurace) x Statistic: Sample Proportio

More information

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Case Study. Normal and t Distributions. Density Plot. Normal Distributions Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca

More information

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006 Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

Plug-in martingales for testing exchangeability on-line

Plug-in martingales for testing exchangeability on-line Plug-i martigales for testig exchageability o-lie Valetia Fedorova, Alex Gammerma, Ilia Nouretdiov, ad Vladimir Vovk Computer Learig Research Cetre Royal Holloway, Uiversity of Lodo, UK {valetia,ilia,alex,vovk}@cs.rhul.ac.uk

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

arxiv:1506.03481v1 [stat.me] 10 Jun 2015

arxiv:1506.03481v1 [stat.me] 10 Jun 2015 BEHAVIOUR OF ABC FOR BIG DATA By Wetao Li ad Paul Fearhead Lacaster Uiversity arxiv:1506.03481v1 [stat.me] 10 Ju 2015 May statistical applicatios ivolve models that it is difficult to evaluate the likelihood,

More information

Data Analysis and Statistical Behaviors of Stock Market Fluctuations

Data Analysis and Statistical Behaviors of Stock Market Fluctuations 44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown Z-TEST / Z-STATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large T-TEST / T-STATISTIC: used to test hypotheses about

More information

PSYCHOLOGICAL STATISTICS

PSYCHOLOGICAL STATISTICS UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Cousellig Psychology (0 Adm.) IV SEMESTER COMPLEMENTARY COURSE PSYCHOLOGICAL STATISTICS QUESTION BANK. Iferetial statistics is the brach of statistics

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

Lesson 17 Pearson s Correlation Coefficient

Lesson 17 Pearson s Correlation Coefficient Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

, a Wishart distribution with n -1 degrees of freedom and scale matrix.

, a Wishart distribution with n -1 degrees of freedom and scale matrix. UMEÅ UNIVERSITET Matematisk-statistiska istitutioe Multivariat dataaalys D MSTD79 PA TENTAMEN 004-0-9 LÖSNINGSFÖRSLAG TILL TENTAMEN I MATEMATISK STATISTIK Multivariat dataaalys D, 5 poäg.. Assume that

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis

More information

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number. GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION

CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION www.arpapress.com/volumes/vol8issue2/ijrras_8_2_04.pdf CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION Elsayed A. E. Habib Departmet of Statistics ad Mathematics, Faculty of Commerce, Beha

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S 2 CONTROL CHART FOR THE CHANGES IN A PROCESS

COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S 2 CONTROL CHART FOR THE CHANGES IN A PROCESS COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S CONTROL CHART FOR THE CHANGES IN A PROCESS Supraee Lisawadi Departmet of Mathematics ad Statistics, Faculty of Sciece ad Techoology, Thammasat

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

Chapter 14 Nonparametric Statistics

Chapter 14 Nonparametric Statistics Chapter 14 Noparametric Statistics A.K.A. distributio-free statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

Heavy Traffic Analysis of a Simple Closed Loop Supply Chain

Heavy Traffic Analysis of a Simple Closed Loop Supply Chain Heavy Traffic Aalysis of a Simple Closed Loop Supply Chai Arka Ghosh, Sarah M. Rya, Lizhi Wag, ad Aada Weerasighe April 8, 2 Abstract We cosider a closed loop supply chai where ew products are produced

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

Universal coding for classes of sources

Universal coding for classes of sources Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric

More information

4.3. The Integral and Comparison Tests

4.3. The Integral and Comparison Tests 4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Building Blocks Problem Related to Harmonic Series

Building Blocks Problem Related to Harmonic Series TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

More information

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu Multi-server Optimal Badwidth Moitorig for QoS based Multimedia Delivery Aup Basu, Iree Cheg ad Yizhe Yu Departmet of Computig Sciece U. of Alberta Architecture Applicatio Layer Request receptio -coectio

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

Non-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring

Non-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring No-life isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

More information

arxiv:0908.3095v1 [math.st] 21 Aug 2009

arxiv:0908.3095v1 [math.st] 21 Aug 2009 The Aals of Statistics 2009, Vol. 37, No. 5A, 2202 2244 DOI: 10.1214/08-AOS640 c Istitute of Mathematical Statistics, 2009 arxiv:0908.3095v1 [math.st] 21 Aug 2009 ESTIMATING THE DEGREE OF ACTIVITY OF JUMPS

More information

Lesson 15 ANOVA (analysis of variance)

Lesson 15 ANOVA (analysis of variance) Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

More information

ESTIMATING THE DEGREE OF ACTIVITY OF JUMPS IN HIGH FREQUENCY DATA

ESTIMATING THE DEGREE OF ACTIVITY OF JUMPS IN HIGH FREQUENCY DATA The Aals of Statistics 2009, Vol. 37, No. 5A, 2202 2244 DOI: 10.1214/08-AOS640 Istitute of Mathematical Statistics, 2009 ESTIMATING THE DEGREE OF ACTIVITY OF JUMPS IN HIGH FREQUENCY DATA BY YACINE AÏT-SAHALIA

More information

Tradigms of Astundithi and Toyota

Tradigms of Astundithi and Toyota Tradig the radomess - Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

Descriptive Statistics

Descriptive Statistics Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote

More information

BASIC STATISTICS. f(x 1,x 2,..., x n )=f(x 1 )f(x 2 ) f(x n )= f(x i ) (1)

BASIC STATISTICS. f(x 1,x 2,..., x n )=f(x 1 )f(x 2 ) f(x n )= f(x i ) (1) BASIC STATISTICS. SAMPLES, RANDOM SAMPLING AND SAMPLE STATISTICS.. Radom Sample. The radom variables X,X 2,..., X are called a radom sample of size from the populatio f(x if X,X 2,..., X are mutually idepedet

More information

MAXIMUM LIKELIHOODESTIMATION OF DISCRETELY SAMPLED DIFFUSIONS: A CLOSED-FORM APPROXIMATION APPROACH. By Yacine Aït-Sahalia 1

MAXIMUM LIKELIHOODESTIMATION OF DISCRETELY SAMPLED DIFFUSIONS: A CLOSED-FORM APPROXIMATION APPROACH. By Yacine Aït-Sahalia 1 Ecoometrica, Vol. 7, No. 1 (Jauary, 22), 223 262 MAXIMUM LIKELIHOODESTIMATION OF DISCRETEL SAMPLED DIFFUSIONS: A CLOSED-FORM APPROXIMATION APPROACH By acie Aït-Sahalia 1 Whe a cotiuous-time diffusio is

More information

Estimating Probability Distributions by Observing Betting Practices

Estimating Probability Distributions by Observing Betting Practices 5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2 74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is

More information

Swaps: Constant maturity swaps (CMS) and constant maturity. Treasury (CMT) swaps

Swaps: Constant maturity swaps (CMS) and constant maturity. Treasury (CMT) swaps Swaps: Costat maturity swaps (CMS) ad costat maturity reasury (CM) swaps A Costat Maturity Swap (CMS) swap is a swap where oe of the legs pays (respectively receives) a swap rate of a fixed maturity, while

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

More information

Lecture 5: Span, linear independence, bases, and dimension

Lecture 5: Span, linear independence, bases, and dimension Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information