An Entropic View of Pickands' Theorem - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

An Entropic View of Pickands' Theorem

Abstract

It is shown that distributions arising in Renyi-Tsallis maximum entropy setting are related to the generalized Pareto distributions (GPD) that are widely used for modeling the tails of distributions. The relevance of such modelization, as well as the ubiquity of GPD in practical situations follows from Balkema-De Haan-Pickands theorem on the distribution of excesses (over a high threshold). We provide an entropic view of this result, by showing that the distribution of a suitably normalized excess variable converges to the solution of a maximum Tsallis entropy, which is the GPD. This result resembles the entropic approach to the central limit theorem; however, the convergence in entropy proved here is weaker than the convergence in supremum norm given by Pickandspsila theorem.
Fichier principal
Vignette du fichier
isit2008.pdf (59.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00621924 , version 1 (17-03-2016)

Identifiers

Cite

Jean-François Bercher, Christophe Vignat. An Entropic View of Pickands' Theorem. International Symposium on Information Theory (ISIT 2008), Jul 2008, Toronto, Canada. pp.2625-2628, ⟨10.1109/ISIT.2008.4595467⟩. ⟨hal-00621924⟩
140 View
155 Download

Altmetric

Share

Gmail Facebook X LinkedIn More