利用计算机代数寻找风险聚集的有效递归
Finding Efficient Recursions for Risk Aggregation by Computer Algebra
摘要:
本文用计算机代数方法导出了随机和的概率分布的递推公式。与著名的Panjer型递归不同,它们是有穷级的,因此允许在线性时间内计算。这种有效性是通过假设索赔额的概率母函数是代数的来获得的。索赔数的概率母函数被假定来自相当一般的D-有限函数类。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。