SearcharxivSearch

arXiv · 2608.21905

Ruin theory incorporating MIPP-type jumps

Abstract

The paper investigates the ruin probability of an insurer's surplus process when claims follow a Multiply Iterated Poisson Process (MIPP). This setting extends the classical Cramer-Lundberg model by allowing for clustered claim arrivals, making it particularly appropriate for modeling catastrophic insurance losses. The primary contribution is the derivation of explicit criteria for ultimate ruin, showing that the ruin probability is largely determined by the jump intensity parameter and the iteration count. Furthermore, we establish integro-differential equations for the survival and ruin probabilities and compute their Laplace transforms. These transforms are then linked via recursive formulas that relate ruin probabilities at consecutive iteration levels. We also introduce a Cramer-Lundberg-style approximation, which provides asymptotic expressions for ruin probabilities along with a Lundberg-type inequality. Numerical examples, including comparisons with the classical model, are provided to validate the theoretical results and to highlight the impact of claim clustering on the insurer's risk of ruin.

Explore related subjects

Keep this discovery

BibTeXRIS

Dongdong Hu, Hasanjan Sayit. 2026-08-22. Ruin theory incorporating MIPP-type jumps. https://arxiv.org/abs/2608.21905

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