Content deleted Content added
No edit summary |
Open access status updates in citations with OAbot #oabot |
||
(6 intermediate revisions by 4 users not shown) | |||
Line 1:
The '''Panjer recursion''' is an [[algorithm]] to compute the [[probability distribution]] approximation of a compound [[random variable]]
<math>S = \sum_{i=1}^N X_i\,</math>
where both <math>N\,</math> and <math>X_i\,</math> are [[random variable]]s and of special types. In more general cases the distribution of ''S'' is a [[compound distribution]]. The recursion for the special cases considered was introduced in a paper <ref>{{cite journal|last=Panjer|first=Harry H.|year=1981|title=Recursive evaluation of a family of compound distributions.| journal=ASTIN Bulletin|volume=12|issue=1|pages=22–26|publisher=[[International Actuarial Association]]|url=http://www.casact.org/library/astin/vol12no1/22.pdf|
== Preliminaries ==
Line 21:
The Panjer recursion makes use of this iterative relationship to specify a recursive way of constructing the probability distribution of ''S''. In the following <math>W_N(x)\,</math> denotes the [[probability generating function]] of ''N'': for this see the table in [[(a,b,0) class of distributions]].
In the case of claim number is known, please note the ''De Pril'' algorithm.<ref>Vose Software Risk Wiki: http://www.vosesoftware.com/riskwiki/Aggregatemodeling-DePrilsrecursivemethod.php</ref>
== Recursion ==
Line 53:
|issue = 4
|pages = 53–72
|doi = 10.21314/JOP.2009.068
|s2cid = 4992848
|citeseerx = 10.1.1.413.5632}}</ref>
== References ==
|