Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-24T15:32:37.291Z Has data issue: false hasContentIssue false

Efficient importance sampling in ruin problems for multidimensional regularly varying random walks

Published online by Cambridge University Press:  14 July 2016

Jose Blanchet*
Affiliation:
Columbia University
Jingchen Liu*
Affiliation:
Columbia University
*
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, S. W. Mudd Building, 500 West 120th Street, New York, NY 10027-6699, USA. Email address: [email protected]
∗∗Postal address: Department of Statistics, Columbia University, 1255 Amsterdam Avenue, Room 1030, New York, NY 10027, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the problem of efficient estimation via simulation of first passage time probabilities for a multidimensional random walk with heavy-tailed increments. In addition to being a natural generalization to the problem of computing ruin probabilities in insurance - in which the focus is the maximum of a one-dimensional random walk with negative drift - this problem captures important features of large deviations for multidimensional heavy-tailed processes (such as the role played by the mean of the process in connection to the location of the target set). We develop a state-dependent importance sampling estimator for this class of multidimensional problems. Then, using techniques based on Lyapunov inequalities, we argue that our estimator is strongly efficient in the sense that the relative mean squared error of our estimator can be made arbitrarily small by increasing the number of replications, uniformly as the probability of interest approaches 0.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010 

References

Asmussen, S. (2003). Applied Probability and Queues, 2nd edn. Springer, New York.Google Scholar
Blanchet, J. and Glynn, P. (2008). Efficient rare event simulation for the maximum of heavy-tailed random walks. Ann. Appl. Prob. 18, 13511378.CrossRefGoogle Scholar
Blanchet, J. H. and Liu, J. (2007). Rare-event simulation for a multidimensional random walk with t distributed increments. In Proc. 39th Conf. Winter Simulation, IEEE, pp. 395402.Google Scholar
Blanchet, J. H. and Liu, J. (2008). State-dependent importance sampling for regularly varying random walks. Adv. Appl. Prob. 40, 11041128.CrossRefGoogle Scholar
Blanchet, J., Glynn, P. and Liu, J. (2007). Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue. Queueing Systems 57, 99113.CrossRefGoogle Scholar
Collamore, J. (2002). Importance sampling techniques for the multidimensional ruin problem for general Markov additive sequences of random vectors. Ann. Appl. Prob. 12, 382421.CrossRefGoogle Scholar
Dupuis, P., Leder, K. and Wang, H. (2006). Notes on importance sampling for random variables with regularly varying tails. Preprint.Google Scholar
Embrechts, P., Lindskog, F. and McNeil, A. (2003). Modeling dependence with copulas and applications to risk management. In Handbook of Heavy Tailed Distributions in Finance, ed. Rachev, S., Elsevier, pp. 329384.CrossRefGoogle Scholar
Glasserman, P. and Juneja, S. (2008). Uniformly efficient importance sampling for the tail distribution of sums of random variables. Math. Operat. Res. 33, 3650.CrossRefGoogle Scholar
Glynn, P. W. and Iglehart, D. L. (1989). Importance sampling for stochastic simulations. Manag. Sci. 35, 13671392.CrossRefGoogle Scholar
Hult, H. and Lindskog, F. (2006). Heavy-tailed insurance portfolios: buffer capital and ruin probabilities. Tech. Rep. 1441, School of ORIE, Cornell University.Google Scholar
Hult, H., Lindskog, F., Mikosch, T. and Samorodnitsky, G. (2005). Functional large deviations for multivariate regularly varying random walks. Ann. Appl. Prob. 15, 26512680.CrossRefGoogle Scholar
Kallenberg, O. (1983). Random Measures, 3rd edn. Akademie, Berlin.CrossRefGoogle Scholar
Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London.CrossRefGoogle Scholar
Sadowsky, J. S. and Bucklew, J. A. (1990). On large deviations theory and asymptotically efficient Monte Carlo estimation. IEEE Trans. Inf. Theory 36, 579588.CrossRefGoogle Scholar