On the sparsity order of a graph and its deficiency in chordality
For a graph \(G\) on \(n\) vertices \({\mathcal P}_G\) is the cone of \(n\times n\) positive semidefinite matrices with real or complex entries having a zero entry at every off-diagonal position corresponding to a non-edge in \(G\). The sparsity order of \(G\) is the maximum rank of a matrix lying on an extreme ray of the cone \({\mathcal P}_G\). The characterization of the graphs with sparsity order \(1\) was given earlier and the characterization of the graphs with sparsity order \(2\) was conjectured in the same paper. The main result of this paper is the proof of this conjecure.
- Graphs with sparsity order at most two: the complex case
- Positive semidefinite matrices with a given sparsity pattern
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- scientific article; zbMATH DE number 4095519
- The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
- Positive semidefinite matrices with a given sparsity pattern
- Maximum likelihood threshold and generic completion rank of graphs
- Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- scientific article; zbMATH DE number 4095519 (Why is no real title available?)
- Graphs with sparsity order at most two: the complex case
- Do sums of squares dream of free resolutions?
- Spectrahedral cones generated by rank \(1\) matrices
- Lectures on nonnegative polynomials and sums of squares
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
This page was built for publication: On the sparsity order of a graph and its deficiency in chordality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603236)
