• Aucun résultat trouvé

Combining Gamma and Brownian processes for degradation modeling in presence of explanatory variables

N/A
N/A
Protected

Academic year: 2021

Partager "Combining Gamma and Brownian processes for degradation modeling in presence of explanatory variables"

Copied!
18
0
0

Texte intégral

(1)

HAL Id: hal-00535812

https://hal.archives-ouvertes.fr/hal-00535812

Preprint submitted on 12 Nov 2010

HAL

is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire

HAL, est

destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Combining Gamma and Brownian processes for degradation modeling in presence of explanatory

variables

Laurent Bordes, Christian Paroissin, Ali Salami

To cite this version:

Laurent Bordes, Christian Paroissin, Ali Salami. Combining Gamma and Brownian processes for

degradation modeling in presence of explanatory variables. 2010. �hal-00535812�

(2)

Combining Gamma and Brownian processes for degradation modeling in presence of explanatory variables

L. Bordesa,, C. Paroissina, A. Salamia

aUniversit´e de Pau et des Pays de l’Adour, Laboratoire de Math´ematiques et de leurs Applications - UMR CNRS 5142, Avenue de l’Universit´e, 64013 Pau cedex, France.

Abstract

A new approach has been proposed recently to describe a system deterioration. In this new approach the authors have considered the degradation as the sum of a gamma process and a Brownian motion, independent of the gamma process. The Brownian motion may describe, for example, degradation measurement error. In this paper covariates are introduced in order to take into account environmental effects or systems heterogeneity. From the observation of nindependent items at regular instants over a finite time interval, the model parameters are estimated by a two-stage least-square method. Asymptotic properties of the estimators are provided. Finally both numerical simulations and real data applications are supplied to illustrate our method.

Keywords: gamma process, Wiener process, covariates, least-square estimators, consistency, asymptotic normality AMS Classification:62F10, 62F12, 62N05

1. Introduction

Modelling the degradation of a system can be done using a stochastic process. Degradation is usually measured at several times and may be influenced by the system environment. Thus it is necessary to account covariates describing this environment. Degradation levels can also reflect measurement errors or, for example, minor repairs of the system.

As a consequence, a good statistical model should take into account all these sources of variation.

For certain types of degradation a process involving independent non-negative increments is appropriate, as for example the gamma process (van Noortwijk (2009)). These kind of processes imply that the system state cannot be improved over time, and then this system cannot return to its original state without external maintenance actions. The gamma process can be regarded as a compound Poisson process of gamma-distributed increments in which the Poisson rate tends to infinity and increment size tend to zero in proportion (Lawless and Crowder (2004)). It was originally proposed by Abdel-Hameed (1975) in order to describe a degradation phenomenon. This process is frequently used in the literature since it is preferable from the physics point of view (monotonic deterioration). Moreover the independent increments property makes the subsequent mathematical treatment quite tractable. In several papers, covariates or random effects have been incorporated to a gamma process in order to take into account the environment or the individual heterogeneity. Bagdonaviˇcius and Nikulin (2001) propose an accelerated life test (ALT) model where covariates modify the time scale of the gamma process. Alternatively Lawless and Crowder (2004) and Crowder and Lawless (2007) assume that the scale parameter depends on covariates and is also proportional to a random effect.

Let us recall the definition of this process in order to fix our notations. Letξ ∈ R+andη = (ηt)t>0 a real-valued non-decreasing function such thatη0=0. The stochastic processYis a gamma process with parameters (ξ, η) if:

1. Y(0)=0;

2. Yhas independent increments;

http://lma-umr5142.univ-pau.fr, T´el. 05 59 40 75 38, Fax 05 59 40 75 55

Email addresses:[email protected](L. Bordes),[email protected](C. Paroissin),[email protected](A.

Salami)

(3)

3. For 0≤s<t,Y(t)−Y(s) is gamma distributed with parameters (ξ, ηt−ηs).

The probability distribution function ofY(t) is defined by fY(t)(y)= ξηt

