SearcharxivSearch

arXiv · 2312.06784

Approximations of semi-Markov processes and insurance policy valuation

Abstract

Inspired by a duration-dependent life insurance model, we consider continuous-time semi-Markov jump processes, initially assumed to have a finite state-space. We develop approximations using jump processes that are time-homogeneous Markov, conditioned on a high-intensity Poissonian grid (grid-conditional). Our results are based on a recent adaptation of the uniformization principle, which yields a strongly pathwise convergent sequence of jump processes. In contrast to traditional methods that use classical approximations to integro-differential equation solutions to compute value functions, our approximations result in easily implementable expressions, making them valuable in situations where evaluating pathwise distributional functionals for the original semi-Markov process is challenging. Our homogeneous approximation, initially grid-conditional, evolves into an unconditional version that remains effective under reasonable regularity assumptions. We then relax the finite state-space assumption and show how our results can be extended to a general measurable state-space. We illustrate the practicality of our approach with a disability insurance model, using realistic underlying semi-Markov process parameters.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Bladt, Andreea Minca, Oscar Peralta. 2023-12-11. Approximations of semi-Markov processes and insurance policy valuation. https://arxiv.org/abs/2312.06784

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