Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Pickands stochastic process

Published 18 Nov 2011 in stat.ME | (1111.4469v1)

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 s2 \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 ℓ<sup>∞([a,b])\ell<sup>{\infty}([a,b]) to some Gaussian process G,a≤s≤b{\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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.