How simplifying and flexible is the simplifying assumption in pair-copula constructions – some analytic answers in dimension three and beyond

06/11/2020
by   Thomas Mroz, et al.
0

Motivated by the increasing popularity and the seemingly broad applicability of pair-copula constructions underlined by numerous publications in the last decade, in this contribution we tackle the unavoidable question on how flexible and simplifying the commonly used 'simplifying assumption' is from an analytic perspective and provide answers to two related open questions posed by Nagler and Czado in 2016. Aiming at a simplest possible setup for deriving the main results we first focus on the three-dimensional setting. We prove flexibility of simplified copulas in the sense that they are dense in the family of all three-dimensional copulas with respect to the uniform metric d_∞, show that the partial vine copula is never the optimal simplified copula approximation of a given, non-simplified copula C, and derive examples illustrating that the corresponding approximation error can be strikingly large and extend to more than 28% of the diameter of the metric space. Moreover, the mapping ψ assigning each three-dimensional copula its unique partial vine copula turns out to be discontinuous with respect to d_∞ (but continuous with respect to other notions of convergence), implying a surprising sensitivity of partial vine copula approximations. The afore-mentioned main results are then extended to the general multivariate setting.

READ FULL TEXT
research
03/24/2023

Random sampling and unisolvent interpolation by almost everywhere analytic functions

We prove a.s. (almost sure) unisolvency of interpolation by continuous r...
research
10/21/2022

On convergence and mass distributions of multivariate Archimedean copulas and their interplay with the Williamson transform

Motivated by a recently established result saying that within the class ...
research
05/03/2017

Quantified advantage of discontinuous weight selection in approximations with deep neural networks

We consider approximations of 1D Lipschitz functions by deep ReLU networ...
research
07/19/2019

Override and update

Override and update are natural constructions for combining partial func...
research
07/22/2018

Metric dimension and pattern avoidance in graphs

In this paper, we prove a number of results about pattern avoidance in g...
research
09/04/2002

The partition semantics of questions, syntactically

Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logical...

Please sign up or login with your details

Forgot password? Click here to reset