asymptotic tail probability
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 2)

H-INDEX

2
(FIVE YEARS 1)

Risks ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 122
Author(s):  
Franck Adékambi ◽  
Kokou Essiomle

In this paper, we derive a closed-form expression of the tail probability of the aggregate discounted claims under homogeneous, non-homogeneous and mixed Poisson risk models with constant force of interest by using a general dependence structure between the inter-occurrence time and the claim sizes. This dependence structure is relevant since it is well known that under catastrophic or extreme events the inter-occurrence time and the claim severities are dependent.


2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Eva-Maria Schopp

International audience Polynomial bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees, or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We mainly focuss on polynomial tails that arise due to heavy tail bounds of the toll term and the starting distributions. Besides estimating the tail probability directly we use a modified version of a theorem from regular variation theory. This theorem states that upper bounds on the asymptotic tail probability can be derived from upper bounds of the Laplace―Stieltjes transforms near zero.


Sign in / Sign up

Export Citation Format

Share Document