SearcharxivSearch

arXiv · 2101.03335

How much we gain by surplus-dependent premiums -- asymptotic analysis of ruin probability

Abstract

In this paper, we build on the techniques developed in Albrecher et al. (2013), to generate initial-boundary value problems for ruin probabilities of surplus-dependent premium risk processes, under a renewal case scenario, Erlang (2) claim arrivals, and an exponential claims scenario, Erlang (2) claim sizes. Applying the approximation theory of solutions of linear ordinary differential equations developed in Fedoryuk (1993), we derive the asymptotics of the ruin probabilities when the initial reserve tends to infinity. When considering premiums that are {\it linearly} dependent on reserves, representing for instance returns on risk-free investments of the insurance capital, we firstly derive explicit formulas for the ruin probabilities, from which we can easily determine their asymptotics, only to match the ones obtained for general premiums dependent on reserves. We compare them with the asymptotics of the equivalent ruin probabilities when the premium rate is fixed over time, to measure the gain generated by this additional mechanism of binding the premium rates with the amount of reserve own by the insurance company.

Explore related subjects

Keep this discovery

BibTeXRIS

Corina Constantinescu, Zbigniew Palmowski, Jing Wang. 2021-01-09. How much we gain by surplus-dependent premiums -- asymptotic analysis of ruin probability. https://arxiv.org/abs/2101.03335

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