2011
DOI: 10.1017/s0021900200099198
|View full text |Cite
|
Sign up to set email alerts
|

Efficient simulation of tail probabilities of sums of dependent random variables

Abstract: We study asymptotically optimal simulation algorithms for approximating the tail probability of P(e X 1 + · · · + e X 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 structur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…However, the Fenton–Wilkinson method, being a central limit type result, can deliver rather inaccurate approximations of the distribution of the lognormal sum when the number of summands is rather small or when the dispersion parameter is too high—in particular in the tail regions. Another topic, which has been much studied recently, is approximations and simulation algorithms for right tail probabilities double-struckP(Sny) under heavy‐tailed assumptions and allowing for dependence; see in particular Asmussen & Rojas‐Nandayapa (); Foss & Richards (); Mitra & Resnick (); Asmussen et al (); Blanchet & Rojas‐Nandayapa (). For further literature surveys, see Gulisashvili & Tankov ().…”
Section: Introductionmentioning
confidence: 99%
“…However, the Fenton–Wilkinson method, being a central limit type result, can deliver rather inaccurate approximations of the distribution of the lognormal sum when the number of summands is rather small or when the dispersion parameter is too high—in particular in the tail regions. Another topic, which has been much studied recently, is approximations and simulation algorithms for right tail probabilities double-struckP(Sny) under heavy‐tailed assumptions and allowing for dependence; see in particular Asmussen & Rojas‐Nandayapa (); Foss & Richards (); Mitra & Resnick (); Asmussen et al (); Blanchet & Rojas‐Nandayapa (). For further literature surveys, see Gulisashvili & Tankov ().…”
Section: Introductionmentioning
confidence: 99%
“…The optimal mixture parameters are chosen by solving a limiting control problem. With the exception of [24,7] which consider correlated sums, it is instructive to note that most IS methods involving a number of heavy-tailed random variables are applicable only when the random variables involved are mutually independent. A strategy for handling heavy-tailed random vectors, in the context of scenario generation for chance constraints, is developed in [22].…”
Section: 1mentioning
confidence: 99%