Abstract
A new formula for the ultimate ruin probability in the Cramér–Lundberg risk process is provided when the claims are assumed to follow a finite mixture of m Erlang distributions. Using the theory of recurrence sequences, the method proposed here shifts the problem of finding the ruin probability to the study of an associated characteristic polynomial and its roots. The found formula is given by a finite sum of terms, one for each root of the polynomial, and allows for yet another approximation of the ruin probability. No constraints are assumed on the multiplicity of the roots and that is illustrated via a couple of numerical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
