Article contents
Efficient simulation of tail probabilities of sums of dependent random variables
Published online by Cambridge University Press: 14 July 2016
Abstract
We study asymptotically optimal simulation algorithms for approximating the tail probability of P(eX1+⋯+ eXd>u) as u→∞. The first algorithm proposed is based on conditional Monte Carlo and assumes that (X1,…,Xd) has an elliptical distribution with very mild assumptions on the radial component. This algorithm is applicable to a large class of models in finance, as we demonstrate with examples. In addition, we propose an importance sampling algorithm for an arbitrary dependence structure that is shown to be asymptotically optimal under mild assumptions on the marginal distributions and, basically, that we can simulate efficiently (X1,…,Xd|Xj >b) for large b. Extensions that allow us to handle portfolios of financial options are also discussed.
Keywords
MSC classification
- Type
- Part 4. Simulation
- Information
- Journal of Applied Probability , Volume 48 , Issue A: New Frontiers in Applied Probability (Journal of Applied Probability Special Volume 48A) , August 2011 , pp. 147 - 164
- Copyright
- Copyright © Applied Probability Trust 2011
References
- 7
- Cited by