Finding Efficient Recursions for Risk Aggregation by Computer Algebra

Details Finding Efficient Recursions for Risk Aggregation by Computer Algebra Finding Efficient Recursions for Risk Aggregation by Computer Algebra

2007-07-20

arxiv.org/abs/0707.3028v1

Mathematics

Probability

Scientific paper

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D-finite functions.

Affiliated with

Also associated with

No associations

Rating

Finding Efficient Recursions for Risk Aggregation by Computer Algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding Efficient Recursions for Risk Aggregation by Computer Algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Efficient Recursions for Risk Aggregation by Computer Algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-398734