Γ(ηt)yηt1eξy1{y0},

whereΓ(·) is the gamma function and 1{·} is the set indicator function. A special case is mainly considered in the literature when the functionηis linear, say for instanceηt=αt. Indeed, in such case,Yis a stationary process: for any t≥0 andδ >0,Y(t+δ)−Y(t) andY(δ) have the same distribution. ThusYturns to be a L´evy process. This special case allows to do many explicit computations. Some non-linear cases have been also studied. The most common non-linear model is obtained forηt=αtβ. When dealing with statistical purpose the parameterβis generally assumed to be known. Lawless and Crowder (2004) considered another case whereηis defined by the Paris-Erdogan curve.

For more details on gamma processes see van Noortwijk (2009). Hereafter we only consider the linear case.

Another interesting Markov process used in the literature as a degradation model is the Wiener diffusion process (Barker (2006); Doksum and H´oyland (1992); Wang (2010); Whitmore (1995) and Whitmore et al. (1998)). The reason why such Markov processes (the gamma process and the Brownian motion) have been and are still extensively used is that they belong to a class of time-dependent stochastic processes known as L´evy processes. Let us recall some basic facts about the Wiener process. A processW is said to be a Brownian motion with driftµand variance σ2ifW(t) =σB(t)+µtwhereBis a standard Brownian motion with variancet. The processWhas the following properties:

1. W(0)=0;

2. Whas continuous sample paths;

3. Whas independent increments;

4. For any 0 ≤s<t, the random variableW(t)−W(s) has normal distribution with meanµ(t−s) and variance σ2(t−s).

The drawback of the Gaussian assumption is that it leads to a process with non monotone sample paths. As claimed by Park and Padgett (2005), this is the reason why this process can be inadequate in modelling monotone deterioration.

The aim of this paper is to propose a model joining the two previously mentioned approaches (the gamma process and the Brownian motion). Then we assume that covariates only act on the gamma process part involved in our degradation process. Covariates are incorporated as in Bagdonaviˇcius and Nikulin (2001). From the observation ofnindependent items at regular instants over a finite time interval, the model parameters are estimated by a two- stage least-square method. Asymptotic properties of the estimators are then provided and, finally, both numerical simulations and real data applications are supplied to illustrate our method.

2. Degradation model

As claimed above a new approach has been proposed recently (see Bordes et al. (2010)) to describe a system degradation, considering the following degradation process:

t≥0,D(t)=Y(t)+τB(t),

whereYis a gamma process with parametersαandξ(as defined previously) and whereBis a Brownian motion. This model is defined forτ∈Rand the processesYandBare assumed to be independent. Without loss of generality, we can assume thatτ≥0 sinceτB(t) and−τB(t) have the same distribution for allt≥0.

The motivations for considering such a model are the following ones. First, this model joins the gamma process and the Brownian motion into a single model. Indeed, it is clear that whenτ =0, this model turns to be a gamma process. Moreover, ifα/ξtends tob>0 andα/ξ2tends to 0, then this model converges weakly to a Brownian motion with positive driftb. Second, measurements of degradation levels reflect measurement errors. Hence, the role of Brownian motion in this model can be interpreted as measurement errors. Finally, our model can take into account minor repairs carried out on the system over time that can be responsible of non-monotone degradation. Using this

(4)

model Bordes et al. (2010) assume thatnindependent items are observed at irregular instants and provide estimators of the model parameters using the moment method approach.

In this paper, we assume that covariates act on the gamma process part involved in our degradation process.

Covariates are integrated as in Bagdonaviˇcius and Nikulin (2001). Thus if xT =

x(1), . . . ,x(p)

is a vector of p covariates, conditionally onxour model is defined by

t≥0, Dx(t) = Y teβTx

+τB(t), whereβ=

β1, . . . , βp

T

