On Majorization in Dependence Modeling
classification
🧮 math.PR
keywords
majorizationdependencefunctionstheoryaggregationalgorithmallowsapply
read the original abstract
We apply concepts of majorization theory to derive new insights in the field of extremal dependence structures. In particular, we consider the Rearrangement Algorithm by Puccetti and Rueschendorf, where majorization arguments yield a statement that unifies and extends the existing theory in two ways. The first extension considers convex functions of non-linear risk aggregation and the second allows for non-symmetric cost functions. The article is concluded by computing an example.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.