Nobody1111
April 23rd 2007, 01:01 PM
If S (aggregate claim) is a random variable with compound Poisson distribution and X is a random variable describing amount of claim (we assume that realisations of X are positive integers) then using Pajner formula we can calculate P(S = k), k is positive integer. Panjer formula is a recursive formula and in order to find the value P(S=k) we need values P(S=0),...,P(S=k-1).
But this theorem is correct only for compound Poisson distribution. My question is: Is there any similar formula for other distributions (I mean a kind of any recursive formula)? I'm particularly interested in case if S is compound geometric distribution, but generalization for other distribution is also welcome. About random variable X we also assume that its realisations are positive integers.
Thank you for any comments.
Nobody1111
But this theorem is correct only for compound Poisson distribution. My question is: Is there any similar formula for other distributions (I mean a kind of any recursive formula)? I'm particularly interested in case if S is compound geometric distribution, but generalization for other distribution is also welcome. About random variable X we also assume that its realisations are positive integers.
Thank you for any comments.
Nobody1111