is a vector of unknown parameters. It follows thatYis a stationary gamma process with scale parameterξand shape parameterαeβTx. Moreover, we assume that the covariates vectorxis an observed value of a random vectorXhaving density function fX with respect to aσ-finite measureµponRp and we denote byFX its distribution function.

To end this section, we introduce some simulations of the proposed degradation process. Here we consider that items are subject to a one dimensional covariate. This covariate can take one of three possible values corresponding to three different solicitations (low, medium and high stress levels). For instance, it can be the temperature as in NIST/SEMATECH (2010). On Figure 1, simulated trajectories are plotted (dotted lines), along with the three averages of degradations (solid lines). Parameters are set toξ=1,α=2,β=(−0.5,0,0.4) andτ2 =1.

Figure 1: Simulation example

One can observe that items have to be monitored over a sufficient long time interval in order to make appear the three distinct groups. Of course, this ”optimal” time interval depends on parameters values which are unknown when considering real applications.

3. Parameter estimation

We denote byD(1)x1, . . . ,D(n)xn nindependent degradation processes such that for anyi∈ {1, . . . ,n}and for anyt≥0, D(i)xi (t)=Y(i)

teβTxi

+τB(i)(t),

whereD(1)x1, . . . ,D(n)xn have the same distribution asDxin Section 2 and x1, . . . ,xnare nindependent and identically distributed (i.i.d.) realizations ofX. We suppose that we observe the process D(i)xi at regular instantstj = jT/N for

(5)

j∈ {0, . . . ,N}. For any 1≤ jNandk>0,we denote bym(k)θ (xi) thek-th moment of increments

∆D(i)xi tj

=D(i)xi tj

D(i)xi tj1

, whereθ =

θ(1), θ(2)

= (γ, β),

α, τ2

withγ = α/ξ. We assume thatθbelongs toΘ = Θ1×Θ2 ⊂ R +×Rp

× R+×R+the parameter space of the model. In the sequel we denote byθ0=

θ(1)0 , θ(2)0

=

0, β0), α0, τ20

the true value of the model parameter. Hereafter we denote byEθϕ(Dx(t))

the conditional meanEθϕ(DX(t))|X=x for any real-valued measurable functionϕ.

The first moment is equal to

m(1)θ (xi) = Eθh

∆D(i)xi tj

i = Eθh

∆D(i)X

i

tj

|Xi=xi

i

= γT

N eβTxi = m(1)θ(1)(xi). The second moment is equal to

m(2)θ (xi) = Eθ

∆D(i)xi tj

2

= Eθ

∆D(i)X

i

tj

2

|Xi=xi, θ(1)

= m(1)θ(1)(xi)γ α+

m(1)θ(1)(xi)2

2T/N = m(2)θ(2) xi, θ(1)

.

To estimateθ(1)=(γ, β), we minimize the following first regression function d1(n)

θ(1)

= Xn

i=1

XN j=1

∆D(i)xi tj

m(1)θ(1)(xi)2

= Xn

i=1

XN j=1

∆D(i)xi tj

−γT N eβTxi

2

.

Then we set ˆθ(1)n =arg min

θ(1)Θ1

d(n)1 θ(1)

. Once this parameter is estimated, we estimateθ(2) = α, τ2

by minimizing the following second regression function

d(n)2

θ(2),θˆ(1)n

= Xn

i=1

XN j=1

h∆D(i)x

i

tji2

m(2)θ(2)

xi,θˆ(1)n 2

= Xn

i=1

XN j=1

h∆D(i)xi tj

i2

m(1)ˆ

θn(1)(xi)γˆ α−

m(1)ˆ

θ(1)n (xi) 2

−τ2T/N

!2

.

As a consequence θ(2) is estimated by ˆθ(2)n = arg min

θ(2)Θ2

d(n)2

θ(2),θˆn(1)

.The final estimator of θis therefore ˆθn = θˆ(1)n ,θˆ(2)n

. At each stage of our approach, estimators are obtained numerically by using a differentiable optimization method.

4. Theoretical results

First we denote byd(n)(θ) andd(θ) the two following matrices below:

