Related papers: Ruin probability for discrete risk processes
We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as…
The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…
We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…
This paper considers a Cram\'er-Lundberg risk setting, where the components of the underlying model change over time. These components could be thought of as the claim arrival rate, the claim-size distribution, and the premium rate, but we…
In this paper, we obtain the finite-horizon and infinite-horizon ruin probability asymptotics for risk processes with claims of subexponential tails for non-stationary arrival processes that satisfy a large deviation principle. As a result,…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
We consider the multivariate risk model with common renewal process among the lines of business, and Brownian perturbations. Assuming that the integrated tail distribution of claims is multivariate subexponential, we establish an asymptotic…
In this paper, we consider a classical risk model refracted at given level. We give an explicit expression for the joint density of the ruin time and the cumulative number of claims counted up to ruin time. The proof is based on solving…
In this paper we discuss a credit risk model with a pure jump L\'evy process for the asset value and an unobservable random barrier. The default time is the first time when the asset value falls below the barrier. Using the…
We derive exact tail asymptotics of the Parisian ruin probability for Gaussian risk models driven by locally self-similar Gaussian processes with a power-type deterministic trend. The considered setting includes non-stationary Gaussian…
In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…
Suppose we are given the free product $V$ of a finite family of finite or countable sets $(V_i)_{i\in\mathcal{I}}$ and probability measures on each $V_i$, which govern random walks on it. We consider a transient random walk on the free…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…
A random walk in random scenery $(Y_n)_{n\in\mathbb{N}}$ is given by $Y_n=\xi_{S_n}$ for a random walk $(S_n)_{n\in\mathbb{N}}$ and iid random variables $(\xi_n)_{n\in\mathbb{Z}}$. In this paper, we will show the weak convergence of the…
Dealing with compound renewal process with generally distributed jump sizes and inter-renewal intervals, we focus on the approximation for the fixed-probability level, which is the core of inverse level crossing problem. We are developing…
When assessing risks on a finite-time horizon, the problem can often be reduced to the study of a random sequence $C(N)=(C_1,\ldots,C_N)$ of random length $N$, where $C(N)$ comes from the product of a matrix $A(N)$ of random size $N \times…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
We study the use of Temporal-Difference learning for estimating the structural parameters in dynamic discrete choice models. Our algorithms are based on the conditional choice probability approach but use functional approximations to…
The aim of this study is to extend the scope and applicability of the level-crossing method to discrete-time stochastic processes and generalize it to enable us to study multiple discrete-time stochastic processes. In previous versions of…