Villa, Cristiano (2016) Bayesian estimation of the threshold of a generalised pareto distribution for heavy-tailed observations. TEST, 26 (1). pp. 95-118. ISSN 1133-0686. (doi:10.1007/s11749-016-0501-7) (KAR id:57598)
PDF
Publisher pdf
Language: English
This work is licensed under a Creative Commons Attribution 4.0 International License.
|
|
Download this file (PDF/178kB) |
![]() |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/s11749-016-0501-7 |
Abstract
In this paper, we discuss a method to define prior distributions for the threshold of a generalised Pareto distribution, in particular when its applications are directed to heavy-tailed data. We propose to assign prior probabilities to the order statistics of a given set of observations. In other words, we assume that the threshold coincides with one of the data points. We show two ways of defining a prior: by assigning equal mass to each order statistic, that is a uniform prior, and by considering the worth that every order statistic has in representing the true threshold. Both proposed priors represent a scenario of minimal information, and we study their adequacy through simulation exercises and by analysing two applications from insurance and finance.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1007/s11749-016-0501-7 |
Uncontrolled keywords: | Extreme values; Generalised Pareto distribution; Heavy tails; Kullback–Leibler divergence; Self-information loss |
Subjects: | H Social Sciences > HA Statistics |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science |
Depositing User: | Cristiano Villa |
Date Deposited: | 30 Sep 2016 15:10 UTC |
Last Modified: | 05 Nov 2024 10:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/57598 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):