d(n)(θ)= 1 nN



d1(n)

θ(1) d2(n)

θ(2), θ(1)



 and d(θ)=



d1

θ(1) d2

θ(2), θ(1)



,

where it is established in the proof of Theorem 2 thatd1andd2are respectively the almost sure limits ofd1(n)andd(n)2 , and are respectively defined by:

d1 θ(1)

= Z

Rp

Eθ

0

Dx

T N

m(1)θ(1)(x) 2

fX(x) dµp(x), and

d2(θ)=d2

θ(2), θ(1)

= Z

Rp

Eθ

0

D2x

T N

m(2)θ(2) x, θ(1)2

fX(x) dµp(x).

(6)

4.1. Consistency

Let us prove the consistency of θˆn

n1. First we need to show the following lemma. In the sequelk · kdenotes the Euclidean norm.

Lemma 1. Assume that the following conditions are fulfilled:

1. Θis a compact set;

2. For i∈ {1,2}, the applicationθ7−→di(θ)is continuous and satisfies:

di(θ)≥0for allθ∈Θ,

d1and d2admit unique minima atθ(1)0 ∈Θ˚1andθ0∈Θ˚ respectively.

3. sup

θΘkd(n)(θ)−d(θ)k−−−−→nPr

→∞ 0.

Then, as n tends to infinity,(ˆθn)n0converges in probability toθ0.

P. To ensure that ˆθn converges in probability toθ0, we have to prove that ˆθ(1)n (respectively ˆθn(2)) converges in probability toθ(1)0 (respectivelyθ(2)0 ). First let us check that ˆθ(1)n −−−−→nPr

→∞ θ(1)0 . Without loss of generality, we assume thatd1

θ(1)0

=0. Θ1is a compact set andB θ0(1), ǫ

⊂Θ1is the open ball with centerθ(1)0 and radiusǫ >0. By Assumption 2 there existsη >0 such that

∀θ(1)Bc θ(1)0 , ǫ

, d1 θ(1)

≥η.

Then, if ˆθn(1)Bc θ(1)0 , ǫ

, we have d(n)1

θˆ(1)n

≥ η− sup

θ(1)Θ1

d(n)1 θ(1)

d1

θ(1). (1)

Since ˆθ(1)n = arg min

θ(1)Θ1

d(n)1 θ(1)

andd1 θ(1)0

=0, we have d1(n)

θˆ(1)n

≤ sup

θ(1)Θ1

d(n)1 θ(1)

d1

θ(1). (2)

Inequalities (1) and (2) implies that

nkθˆn(1)−θ(1)0 k> ǫo



η <2 sup

θ(1)Θ1

d(n)1 θ(1)

d1 θ(1)



. and then

Pθ(1)

hkθˆ(1)n −θ(1)0 k> ǫi

≤Pθ(1)

 sup

θ(1)Θ1

d1(n) θ(1)

d1

θ(1)> η/2

.

Hence we conclude by Assumption 3 that

nlim−→∞

Pθ(1)

hkθˆ(1)n −θ(1)0 k> ǫi

=0,

which means that ˆθ(1)n −−→Pr θ(1)0 . Next, let us check that ˆθ(2)n −−→Pr θ(2)0 . Similarly as above Θ2 is a compact set and B

θ(2)0 , ǫ

⊂Θ2is an open ball with centerθ(2)0 and radiusǫ >0. By Assumptions 1 and 2 there exists ˜η,ǫ >˜ 0 such that

∀θ=

θ(1), θ(2)

Bc0,ǫ)˜ , d2(θ)≥η.˜

(7)

Without loss of generality, we assume thatd2

θ(1)0 , θ(2)0

=0. Then, for any ˆθnBc0,ǫ), we have˜ d(n)2

θˆn(1),θˆn(2)

≥ η˜−sup

θΘ

d(n)2 (θ)−d2(θ). (3)

Because ˆθ(2)n =arg min

θ(2)Θ2

d2(n)

θˆ(1), θ(2)

