English

On the Pickands stochastic process

Methodology 2011-11-21 v1

Abstract

We consider the Pickands process {equation*} P_{n}(s)=\log (1/s)^{-1}\log \frac{X_{n-k+1,n}-X_{n-[k/s]+1,n}}{% X_{n-[k/s]+1,n}-X_{n-[k/s^{2}]+1,n}}, {equation*} {equation*} (\frac{k}{n}\leq s^2 \leq 1), {equation*} which is a generalization of the classical Pickands estimate Pn(1/2)P_{n}(1/2) of the extremal index. We undertake here a purely stochastic process view for the asymptotic theory of that process by using the Cs\"{o}rg\H{o}-Cs\"{o}rg\H{o}-Horv\'{a}th-Mason (1986) \cite{cchm} weighted approximation of the empirical and quantile processes to suitable Brownian bridges. This leads to the uniform convergence of the margins of this process to the extremal index and a complete theory of weak convergence of PnP_n in ([a,b])\ell^{\infty}([a,b]) to some Gaussian process {G,asb}\{\mathbb{G},a\leq s \leq b\} for all [a,b]]0,1[[a,b] \subset]0,1[. This frame greatly simplifies the former results and enable applications based on stochastic processes methods.

Keywords

Cite

@article{arxiv.1111.4469,
  title  = {On the Pickands stochastic process},
  author = {Gane Samb Lo and Adja Mbarka Fall},
  journal= {arXiv preprint arXiv:1111.4469},
  year   = {2011}
}
R2 v1 2026-06-21T19:38:20.059Z