Recursions for Distribution Functions and Stop-Loss Transforms (Q4258732)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1336596
Language Label Description Also known as
default for all languages
No label defined
    English
    Recursions for Distribution Functions and Stop-Loss Transforms
    scientific article; zbMATH DE number 1336596

      Statements

      Recursions for Distribution Functions and Stop-Loss Transforms (English)
      0 references
      0 references
      0 references
      0 references
      14 September 1999
      0 references
      recursive evaluation
      0 references
      summation operator
      0 references
      aggregate claims
      0 references
      stop-loss transforms
      0 references
      Let \(\Gamma f(s)=\sum_{n=0}^s f(n)\), \(s=1,2,\dots\), be the summation operator for the function \(f\) with the usual properties \(\Gamma^0 f=f\), \(\Gamma^t=\Gamma(\Gamma^{t-1})\), \(t=1,2,\dots\) the authors proved a recursion formula for \(\Gamma^t\) when \(f\) itself satisfies a recursion of the type \[ f(s)=s^{-1}g(s)+\sum_{n=0}^s (a(n)+s^{-1}b(n))f(s-n),\;s=1,2,\dots. \] The proposed relations can be applied for exact and approximate evaluations of distribution functions and stop-loss transforms. As an example the stability conditions for recursions related to the number of claims in the individual risk theory are derived. These recursions for compound geometric distributions may be used to obtain upper and lower bounds for ruin probabilities in the classical ruin model.
      0 references

      Identifiers