• Aucun résultat trouvé

A simple estimator for the M-index of functions in M

N/A
N/A
Protected

Academic year: 2022

Partager "A simple estimator for the M-index of functions in M"

Copied!
7
0
0

Texte intégral

(1)

HAL Id: hal-01142162

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

Preprint submitted on 14 Apr 2015

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.

A simple estimator for the M-index of functions in M

Meitner Cadena

To cite this version:

Meitner Cadena. A simple estimator for the M-index of functions in M. 2015. �hal-01142162�

(2)

A simple estimator for the M -index of functions in M

Meitner Cadena

Abstract

An estimator for theM-index of functions ofM, a larger class than the class of regularly varying (RV) functions, is proposed. This index is the tail index of RV func- tions and this estimator is thus a new one on the class of RV functions. This estimator satisfies, assuming suitable conditions, strong consistency. Asymptotic normality of this estimator is proved for a large class of RV functions.

Keywords: estimator; regularly varying function; weak consistency; strong consis- tency; extreme value theory

AMS classification: 62G05; 62G30

1 Introduction

A measurable functionU:R+→R+is aregularly varying(RV) function if (see [9] and e.g.

[1]), for someα∈R, for anyt>0,U(t x)±

U(x)→tα(x→ ∞). αis called the tail index of U. Ifα=1,Uis aslowly varying(SV) function.RVαdenotes the class of RV functions with tail indexαandSVthe class of SV functions.

A main concern in extreme value theory (EVT) is the estimation of the tail index of RV functions that are tails of distribution functions. Many estimators of this index have been proposed. The best known estimator among them is one proposed by Hill [8] in 1975, which shows favorable features to be used than other competitors (see e.g. [11], pp. 1181- 1182).

Cadena and Kratz [2] introduced in 2014 the classM which consists of measurable func- tionsU:R+→R+satisfying

α∈R,ε>0, lim

x→∞

U(x)

xα+ǫ =0 and lim

x→∞

U(x)

xαǫ = ∞. (1)

One can prove thatαin (1) is unique, which we call in this paper theM-index ofU. Fur- thermore, using Proposition 2.1, one can prove thatRV ⊆M and thatαin (1) is the tail index ofU ifURVα.

All over this paperX is a positive random variable (r.v.) with distributionF(x)=P(Xx) and distribution tailF(x)=1−F(x)=P(X >x). Suppose that the endpoint ofF is

UPMC Paris 6 & CREAR, ESSEC Business School; E-mail: meitner.cadena@etu.upmc.fr or b00454799@essec.edu

(3)

infinite, i.e. x=sup©

x:F(x)<1ª

= ∞. LetX1, . . . , Xn be independent and identically distributed (i.i.d.) r.v.s with distributionF and letX1:n≤ ··· ≤Xn:nbe the order statistics of this sample. The empirical distribution function ofF is defined by, forx>0,Fn(x)= n1Pn

i=1I{Xix}, whereIAdenotes the indicator function ofA. We denote byFn=1−Fn

its empirical tail of distribution.

a.s.

→,→p, and→d are convergences almost surely (a.s.), in probability, and in distribution respectively, log(x) is the natural logarithm ofx,x⌋is the highest integer≤x,op(1) is a sequence of random values that converges to 0 in probability, andOp(1) is such sequence bounded in probability (see e.g. [12]).

AssumeF∈M withM-index−1± α(<0).

Assumek=k(n) is a sequence of positive integers satisfying 1≤kn−1, k→ ∞, and k±

n→0 as n→ ∞. (k)

We aim to formulate an estimator forα. To this aim, we notice that, applying Proposition 2.1, log¡

F(x)¢±

log(x)→ −1±

α(x→ ∞). Then, a natural estimator ofαis, for 0≤k<n, ˆ

α= − log(Xnk:n) log³

Fn(Xnk:n)´. This may be rewritten as

ˆ

α=log(Xnk:n) log¡

n±

k¢ . (2)

Then, in this note, the following results are proved.

Theorem 1.1(Weak consistency of ˆα). Let X1, . . . , Xnbe i.i.d. r.v.s with continuous distri- bution F such that its tail F belongs toMwithM-index−1±

α(α>0). Let X1:n≤ ··· ≤Xn:n

be its order statistics. Then, if (k)is satisfied, ˆ

αp α (n→ ∞). (3)

Theorem 1.2(Strong consistency of ˆα). Let X1, . . . , Xnbe i.i.d. r.v.s with continuous distri- bution F such that its tail F belongs toMwithM-index−1±

α(α>0). Let X1:n≤ ··· ≤Xn:n

be its order statistics. Then, if k=k(n)= ⌊nδ,0<δ<1, ˆ

αa.s.α (n→ ∞).

Theorem 1.3(Asymptotic normality of ˆα). Assume that F is a continuous distribution with tail F satisfying F(x)=xα¡

