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.
Author supplied keywords
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
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free