On importance sampling with mixtures for random walks with heavy tails
From MaRDI portal
Publication:4635184
Abstract: Importance sampling algorithms for heavy-tailed random walks are considered. Using a specification with algorithms based on mixtures of the original distribution with some other distribution, sufficient conditions for obtaining bounded relative error are presented. It is proved that mixture algorithms of this kind can achieve asymptotically optimal relative error. Some examples of mixture algorithms are presented, including mixture algorithms using a scaling of the original distribution, and the bounds of the relative errors are calculated. The algorithms are evaluated numerically in a simple setting.
Recommendations
- On the inefficiency of state-independent importance sampling in the presence of heavy tails
- State-dependent importance sampling for regularly varying random walks
- State-independent importance sampling for random walks with regularly varying increments
- Efficient rare-event simulation for the maximum of heavy-tailed random walks
- HEAVY TAILS, IMPORTANCE SAMPLING AND CROSS–ENTROPY
Cited in
(8)- State-dependent importance sampling for regularly varying random walks
- HEAVY TAILS, IMPORTANCE SAMPLING AND CROSS–ENTROPY
- Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk
- A simulation-based method for estimating systemic risk measures
- Rare-event simulation for neural network and random forest predictors
- On the inefficiency of state-independent importance sampling in the presence of heavy tails
- Simulating risk measures via asymptotic expansions for relative errors
- New efficient estimators in rare event simulation with heavy tails
This page was built for publication: On importance sampling with mixtures for random walks with heavy tails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635184)