we have d2(n)

θˆ(1)n ,θˆ(2)n

≤sup

θΘ

d(n)2 (θ)−d2(θ)+d2 θˆn(1), θ0(2)

. (4)

Inequalities (3) and (4) implies that nkθˆ(2)n −θ(2)0 k> ǫo

⊆ (

˜ η <2 sup

θΘ

d2(n)(θ)−d2(θ)+d2

θˆ(1)n , θ(2)0 ) , and then

Pθh

kθˆ(2)n −θ(2)0 k> ǫi

≤Pθ

"

˜

η/2<sup

θΘ

d(n)2 (θ)−d2(θ)+d2

θˆn(1), θ0(2)# . By Assumption 3 we have

sup

θΘ

d2(n)(θ)−d2(θ)−−−−→Pr

n→∞ 0.

Since ˆθ(1)n −−−−→Pr

n→∞ θ0(1)andd2is continuous atθ0, it follows thatd2

θˆ(1)n , θ(2)0 Pr

−−−−→

n→∞ 0.Thus we obtain that ˆθ(2)n −−→Pr θ(2)0 . Next, we prove that Assumptions 2 and 3 of Lemma 1 are satisfied in our set-up, leading to consistency.

Theorem 2. Under the following assumptions:

(A1) Θis a compact set such thatθ0∈Θ˚ andβ0,0;

(A2) X is a bounded random vector;

(A3) LetA ⊂Rpsuch thatµp

A

=0. There exist x1, . . . ,xp+1∈ Asuch that a)i∈ {1, . . . ,p+1}, fX(xi)>0

b) For any i∈ {1, . . . ,p+1}we setx˜Ti = 1 xTi

. Thenx˜1, . . . ,x˜p+1are linearly independent.

we haveθˆn−−−−→nPr

→∞ θ0.

P. To show that ˆθnconverges in probability toθ0 we must check Assumptions 2 and 3 of Lemma 1 sinceΘis a compact set by Assumption (A1). We begin by showing that fori∈ {1,2},θ7−→di(θ) is a continuous map.

θ(1)7−→d1 θ(1)

is continuous. We have d1

θ(1)

= Z

Rp

Eθ

0

Dx

T N

m(1)θ(1)(x) 2

dFX(x)

= Z

Rp

Eθ

0

Dx

T N

m(1)

θ(1)0 (x)

+

m(1)

θ(1)0 (x)−m(1)θ(1)(x) 2

dFX(x)

= d1 θ(1)0

+ Z

Rp

m(1)

θ(1)0 (x)−m(1)θ(1)(x) 2

dFX(x).

Asd1 θ(1)0

is a constant, let us check the continuity ofθ(1)7−→R

Rp

m(1)

θ(1)0 (x)−m(1)θ(1)(x) 2

dFX(x).We denote by fθ(1)(1)(x)=

γ0T

N eβT0x−γT N eβTx

2

fX(x).

(8)

For anyx∈Rp, θ(1) 7−→ fθ(1)(1)(x) is a continuous function and can be bounded as follows:

fθ(1)(1)(x)≤ γ0T

N ekβ0k.kxk+γT N ekβk.kxk

2

fX(x). Asθ(1)∈Θ1a compact set, then there exist two constantsk1,k2>0 such that

fθ(1)(1)(x)≤k1ek2kxkfX(x). Using Assumption (A2) we deduce that

fθ(1)(1)(x)≤C1fX(x)∈L1 µp

whereC1is a constant. Hence, applying the dominated convergence theorem, we obtain the continuity of θ(1)7−→

Z

Rp

f(1)

θ(1)(x)dFX(x). Finally we deduce thatθ(1) 7−→d1

θ(1)

is a continuous map. We obtain similarly the continuity ofθ=

θ(1)0 , θ(2) 7−→

d2(θ). Next we prove thatd1admits a unique minimum atθ(1)0 . d1admits a minimum atθ(1)0 ∈Θ˚1. We have

