The asymptotic efficiency of simulation estimators
Operations Research
Importance sampling for the simulation of highly reliable Markovian systems
Management Science
Fast simulation of rare events in queueing and reliability models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Modelling extremal events: for insurance and finance
Modelling extremal events: for insurance and finance
Simulating GI/GI/1 queues and insurance risk processes with subexponential distributions
Proceedings of the 32nd conference on Winter simulation
Efficient rare event simulation for heavy-tailed compound sums
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Rare-event simulation for stochastic recurrence equations with heavy-tailed innovations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
We describe a fast simulation framework for simulating small ruin probabilities in insurance risk processes with subexponential claims. Naive simulation is inefficient since the event of interest is rare, and special simulation techniques like importance sampling need to be used. An importance sampling change of measure known as sub-exponential twisting has been found useful for some rare event simulations in the subexponential context. We describe conditions that are sufficient to ensure that the infinite horizon probability can be estimated in a (work-normalized) large set asymptotically optimal manner, using this change of measure. These conditions are satisfied for some large classes of insurance risk processes --- e.g., processes with Markov-modulated claim arrivals and claim sizes --- where the heavy tails are of the 'Weibull type'. We also give much weaker conditions for the estimation of the finite horizon ruin probability. Finally, we present experiments supporting our results.