Computing the distribution of the sum of dependent random variables via overlapping hypercubes (Q894208)

From MaRDI portal
Revision as of 21:23, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Computing the distribution of the sum of dependent random variables via overlapping hypercubes
scientific article

    Statements

    Computing the distribution of the sum of dependent random variables via overlapping hypercubes (English)
    0 references
    0 references
    27 November 2015
    0 references
    For the computation of VaR (value-at-risk), Arbenz, Embrechts and Puccetti [\textit{P. Arbenz} et al., Bernoulli 17, No. 2, 562--591 (2011; Zbl 1248.60018)] have proposed a new algorithm, called AEP after the names of the authors. In this paper, the author proves that the AEP algorithm converges for any \(d \geq 2\) and any absolutely continuous distribution \(H\) (with bounded density in a neighborhood of the simplex diagonal). The proof of the convergence is very detailed and precisely given.
    0 references
    dependent random variables
    0 references
    algorithm convergence
    0 references
    self-similarity
    0 references
    value-at-risk
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references