d1 θ(1)

= d1 θ0(1)

+ Z

Rp

m(1)

θ(1)0 (x)−m(1)θ(1)(x) 2

dFX(x).

Thus we deduce that for anyθ(1)∈Θ1, d1 θ(1)0

d1 θ(1)

sinceR

Rp

m(1)

θ(1)0 (x)−m(1)θ(1)(x)2

dFX(x)≥0.

Uniqueness ofθ(1)0 . We see that d1 θ(1)0

= d1 θ(1)

ifR

Rp

m(1)

θ0(1)(x)−m(1)θ(1)(x) 2

dFX(x) = 0. Thus to check the uniqueness ofθ(1)0 , first note that:

Z

Rp

m(1)

θ(1)0 (x)−m(1)θ(1)(x)2

dFX(x)= Z

Rp

γ0eβT0x−γeβTx2

fX(x)dµp(x)=0.

From assumption (A3), there exist at leastx1, . . . ,xp+1∈ A ⊂Rpsuch that fX(xi)>0 andµp A

=0, it implies that for anyi∈ {1, . . . ,p+1}

γ0eβT0xi =γeβTxi (5)

then, fori∈ {1, . . . ,p+1}

lnγ0T0xi=lnγ+βTxi. However, the last equality can be written as follows:







1 xT1 ... ... 1 xTp+1







lnγ β

!

=





lnγ0T0x1 ... lnγ0T0xp+1





⇔ lnγ β

!

=







1 xT1 ... ... 1 xTp+1







1







1 xT1 ... ... 1 xTp+1







lnγ0 β0

! ,

because ˜x1, . . . ,x˜p+1are linearly independent, we deduce thatγ0=γandβ0 =β.

(9)

d2(θ)admits a minimum atθ0∈Θ.˚ We have d2

θ(1)0 , θ(2)

= d20)+ Z

Rp

m(2)

θ(2)0

x, θ(1)0

m(2)θ(2) x, θ(1)0 2

dFX(x). Thus we deduce that∀θ(2)∈Θ2, d20)≤d2

θ(1)0 , θ(2) since Z

Rp

m(2)

θ(2)0

x, θ(1)0

m(2)θ(2) x, θ(1)0 2

dFX(x)≥0.

Uniqueness ofθ0(2). We have Z

Rp

m(2)

θ0(2)

x, θ(1)0

m(2)θ(2) x, θ(1)0 2

dFX(x)

= Z

Rp

γ20T 0eβT0x+

γ0T N eβT0x

220T

N −γ20T NαeβT0x

γ0T N eβT0x

2

−τ2T N

2dFX(x)

= Z

Rp

γ20T

0eβT0x20T N −γ20T

NαeβT0x−τ2T N

2dFX(x)=0.

From assumption (A3), there exist at least x1, . . . ,xp+1 ∈ Asuch that fX(xi)>0 andµp

A

=0, it implies that for anyi∈ {1, . . . ,p+1}

γ20 α0 −γ20

α

eβT0xi2−τ20. (6)

In this case, ifα,α0theneβT0xi =eβT0xjfor anyiandj. It follows thateβT0(xixj)=1 for anyi, j. This implies thatβ0 is orthogonal to Spann

xixj; 1≤i< jp+1o

. Thusβ0 =0 which cannot hold sinceβ0 ,0 by Assumption (A1).

Then we deduce thatα=α0andτ220. Finally we conclude thatd2(θ) admits a unique minimum atθ0∈Θ.˚ In the sequel we prove a little bit more than Assumption 3 of Lemma 1 since almost sure uniform convergence results are obtained.

Almost sure convergence of sup

θ1Θ1

d(n)1 θ(1)

d1

θ(1)to zero. Taking into account that covariatesXiare uniformly bounded with respect toi, we have to verify that

sup

θ(1)Θ1

d(n)1 θ(1)

d1 θ(1)

= sup

θ(1)Θ1

1 n

Xn i=1



1 N

XN j=1

