SearcharxivSearch

arXiv · 2406.17726

Extensions of Panjer's recursion for mixed compound distributions

Abstract

In actuarial practice, the usual independence assumptions for the collective risk model are often violated, implying a growing need for considering more general models that incorporate dependence. To this purpose, the present paper studies the mixed counterpart of the classical Panjer family of claim number distributions and their compound version, by allowing the parameters of the distributions to be viewed as random variables. Under the assumptions that the claim size process is conditionally i.i.d. and (conditionally) mutually independent of the claim counts, we provide a recursive algorithm for the computation of the probability mass function of the aggregate claim sizes. The case of a compound Panjer distribution with exchangeable claim sizes is also studied. For the sake of completeness, our results are illustrated by various numerical examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spyridon M. Tzaninis, Apostolos Bozikas. 2024-06-25. Extensions of Panjer's recursion for mixed compound distributions. https://arxiv.org/abs/2406.17726

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR