Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T13:12:38.852Z Has data issue: false hasContentIssue false

Efficient simulation of tail probabilities of sums of dependent random variables

Published online by Cambridge University Press:  14 July 2016

Jose H. Blanchet
Affiliation:
Columbia University, Department of Industrial Engineering and Operations Research, Columbia University, S.W. Mudd Building, 500 West 120th Street, New York, USA. Email address: jose.blanchet@columbia.edu
Leonardo Rojas-Nandayapa
Affiliation:
The University of Queensland, Department of Mathematics, The University of Queensland, Brisbane, Queensland 4072, Australia. Email address: l.rojasnandayapa@uq.edu.au
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 study asymptotically optimal simulation algorithms for approximating the tail probability of P(eX1 +⋯+ eX d >u) as u→∞. The first algorithm proposed is based on conditional Monte Carlo and assumes that (X 1,…,X d ) 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 (X 1,…,X d |X j >b) for large b. Extensions that allow us to handle portfolios of financial options are also discussed.

Information

Type
Part 4. Simulation
Copyright
Copyright © Applied Probability Trust 2011