Simplicial Faces of the Set of Correlation Matrices

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper concerns the facial geometry of the set of n× n correlation matrices. The main result states that almost every set of r vertices generates a simplicial face, provided that r≤cn, where c is an absolute constant. This bound is qualitatively sharp because the set of correlation matrices has no simplicial face generated by more than 2n vertices.

References Powered by Scopus

Improved Approximation Algorithms for Maximum Cut and Satisflability Problems Using Semidefinite Programming

2583Citations
N/AReaders
Get full text

User-Friendly Tail Bounds for Sums of Random Matrices

842Citations
N/AReaders
Get full text

An introduction to matrix concentration inequalities

507Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices

16Citations
N/AReaders
Get full text

Geodesics and Curvature of the Quotient-Affine Metrics on Full-Rank Correlation Matrices

10Citations
N/AReaders
Get full text

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

10Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Tropp, J. A. (2018). Simplicial Faces of the Set of Correlation Matrices. Discrete and Computational Geometry, 60(2), 512–529. https://doi.org/10.1007/s00454-017-9961-0

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

57%

Researcher 2

29%

Lecturer / Post doc 1

14%

Readers' Discipline

Tooltip

Mathematics 4

57%

Computer Science 2

29%

Social Sciences 1

14%

Save time finding and organizing research with Mendeley

Sign up for free