∆D(i)X

i

tj

m(1)θ(1)(Xi)2



−E



1 N

XN j=1

Eθ

0

∆D(i)X

i

tj

m(1)θ(1)(Xi)2





−−−−→na.s.

→∞ 0.

LetG1=n

w∈Rp+N7−→g(1)θ(1)(w) ;θ(1)∈Θ1⊂Rp+1o

be a collection of measurable functions indexed by a bounded setΘ1such thatg(1)θ(1)is defined as follows:

g(1)θ(1)(Wi) = g(1)θ(1)

X(1)i , . . . ,Xi(p),D(i)X

i(t1), . . . ,D(i)X

i(tN)

= 1 N

XN j=1

∆D(i)X

i

tj

m(1)θ(1)(Xi)2

= 1 N

XN j=1

D(i)X

i

tj

D(i)X

i

tj1

−γT N eβTXi

2

,

(10)

whereWi=

Xi(1), . . . ,X(ip),D(i)X

i(t1), . . . ,D(i)X

i(tN)

, for anyi∈ {1, . . . ,n}, are i.i.d. random vectors inRp+N. Thus our goal is to check that

sup

θ(1)Θ1

1 n

Xn i=1

g(1)θ(1)(Wi)−Eh

g(1)θ(1)(Wi)i

−−−−→na.s.

→∞ 0, (7)

where

Eh

g(1)θ(1)(Wi)i

= Z

Rp

1 N

XN j=1

Eθ

0

∆D(i)x tj

m(1)θ(1)(x)2

fX(x) dµp(x)

= Z

Rp

Eθ

0

∆Dx

T N

m(1)θ(1)(x) 2

fX(x) dµp(x).

We note that the convergence in (7) is true wheneverG1is Glivenko-Cantelli (van der Vaart and Wellner (1996) or van der Vaart (1998)). Note that we have the following decomposition:

g(1)

θ(1)(Wi) = 1 N

XN j=1

∆D(i)X

i

tj

−γT N eβTXi

2

= 1 N

XN j=1

∆D(i)X

i

tj

2

− 2 N

XN j=1

∆D(i)X

i

tj

γT N eβTXi+

γT N eβTXi

2

C1(Wi)+C2(Wi)γeβTXi+C3 γeβTXi2

,

whereC1(Wi) andC2(Wi) only depend on the lastNcomponents ofWiandC3 =T/N. Moreover we have that for anyw∈Rp+N(1)7−→g(1)

θ(1)(w) is a continuous function. To prove thatG1is Glivenko-Cantelli it is sufficient to show, using Example 19.8 in van der Vaart (1998), thatG1has an integrable envelope functionG1, that is:

• sup

θ(1)Θ1

|gθ(1)(w)| ≤G1(w) for allw∈Rp+N,

• E[G1(W1)]<+∞. In this case, forγ≤Υ, we have

w∈Rp+N,G1(w)=C1(w)+C2(w)Υekβk×kxk+C3Υ2e2kβk×kxk,

wherexis thep-component sub-vector ofw. Because by (A1(1)=(γ, β) belongs to the compact setΘ1and since by (A2) we havekXik ≤κalmost surely, we obtain

E[G1(W1)]≤ γ2T Nαeκkβk+

γT N eκkβk

22T

N

! + Υ

γT N eκkβk

eκkβk+C3Υ2ekβk<+∞.

Thus it follows thatG1 is Glivenko-Cantelli. By similar arguments we prove also the almost sure convergence of sup

θΘ

d(n)2 (θ)−d2(θ)to zero. Finally, applying Lemma 1 we obtain that ˆθn

−−→Pr θ0asn→+∞. Remark 1. From Equation (6), the parameterβ0 must be different from zero. Indeed ifβ0 =0 bothγandβcan be identified by (5), however Equation (6) becomes

γ20 α0 −γ20

α =τ2−τ20, which is satisfied by many couples

α, τ2

. Hence ifβ0=0 we lose the identifiability ofαandτ2.

(11)

4.2. Asymptotic normality

We now provide the result about asymptotic normality of our estimator. First let us remark that the matrix of partial derivatives ofd1(n)atθ0(1)and ofd2(n)atθ0can be viewed as a sum of independent random vectors







∂d1(n)

∂θ(1) θ(1)0

∂d(n)2

∂θ(2)0)





