Related papers: Compatible Matrices of Spearman's Rank Correlation
Many questions in neuroscience involve understanding of the responses of large populations of neurons. However, when dealing with large-scale neural activity, interpretation becomes difficult, and comparisons between two animals, or across…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2 n$ pairwise…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
The relation between Pearson's correlation coefficient and Salton's cosine measure is revealed based on the different possible values of the division of the L1-norm and the L2-norm of a vector. These different values yield a sheaf of…
We consider the S.Smale's 9th problem on feasibility of the linear system of inequalities in connection with a linear programming problem.
We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…
Measures of rank correlation are commonly used in statistics to capture the degree of concordance between two orderings of the same set of items. Standard measures like Kendall's tau and Spearman's rho coefficient put equal emphasis on each…
We prove the conjecture of Falikman--Friedland--Loewy on the parity of the degrees of projective varieties of $n\times n$ complex symmetric matrices of rank at most $k$. We also characterize the parity of the degrees of projective varieties…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
We study the problem of testing whether the missing values of a potentially high-dimensional dataset are Missing Completely at Random (MCAR). We relax the problem of testing MCAR to the problem of testing the compatibility of a collection…
This paper considers sparse spiked covariance matrix models in the high-dimensional setting and studies the minimax estimation of the covariance matrix and the principal subspace as well as the minimax rank detection. The optimal rate of…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…
We explore how the classical concordance measures - Kendall's $\tau$, Spearman's rank correlation $\rho$, and Spearman's footrule $\phi$ - relate to Chatterjee's rank correlation $\xi$ when restricted to lower semilinear copulas. First, we…
This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existing analysis for the low-rank matrix completion problem with…
We compare measures of concordance that arise as Pearson's linear correlation coefficient between two random variables transformed so that they follow the so-called concordance-inducing distributions. The class of such transformed rank…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…