2011
DOI: 10.1080/17442508.2011.566337
|View full text |Cite
|
Sign up to set email alerts
|

The GAEP algorithm for the fast computation of the distribution of a function of dependent random variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 3 publications
0
6
0
Order By: Relevance
“…For α close to one, tools from rare event simulation become important; see for instance Asmussen and Glynn [17], Chapter VI. For a more geometric approach, useful in lower dimensions, say d ≤ 5, see [18,19].…”
Section: How Superadditive Can Var Be?mentioning
confidence: 99%
See 1 more Smart Citation
“…For α close to one, tools from rare event simulation become important; see for instance Asmussen and Glynn [17], Chapter VI. For a more geometric approach, useful in lower dimensions, say d ≤ 5, see [18,19].…”
Section: How Superadditive Can Var Be?mentioning
confidence: 99%
“…From Proposition 3, we can see that the interdependence (copula) between the random variables can be set arbitrarily in the lower region of the marginal supports, and only the tail dependence (in a region of probability, 1 − α, in each margin) matters for the worst VaR value. In the tail region, a smallest element in the convex order sense solves these "sup-inf" and "inf-sup" problems, (18) and (19). To be more precise, each of the individual risks are coupled in a way, such that, conditional on their being all large, their sum is concentrated around a constant (ideally, the sum is a constant, but this is not realistic in many cases).…”
Section: Towards the Inhomogeneous Casementioning
confidence: 99%
“…There are also other algorithms to numerically calculate the joint distribution of n dependent random variables in the literature such as the GAEP algorithm by Arbenz, Embrechts and Pucetti in [80]. However, their method is limited to calculate the joint distribution of 6 marginals and the results seem to be very similar to Monte-Carlo method.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…A fully automatic mechanism to derive the copulas and estimate the extreme value distributions by testing the applicability is needed. Instead of using Monte-Carlo approach which is basically simulating the scope behaviors, other numerical methods such as GAEP algorithm[80] could be used. paramEstsLmomF irM s, paramEstsLmomSelectM s and paramEstsLmomJanneM s parameters are estimated by using lmomgev function.…”
mentioning
confidence: 99%
“…For example, we derived bounds on the sum of dependent risks having overlapping marginals (Embrechts & Puccetti, 2009). With Philipp Arbenz, we also developed algorithms for the fast computation of the distribution of a function of dependent random variables (Arbenz et al , 2011; 2012). Later with Ludger Rüschendorf, Giovanni and I exploited the rearrangement algorithm to compute bounds on the best and worst VaR (Embrechts et al , 2013).…”
Section: Exploring New Research Horizonsmentioning
confidence: 99%