1+o(xβ

as x→ ∞, for positive constantsαandβ. Let X1, . . . , Xnbe i.i.d. r.v.s with distribution F , and let X1:n≤ ··· ≤Xn:nbe its order statistics. Then, if (k)is satisfied,

pklog³n k

´µ1 ˆ α−1

α

d

→N¡ 0,α2¢

(n→ ∞). (4)

(4)

2 Proofs

Proposition 2.1. Let U:R+→R+be a measurable function. Then, U ∈MwithM-index α=τiff log (U(x))±

log(x)→η(x→ ∞).

This result was given by [2] and for the sake of completeness of this note, we give its proof, part of it being copied from [2].

Proof.LetU:R+→R+be a measurable function and letǫ>0.

AssumeU∈M withM-indexα=τ. Then, by definition,

xlim→∞

U(x)

xτ+ǫ =0 and lim

x→∞

U(x) xτǫ = ∞. Hence, there existsx0≥1 such that, forxx0,

U(x)ǫxτ+ǫ and U(x)≥1 ǫxτǫ.

Applying the logarithm function to these inequalities and dividing them by log(x) (with x>1) provide

log (U(x))

log(x) ≤log (ǫ)

log(x)+τ+ǫ and log (U(x))

log(x) ≥ −log (ǫ)

log(x)+τǫ, and, one then has

xlim→∞

log (U(x))

log(x) ≤τ+ǫ and lim

x→∞

log (U(x))

log(x) ≥τǫ, from which, takingǫarbitrary, the assertion follows.

Conversely, assume log (U(x))±

log(x)→η(x→ ∞). Then, there existsx0>1 such that, forxx0,|log(U(x))±

log(x)−τ| ≤ǫ± 2.

Writing, forw∈© ǫ,ǫª

, U(x) xτ+w =exp

½

log(x)×

µlog(U(x))

log(x) −τw

¶¾

gives

expn

log(x)׳

ǫ 2−w´o

U(x)

xτ+w ≤expn

log(x)׳ǫ 2−w´o

, and then,

xlim→∞

U(x) xτ+ǫ ≤ lim

x→∞expn

log(x)׳ǫ 2−ǫ´o

=0 and

xlim→∞

U(x) xτǫ ≥ lim

x→∞expn

log(x)׳ǫ 2+ǫ´o

= ∞.

These two limits provideU∈MwithM-indexα=τ. This completes the proof.

(5)

Lemma 2.1. Let X1, X2, . . . be i.i.d. r.v.s with distribution F:R+→R+. Let X1:n≤ ··· ≤Xn:n

be its order statistics. Then, if (k)is satisfied, Xnk:n

a.s.→ ∞ (n→ ∞).

Proof.Applying the proof of Lemma 3.2.1 given in [5], which is independent of the distri- butionF.

Lemma 2.2. Let E1, . . . , En be i.i.d. r.v.s with standard exponential distribution F . Let E1:n≤ ··· ≤En:nbe its order statistics. Then, if (k)is satisfied,

pk³

Enk:n−log³n k

´´

is asymptotically standard normal as n→ ∞. Proof. LetU =(1−F),U(x)=inf©

y :F(y)≥1−1± yª

. Since 1−F(x)=ex we have U(x)=log(x).Then, by Theorem 2.1.1 of [5],

pkEnk:nU¡n

k

¢

n kU¡n

k

¢ =p

kEnk:n−log¡n

k

¢

n

k×kn =p k³

Enk:n−log³n k

´´

is asymptotically standard normal asn→ ∞, supposing (k).

Lemma 2.3. Let E1, . . . , En be i.i.d. r.v.s with standard exponential distribution F . Let E1:n≤ ··· ≤En:nbe its order statistics. Then, if (k)is satisfied,

Enk:n

log¡n

k

¢

p 1 (n→ ∞).

Proof.Application of Lemma 2.2 and e.g. [12], exercice 18, page 24.

Proof of Theorem 1.1. By hypothesis we have log(F(x))±

log(x)→ −1±

α(x→ ∞). Then, noting thatXnk:n→ ∞(n→ ∞) by Lemma 2.1, we have

nlim→∞

log(Xnk:n) log¡n

k

¢ = lim

n→∞

log(Xnk:n)

log(F(Xnk:n))×log(F(Xnk:n)) log¡n

k

¢

a.s.= −αlim

n→∞

log(F(Xnk:n)) log¡n

k

¢ ,

from which, noting that−log(F(X)) is a r.v. following a standard exponential distribution G(see e.g. [6], page 18),−log(F(X1)), . . . ,−log(F(Xn)) is a sample of i.i.d. r.v.s following G, and−log(F(X1:n)), . . . ,−log(F(Xn:n)) is its order statistics (see e.g. [6], page 20), then applying Lemma 2.3, follows

nlim→∞αˆ= lim

n→∞

log(Xnk:n) log¡n

k

¢

=pα.

This concludes the proof.

Lemma 2.4(Lemma 5.1 given by Davis and Resnick (1984) [4]). Let E1, . . . , Enbe i.i.d. r.v.s with standard exponential distribution F . Let E1:n≤ ··· ≤En:nbe its order statistics. Then, if k=k(n)= ⌊nδ,0<δ<1,

Enk:n−log³n k

´a.s.

→0 (n→ ∞).

(6)

Proof of Theorem 1.2. Using Lemma 2.4 instead of Lemma 2.3 in the proof of Theorem 1.2.

Lemma 2.5(Lemma given in [7], page 40). Supposeλ>0. If (k), then

−1 λ

nk

X

j=1

Enj+1

nj+1= −1 λlog³n

k

´ +log¡

1+Op(k1/2.

Proof of Theorem 1.3. Applying the transformationx7→x1used by Hall in [7] to have simpler notations,F(x)=xα¡

1+o(xβ

asx→ ∞becomesF(x)=xα¡

1+o(xβ

asx→0+. This expression we may write, ast→0+,

F1(t)=t1/αeo(tβ). (5)

LetE1, . . . ,Enbe independent standard exponential r.v.s. Define Sk=

nk+1

X

j=1

Enj+1

nj+1=

nk+1

X

j=1

Enj+1−1 nj+1 +log

µk+1 n

¶ +log¡

1+O(k1)¢ .

Then, by Rényi’s representation of order statistics (see [10] and e.g. [3], page 21), we may write 1±

Xk:n=F1¡ eSk¢

fork= 1, . . . ,n. It now follows from (5) that log(Xk:n)= 1

αSk+op(eβSk), (6) Applying Lemma 2.5 to (6) gives

log(Xk:n)= 1 α

nk+1

X

j=1

Enj+1−1 nj+1 +1

αlog³ n k+1

´

+1 αlog¡

1+Op((k+1)1/2)¢ +op¡

((k+1)/n)β(1+Op((k+1)1/2)β¢

= 1 α

nk+1

X

j=1

Enj+1−1 nj+1 +1

αlog³ n k+1

´ +

µ 1+1

α

op(1). (7)

The mean ofα1Pnk+1 j=1

¡Enj+1−1¢ ±

(n−j+1) is 0 and its variance 1

α2

n

X

j=k

1 j2∼ 1

2 (n→ ∞), wheref(x)∼g(x) (x→ ∞) meansf(x)±

g(x)→1 (x→ ∞). Hence, log¡ Xk:n

¢−α1log¡ n±

k¢ is asymptoticallyN¡

0,k1α2¢

asn→ ∞, and (4) then follows. This completes the proof.

Acknowledgments

I am indebted to Prof. Einmahl for having pointed out an error in the formulation of (4). I acknowledges the support of SWISS LIFE through its ESSEC research program on

’Consequences of the population ageing on the insurances loss’.

(7)

References

[1] N. Bingham, C. Goldie, J. Teugels, Regular Variation. Cambridge University Press (1989).

[2] M. Cadena and M. Kratz, An extension of the class of regularly varying functions.

arXiv:1411.5276 [math.PR], (2014).

[3] H. David, Order Statistics.John Wiley & Sons, Inc.(1981).

[4] R. Davis, S. Resnick, Tail Estimates Motivated by Extreme Value Theory.Ann. Stat.12, (1984) 1467-1487.

[5] L. de Haan, A. Ferreira, Extreme Value Theory. An Introduction.Springer, (2006).

[6] J. Galambos, S. Kotz, Characterizations of Probability Distributions. (Lecture Notes in Mathematics).Springer, (1978).

[7] P. Hall, On Some Simple Estimates of an Exponent of Regular Variation.Journal of the Royal Statistical Society. Series B (Methodological)44, (1982) 37-42.

[8] B. Hill, A Simple General Approach to Inference About the Tail of a Distribution.Ann.

Stat.3, (1975) 1163-1174.

[9] J. Karamata, Sur un mode de croissance régulière des fonctions.Mathematica (Cluj) 4, (1930) 38-53.

[10] A. Rényi, On the theory of order statistics.Acta Mathematica Academiae Scientiarum Hungaricae3-4, (1953) 191-231.

[11] R. Smith, Estimating Tails of Probability Distributions. Ann. Stat.15, (1987) 1174- 1207.

[12] A. van der Vaart, Asymptotic Statistics.Cambridge University Press, (1998).

Références

Documents relatifs

models, the Lokal-Modell (LM) and the Regional Atmospheric Modeling System (RAMS), coupled with an explicit dust emission model have previously been used to simulate mineral dust

In order to show that the theory of Liouville functions is the limit theory of generic polynomials, it remains to show that the inductive axioms are also satisfied.. Using

Nous avons décidé d'étudier et d'optimiser le doublage intracavité dans un OPO pour produire le rayonnement visible [MDB08]. Nous avons construit un oscillateur qui génère

A model of conditional var of high frequency extreme value based on generalized extreme value distribution [j]. Journal of Systems &amp; Management,

The methodologies introduced in [Worms (2014)], in the heavy-tailed case, are adapted here to the negative extreme value index framework, leading to the definition of weighted

Abstract This paper presents new approaches for the estimation of the ex- treme value index in the framework of randomly censored (from the right) samples, based on the ideas

(2011), who used a fixed number of extreme conditional quantile estimators to estimate the conditional tail index, for instance using the Hill (Hill, 1975) and Pickands (Pickands,