SearcharxivSearch

arXiv · 2106.10007

Merging of bivariate compound Binomial processes with shocks

Abstract

The paper investigates a discrete time Binomial risk model with different types of polices and shock events may influence some of the claim sizes. It is shown that this model can be considered as a particular case of the classical compound Binomial model. As far as we work with parallel Binomial counting processes in infinite time, if we consider them as independent, the probability of the event they to have at least once simultaneous jumps would be equal to one. We overcome this problem by using thinning instead of convolution operation. The bivariate claim counting processes are expressed in two different ways. The characteristics of the total claim amount processes are derived. The risk reserve process and the probabilities of ruin are discussed. The deficit at ruin is thoroughly investigated when the initial capital is zero. Its mean, probability mass function and probability generating function are obtained. We show that although the probability generating function of the global maxima of the random walk is uniquely determined via its probability mass function and vice versa, any compound geometric distribution with non-negative summands has uncountably many stochastically equivalent compound geometric presentations. The probability to survive in much more general settings, than those, discussed here, for example in the Anderson risk model, has uncountably many Beekman's convolution series presentations.

Explore related subjects

Keep this discovery

BibTeXRIS

Pavlina K. Jordanova, Evelina Veleva. 2021-06-18. Merging of bivariate compound Binomial processes with shocks. https://doi.org/10.1063/5.0101318

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