Computer Science – Information Theory
Scientific paper
2008-02-21
Computer Science
Information Theory
4 pages, accepted to ISIT08
Scientific paper
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 highlights the relevance of the so-called Tsallis distributions in many applications as well as some relevance to the use of the corresponding entropy.
Bercher Jean-Francois
Vignat Christophe
No associations
LandOfFree
An entropic view of Pickands' theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An entropic view of Pickands' theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An entropic view of Pickands' theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-579954