Simulating heavy tailed processes using delayed hazard rate twisting
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Large deviations and importance sampling for a tandem network with slow-down
Queueing Systems: Theory and Applications
Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error
Queueing Systems: Theory and Applications
On importance sampling with mixtures for random walks with heavy tails
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Long-Term prediction of discharges in manwan reservoir using artificial neural network models
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part III
Engineering Applications of Artificial Intelligence
On error rates in rare event simulation with heavy tails
Proceedings of the Winter Simulation Conference
| Hi-index | 7.29 |
This paper is concerned with the efficient simulation of P(S"ns) in situations where s is large and S"n is the sum of n i.i.d. heavy-tailed random variables X"1,...,X"n. The most efficient and simplest estimators introduced in the rare event simulation literature are those proposed by Asmussen and Kroese (2006) and Asmussen and Kortschak (2012). Although the main techniques for facing the rare event problem are importance sampling and splitting, the estimators of Asmussen, Kortschak and Kroese combine exchangeability arguments with conditional Monte-Carlo to construct estimators whose relative errors go to 0 as s-~. In this paper, we decompose P(S"ns) as the sum of P(M"ns) and P(S"ns,M"ns) is known in closed form and is asymptotically equivalent to P(S"ns). We construct new efficient estimators of P(S"ns,M"n