On Tail Dependence Matrices - The Realization Problem for Parametric Families

Among bivariate tail dependence measures, the tail dependence coefficient has emerged as the popular choice. Akin to the correlation matrix, a multivariate dependence measure is constructed using these bivariate measures, and this is referred to in the literature as the tail dependence matrix (TDM). While the problem of determining whether a given d× d matrix is a correlation matrix is of the order O(d^3) in complexity, determining if a matrix is a TDM (the realization problem) is believed to be non-polynomial in complexity. Using a linear programming (LP) formulation, we show that the combinatorial structure of the constraints is related to the intractable max-cut problem in a weighted graph. This connection provides an avenue for constructing parametric classes admitting a polynomial in d algorithm for determining membership in its constraint polytope. The complexity of the general realization problem is justifiably of much theoretical interest. Since in practice one resorts to lower dimensional parametrization of the TDMs, we posit that it is rather the complexity of the realization problem restricted to parametric classes of TDMs, and algorithms for it, that are more practically relevant. In this paper, we show how the inherent symmetry and sparsity in a parametrization can be exploited to achieve a significant reduction in the LP formulation, which can lead to polynomial complexity of such realization problems - some parametrizations even resulting in the constraint polytope being independent of d. We also explore the use of a probabilistic viewpoint on TDMs to derive the constraint polytopes.

READ FULL TEXT
research
01/28/2021

A new class of tail dependence measures and their maximization

A new class of measures of bivariate tail dependence is proposed, which ...
research
07/07/2023

Generalised Covariances and Correlations

The covariance of two random variables measures the average joint deviat...
research
03/16/2018

Quantile correlation coefficient: a new tail dependence measure

We propose a new measure related with tail dependence in terms of correl...
research
10/23/2022

Estimating probabilities of multivariate failure sets based on pairwise tail dependence coefficients

An important problem in extreme-value theory is the estimation of the pr...
research
07/25/2021

Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences

Correlation measure of order k is an important measure of randomness in ...
research
11/02/2017

On Optimization over Tail Distributions

We investigate the use of optimization to compute bounds for extremal pe...
research
03/31/2017

A New Measure of Conditional Dependence

Measuring conditional dependencies among the variables of a network is o...

Please sign up or login with your details

Forgot password? Click here to reset