Learn R Programming

tailloss

Evaluate the probability in the upper tail of the aggregate loss distribution using different methods: Panjer recursion, Monte Carlo simulations, Markov bound, Cantelli bound, Moment bound, and Chernoff bound.

tailloss contains functions to estimate the exceedance probability curve of the aggregated losses. There are two 'exact' approaches: Panjer recursion and Monte Carlo simulations, and four approaches producing upper bounds: the Markov bound, the Cantelli bound, the Moment bound, and the Chernoff bound. The upper bounds are useful and effective when the number of events in the catalogue is large, and there is interest in estimating the exceedance probabilities of exceptionally high losses.

References

  • Gollini, I., and Rougier, J. C. (2015), "Rapidly bounding the exceedance probabilities of high aggregate losses", arXiv:1507.01853.

Copy Link

Version

Install

install.packages('tailloss')

Monthly Downloads

99

Version

1.0

License

GPL-2 | GPL-3

Issues

Pull Requests

Stars

Forks

Last Published

July 8th, 2015

Functions in tailloss (1.0)

fCantelli

Cantelli Bound.
UShurricane

US hurricane data
fChernoff

Chernoff Bound.
fPanjer

Panjer Recursion.
fMoment

Moment Bound.
zoombox

Function for zooming onto a matplot(x, y, ...).
tailloss-package

Evaluate the Probability in the Upper Tail of the Aggregate Loss Distribution
summary.ELT

Summary statistics for class ELT.
fMonteCarlo

Monte Carlo Simulations.
fMarkov

Markov Bound.
ELT

Event Loss Table
compressELT

Compress the event loss table