Let (Xn : n≥0) be a sequence of i.i.d. r.v.’s with negative mean. Set S0=0 and define Sn=X1+⋯+Xn. We propose an importance sampling algorithm to estimate the tail of M=max {Sn : n≥0} 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.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription.
Read more about accessing full-textThis document is available for purchase at a cost of $15. Select the "buy article" button below to make a credit card purchase of this document through a secure payment site.
References
Adler, J., Feldman, R. and Taqqu, M., eds. (1998). A Practical Guide to Heavy Tails: Statistical Techniques and Applications. Birkhäuser, Boston.
Asmussen, S. (2003). Applied Probability and Queues. Springer, New York.
Asmussen, S. and Glynn, P. (2007). Stochastic Simulation: Algorithms and Analysis. Springer, New York.
Asmussen, S. and Binswanger, K. (1997). Simulation of ruin probabilities for subexponential claims. Ast. Bulletin 27 297–318.
Asmussen, S., Binswanger, K. and Hojgaard, B. (2000). Rare event simulation for heavy-tailed distributions. Bernoulli 6 303–322.
Asmussen, S. and Kluppelberg, C. (1996). Large deviation results for subexponential tails, with applications to insurance risk. Stoch. Proc. Appl. 64 103–125.
Asmussen, S. and Kroese, D. (2006). Improved algorithms for rare event simulation with heavy tails. Adv. Appl. Probab. 38 545–558.
Bassamboo, A., Juneja, S. and Zeevi, A. (2006). On the efficiency loss of state-independent importance sampling in the presence of heavy-tails. Oper. Res. Lett. 34 521–531.
Blanchet, J., Glynn, P. and Liu, J. C. (2007). Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue. QUESTA 57 99–113.
Blanchet, J. and Li, C. (2006). Efficient rare-event simulation for geometric sums. Proc. RESIM, Bamberg. Germany.
Borovkov, A. A. and Borovkov, K. A. (2001). On probabilities of large deviations for random walks. I: Regularly varying distribution tails. Theory Probab. Appl. 49 189–205.
Bucklew, J. (2004). Introduction to Rare-Event Simulation. Springer, New York.
Dupuis, P. and Wang, H. (2004). Importance sampling, large deviations, and differential games. Stochastics Stochastics Rep. 76 481–508.
Dupuis, P., Leder, K. and Wang, H. (2006). Importance sampling for sums of random variables with regularly varying tails. TOMACS 17.
Embrechts, P., Klüppelberg, C. and Mikosch, T. (1997). Modelling Extremal Events for Insurance and Finance. Springer, New York.
Hammersley, J. and Morton, K. (1954). Poor man’s Monte Carlo. J. Roy. Statist. Soc. Ser. B 16 23–38.
Juneja, S. and Shahabuddin, P. (2002). Simulating heavy-tailed processes using delayed hazard rate twisting. ACM TOMACS 12 94–118.
Juneja, S. and Shahabuddin, P. (2006). Rare event simulation techniques: An introduction and recent advances. In Handbook on Simulation (S. Henderson and B. Nelson, eds.) 291–350. North-Holland, Amsterdam.
Liu, J. (2001). Monte Carlo Strategies in Scientific Computing. Springer, New York.
Meyn, S. and Tweedie, R. (1993). Markov Chains and Stochastic Stability. Available at http://decision.csl.uiuc.edu/~meyn/pages/book.html.
Rosenbluth, M. and Rosenbluth, A. (1955). Monte Carlo calculation of the average extension of molecular chains. J. Chem. Phys. 23 356–359.
Siegmund, D. (1976). Importance sampling in the Monte Carlo study of sequential tests. Ann. Statist. 4 673–684.
Mathematical Reviews (MathSciNet):
MR418369
