Compatibility and attainability of matrices of correlation-based measures of concordance

10/16/2018
by   Marius Hofert, et al.
0

Necessary and sufficient conditions are derived under which concordance measures arise from correlations of transformed ranks of random variables. Compatibility and attainability of square matrices with entries given by such measures are studied, that is, whether a given square matrix of such measures of association can be realized for some random vector and how such a random vector can be constructed. Special cases of this framework include (matrices of pairwise) Spearman's rho, Blomqvist's beta and van der Waerden's coefficient. For these specific measures, characterizations of sets of compatible matrices are provided. Compatibility and attainability of block matrices and hierarchical matrices are also studied. In particular, a subclass of attainable block Spearman's rho matrices is proposed to compensate for the drawback that Spearman's rho matrices are in general not attainable for dimensions larger than four. Another result concerns a novel analytical form of the Cholesky factor of block matrices which allows one, for example, to construct random vectors with given block matrices of van der Waerden's coefficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2020

Matrix compatibility and correlation mixture representation of generalized Gini's gamma

Representations of measures of concordance in terms of Pearson's correla...
research
10/08/2018

Compatible Matrices of Spearman's Rank Correlation

In this paper, we provide a negative answer to a long-standing open prob...
research
07/08/2019

Admissible and attainable convergence behavior of block Arnoldi and GMRES

It is well-established that any non-increasing convergence curve is poss...
research
06/24/2020

Estimation and Comparison of Correlation-based Measures of Concordance

We address the problem of estimating and comparing transformed rank corr...
research
05/04/2021

Hadamard matrices in {0,1} presentation and an algorithm for generating them

Hadamard matrices are square n× n matrices whose entries are ones and mi...
research
05/19/2021

Pseudo-Hadamard matrices of the first generation and an algorithm for producing them

Hadamard matrices in {0,1} presentation are square m× m matrices whose e...
research
05/26/2022

Projectively and weakly simultaneously diagonalizable matrices and their applications

Characterizing simultaneously diagonalizable (SD) matrices has been rece...

Please sign up or login with your details

Forgot password? Click here to reset