pith. sign in

arxiv: 1111.4469 · v1 · pith:DW3K2BXNnew · submitted 2011-11-18 · 📊 stat.ME

On the Pickands stochastic process

classification 📊 stat.ME
keywords processequationpickandsstochasticconvergenceextremalfracindex
0
0 comments X
read the original 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 $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 $P_n$ in $\ell^{\infty}([a,b])$ to some Gaussian process $$\{\mathbb{G},a\leq s \leq b\} $$ for all $[a,b] \subset]0,1[$. This frame greatly simplifies the former results and enable applications based on stochastic processes methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.