This paper aims to evaluate the aggregate claims distribution under the collective risk model when the number of claims follows a so-called generalised (a, b, 1) family distribution. The definition of the generalised (a, b, 1) family of distributions is given first, then a simple matrix-form recursion for the compound generalised (a, b, 1) distributions is derived to calculate the aggregate claims distribution with discrete non-negative individual claims. Continuous individual claims are discussed as well and an integral equation of the aggregate claims distribution is developed. Moreover, a recursive formula for calculating the moments of aggregate claims is also obtained in this paper. With the recursive calculation framework being established, members that belong to the generalised (a, b, 1) family are discussed. As an illustration of potential applications of the proposed generalised (a, b, 1) distribution family on modelling insurance claim numbers, two numerical examples are given. The first example illustrates the calculation of the aggregate claims distribution using a matrix-form Poisson for claim frequency with logarithmic claim sizes. The second example is based on real data and illustrates maximum likelihood estimation for a set of distributions in the generalised (a, b, 1) family.

In this paper, we aim to evaluate the distribution of the aggregate claims in the collective risk model. The claim count distribution is firstly assumed to belong to a generalised (a, b, 0) family. A matrix form recursive formula is then derived to evaluate the related compound distribution when individual claim amounts follow a discrete distribution on non-negative integers. The corresponding formula is also given for continuous individual claim amounts. Secondly, we pay particular attention to the recursive formula for compound phase-type distributions, since only certain types of discrete phase-type distributions belong to the generalised (a, b, 0) family. Similar recursive formulae are obtained for discrete and continuous individual claim amount distributions. Finally, numerical examples are presented for three counting distributions.

The Kolmogorov distance is used to transform arithmetic severities into equispaced arithmetic severities in order to reduce the number of calculations when using algorithms like Panjer's formulae for compound distributions. An upper bound is given for the Kolmogorov distance between the true compound distribution and the transformed one. Advantages of the Kolmogorov distance and disadvantages of the total variation distance are discussed. When the bounds are too big, a Berry-Esseen result can be used. Then almost every case can be handled by the techniques described in this paper. Numerical examples show the interest of the methods.

We consider a class of G/G/1 queueing models with independent generalized setup time and exhaustive service. It is shown that a variety of single-server queueing systems with service interruption are special cases of our model. We give a simple computational scheme for the moments of the stationary waiting time and sojourn time. Our numerical investigations indicate that the algorithm is quite accurate and fast in general. For the M/G/1 case, we are able to derive a recursive formula for the moments of the stationary waiting time, which includes the Takács formula as a special case. It immediately results in the stochastic decompòsition property which can be found in the literature.

Based on recurrence equation theory and relative error (rather than absolute error) analysis, the concept and criterion for the stability of a recurrence equation are clarified. A family of recursions, called congruent recursions, is proved to be strongly stable in evaluating its non-negative solutions. A type of strongly unstable recursion is identified. The recursive formula discussed by Panjer (1981) is proved to be strongly stable in evaluating the compound Poisson and the compound Negative Binomial (including Geometric) distributions. For the compound Binomial distribution, the recursion is shown to be unstable. A simple method to cope with this instability is proposed. Many other recursions are reviewed. Illustrative numerical examples are given.