= 1 n

Xn i=1

XN j=1











−2T N2eβT0xi

∆D(i)x

i

tj

m(1)

θ(1)(xi)

−2T N2γ0xieβT0xi

∆D(i)x

i

tj

m(1)θ(1)(xi) 2T N2γ20α02eβT0xi

∆D(i)xi tj

2

m(2)θ(2) xi, θ(1)

−2T N2

∆D(i)xi tj

2

m(2)θ(2) xi, θ(1)











= 1 n

Xn i=1

XN j=1

Vxi,j.

For anyn≥1, we denote by:

In(1)(θ) = ∂2d(n)1

∂θ(1)∂θ(1)T θ(1)

, In(2)(θ) = ∂2d(n)2

∂θ(2)∂θ(2)T

θ(1), θ(2)

and

I(3)n (θ)= ∂2d(n)2

∂θ(1)∂θ(2)T

θ(1), θ(2) , three matrices. For 1≤k≤3, we setI(k)(θ)= lim

n→∞In(k)(θ) (provided it exists) and we denote by I0)= I(1)0) 0

I(3)0) I(2)0)

! ,

which is defined in Appendix A.

Theorem 3. If(A1A3)and the following assumptions are fulfilled (A4) for anyθ∈Θ, I(θ)is invertible,

(A5) forρ1∈ {0,1,2,4}andρ2∈ {1, . . . ,7}, there existǫ >0and deterministic functions Eρ12such that:

sup

βB(β0,ǫ)

1 n

Xn i=1

xiρ1eρ2βTxiEρ12(β) −−−−−→n

−→∞ 0, where

xiρ1=







1 si ρ1=0, xi si ρ1=1, xixTi si ρ1=2, xixTi xi2 si ρ1=4.

then we have

n

θˆn−θ0 d

−−−−−→

n−→∞ N(0,M), where the variance-covariance matrixMis defined by

M=

I10)T

Σ()I10), and whereΣ(), defined in Appendix A, is the limit ofΣ(n)= 1n

Pn i=1

PN j=1

Cov Vxi,j

when n tends to infinity.

P. Applying a first order Taylor’s expansion to∂d(n)1 /∂θ(1)at ˆθ(1)n , we obtain that

∂d(n)1

∂θ(1) θˆ(1)n

=0Rp+1 =∂d1(n)

∂θ(1) θ(1)0

+ ∂2d(n)1

∂θ(1)∂θ(1)T

θ(1)n θˆ(1)n −θ(1)0 ,

Références

Documents relatifs

Abstract: In this short note, we show how to use concentration inequalities in order to build exact confidence intervals for the Hurst parameter associated with a

The aim of this paper is to propose confidence intervals for the Hurst parameter based on a single observation of a discretized sample path of the interval [0, 1] of a

the time reversed process is a drifted fractional Brownian motion, which continuously extends the one obtained in the theory of time reversal of Brownian diffusions when H = 1/2..

Let us mention Foddy (1984) (dealing with the particular case of a Brownian motion with identity covariance matrix), Baccelli and Fayolle (1987) (on a diffusion having a quite

The lemma hereafter gives an expression of the non-exit probability for Brownian motion with drift a in terms of an integral involving the transition probabilities of the

Our study reveals that the differences seen in the averaging principle at the continuous-time level also appear for the discretization: in the fractional Brownian motion case,

Abstract: In this short note, we show how to use concentration inequal- ities in order to build exact confidence intervals for the Hurst parameter associated with a

In the critical case H = 1/6, our change-of-variable formula is in law and involves the third derivative of f as well as an extra Brownian motion independent of the pair (X, Y