For any functions on the non-negative integers, we can evaluate the cumulative function given by (s) = sx=o(x) from the values of by the recursion (s) = (s - 1) + (s). Analogously we can use this procedure t times to evaluate the t-th order cumulative function t when itself satisfies a certain sort of recursion. We shall also derive recursions for the tth order tails t where (s) = x=s+1(x). The recursions can be applied for exact and approximate evaluation of distribution functions and stop-loss transforms of probability distributions. The class of recursions for includes the classes discussed by Sundt (1992), incorporating the class studied by Panjer (1981). We discuss in particular convolutions and compound functions.status: pub...
In this paper, we obtain recurrence relations for moment and conditional moment generating functions...
The marginal recursive equations on excess-of-loss reinsurance treaty are investignted, under the as...
AbstractThis paper explores the performance of a family of algorithms for computing the Walsh–Hadama...
For any function f on the non-negative integers, we can evaluate the cumulative function rf given by...
A simple recursion for the n-fold convolution of an arithmetic distribution with itself is developed...
Using a sequence of transformations of subsequent cumulative distribution functions, the connections...
The aim of this work is the calculation of compound distributions by using the algorithm known as th...
In this paper, we derive recurrence relations for cumulative distribution functions (cdf's) of bivar...
We study termination of higher-order probabilistic functional programs with recursion, stochastic co...
The recursive algorithm of HESSELAGER (1994) is extended to a more general class of counting distrib...
In the present note we deduce a class of bounds for the difference between the stop loss transforms ...
Recursions are derived for a class of compound istributions having a claim frequency distribution of...
Suppose XIX2,... are independent random variables, each with cumulative distribution function F(x) a...
textabstractThe use of Panjer's algorithm has meanwhile become a widespread standard technique for a...
AbstractThe paper presents a synthetic view of transformations that invert the order of evaluation o...
In this paper, we obtain recurrence relations for moment and conditional moment generating functions...
The marginal recursive equations on excess-of-loss reinsurance treaty are investignted, under the as...
AbstractThis paper explores the performance of a family of algorithms for computing the Walsh–Hadama...
For any function f on the non-negative integers, we can evaluate the cumulative function rf given by...
A simple recursion for the n-fold convolution of an arithmetic distribution with itself is developed...
Using a sequence of transformations of subsequent cumulative distribution functions, the connections...
The aim of this work is the calculation of compound distributions by using the algorithm known as th...
In this paper, we derive recurrence relations for cumulative distribution functions (cdf's) of bivar...
We study termination of higher-order probabilistic functional programs with recursion, stochastic co...
The recursive algorithm of HESSELAGER (1994) is extended to a more general class of counting distrib...
In the present note we deduce a class of bounds for the difference between the stop loss transforms ...
Recursions are derived for a class of compound istributions having a claim frequency distribution of...
Suppose XIX2,... are independent random variables, each with cumulative distribution function F(x) a...
textabstractThe use of Panjer's algorithm has meanwhile become a widespread standard technique for a...
AbstractThe paper presents a synthetic view of transformations that invert the order of evaluation o...
In this paper, we obtain recurrence relations for moment and conditional moment generating functions...
The marginal recursive equations on excess-of-loss reinsurance treaty are investignted, under the as...
AbstractThis paper explores the performance of a family of algorithms for computing the Walsh–Hadama...