Efficient rare-event simulation for the maximum of heavy-tailed random walks
arXiv:0808.2731 · doi:10.1214/07-AAP485
Abstract
Let be a sequence of i.i.d. r.v.'s with negative mean. Set and define . We propose an importance sampling algorithm to estimate the tail of that is strongly efficient for both light and heavy-tailed increment distributions. Moreover, in the case of heavy-tailed increments and under additional technical assumptions, our estimator can be shown to have asymptotically vanishing relative variance in the sense that its coefficient of variation vanishes as the tail parameter increases. A key feature of our algorithm is that it is state-dependent. In the presence of light tails, our procedure leads to Siegmund's (1979) algorithm. The rigorous analysis of efficiency requires new Lyapunov-type inequalities that can be useful in the study of more general importance sampling algorithms.
Published in at http://dx.doi.org/10.1214/07-AAP485 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Cited by in corpus (11)
- Efficient importance sampling for binary contingency tables
- Importance sampling in path space for diffusion processes with slow-fast variables
- A sequential Monte Carlo approach to computing tail probabilities in stochastic models
- Efficient calculation of risk measures by importance sampling -- the heavy tailed case
- Tail Asymptotics for Delay in a Half-loaded GI/GI/2 Queue with Heavy-tailed Job Sizes
- Total variation approximations and conditional limit theorems for multivariate regularly varying random walks conditioned on ruin
- Exact and efficient simulation of tail probabilities of heavy-tailed infinite series
- Efficient Rare-event Simulation for Perpetuities
- A Dichotomy for Sampling Barrier-Crossing Events of Random Walks with Regularly Varying Tails
- Ruin probabilities with dependence on the number of claims within a fixed time window
- An Explicit Cross Entropy Scheme for Mixtures