Combinatorial conditions for the unique completability of low-rank matrices

Bill Jackson, T. Jordán, Shin Ichi Tanigawa

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. Following the approach initiated by Singer and Cucuringu [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1621-1641] we study the local and global uniqueness of such completions by analyzing the structure of the graphs determined by the positions of the known entries of M or N. We present combinatorial characterizations of local and global (unique) completability for special families of graphs. We characterize local and global completability in all dimensions for cluster graphs, i.e. graphs which can be obtained from disjoint complete graphs by adding a set of independent edges. These results correspond to theorems for body-bar frameworks in rigidity theory. We also provide a characterization of two-dimensional local completability of planar bipartite graphs, which leads to a characterization of two-dimensional local completability in the rectangular matrix model when the underlying bipartite graph is planar. These results are based on new observations that certain graph operations preserve local or global completability, as well as on a further connection between rigidity and completability. We also prove that a rank condition on the completability stress matrix of a graph is a sufficient condition for global completability. This verifies a conjecture of Singer and Cucuringu given in the paper cited above.

Original languageEnglish
Pages (from-to)1797-1819
Number of pages23
JournalSIAM Journal on Discrete Mathematics
Volume28
Issue number4
DOIs
Publication statusPublished - 2014

Fingerprint

Low-rank Matrices
Graph in graph theory
Bipartite Graph
Rigidity
Positive semidefinite
Matrix Models
Square matrix
Complete Graph
Planar graph
Completion
Disjoint
Uniqueness
Verify
Subset
Sufficient Conditions
Theorem

Keywords

  • Matrix completion
  • Rigidity matroid
  • Rigidity of graphs
  • Unique completability

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Combinatorial conditions for the unique completability of low-rank matrices. / Jackson, Bill; Jordán, T.; Tanigawa, Shin Ichi.

In: SIAM Journal on Discrete Mathematics, Vol. 28, No. 4, 2014, p. 1797-1819.

Research output: Contribution to journalArticle

Jackson, Bill ; Jordán, T. ; Tanigawa, Shin Ichi. / Combinatorial conditions for the unique completability of low-rank matrices. In: SIAM Journal on Discrete Mathematics. 2014 ; Vol. 28, No. 4. pp. 1797-1819.
@article{38ab0986cac74e5c99160551e06e5e75,
title = "Combinatorial conditions for the unique completability of low-rank matrices",
abstract = "We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. Following the approach initiated by Singer and Cucuringu [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1621-1641] we study the local and global uniqueness of such completions by analyzing the structure of the graphs determined by the positions of the known entries of M or N. We present combinatorial characterizations of local and global (unique) completability for special families of graphs. We characterize local and global completability in all dimensions for cluster graphs, i.e. graphs which can be obtained from disjoint complete graphs by adding a set of independent edges. These results correspond to theorems for body-bar frameworks in rigidity theory. We also provide a characterization of two-dimensional local completability of planar bipartite graphs, which leads to a characterization of two-dimensional local completability in the rectangular matrix model when the underlying bipartite graph is planar. These results are based on new observations that certain graph operations preserve local or global completability, as well as on a further connection between rigidity and completability. We also prove that a rank condition on the completability stress matrix of a graph is a sufficient condition for global completability. This verifies a conjecture of Singer and Cucuringu given in the paper cited above.",
keywords = "Matrix completion, Rigidity matroid, Rigidity of graphs, Unique completability",
author = "Bill Jackson and T. Jord{\'a}n and Tanigawa, {Shin Ichi}",
year = "2014",
doi = "10.1137/140960098",
language = "English",
volume = "28",
pages = "1797--1819",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Combinatorial conditions for the unique completability of low-rank matrices

AU - Jackson, Bill

AU - Jordán, T.

AU - Tanigawa, Shin Ichi

PY - 2014

Y1 - 2014

N2 - We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. Following the approach initiated by Singer and Cucuringu [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1621-1641] we study the local and global uniqueness of such completions by analyzing the structure of the graphs determined by the positions of the known entries of M or N. We present combinatorial characterizations of local and global (unique) completability for special families of graphs. We characterize local and global completability in all dimensions for cluster graphs, i.e. graphs which can be obtained from disjoint complete graphs by adding a set of independent edges. These results correspond to theorems for body-bar frameworks in rigidity theory. We also provide a characterization of two-dimensional local completability of planar bipartite graphs, which leads to a characterization of two-dimensional local completability in the rectangular matrix model when the underlying bipartite graph is planar. These results are based on new observations that certain graph operations preserve local or global completability, as well as on a further connection between rigidity and completability. We also prove that a rank condition on the completability stress matrix of a graph is a sufficient condition for global completability. This verifies a conjecture of Singer and Cucuringu given in the paper cited above.

AB - We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. Following the approach initiated by Singer and Cucuringu [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1621-1641] we study the local and global uniqueness of such completions by analyzing the structure of the graphs determined by the positions of the known entries of M or N. We present combinatorial characterizations of local and global (unique) completability for special families of graphs. We characterize local and global completability in all dimensions for cluster graphs, i.e. graphs which can be obtained from disjoint complete graphs by adding a set of independent edges. These results correspond to theorems for body-bar frameworks in rigidity theory. We also provide a characterization of two-dimensional local completability of planar bipartite graphs, which leads to a characterization of two-dimensional local completability in the rectangular matrix model when the underlying bipartite graph is planar. These results are based on new observations that certain graph operations preserve local or global completability, as well as on a further connection between rigidity and completability. We also prove that a rank condition on the completability stress matrix of a graph is a sufficient condition for global completability. This verifies a conjecture of Singer and Cucuringu given in the paper cited above.

KW - Matrix completion

KW - Rigidity matroid

KW - Rigidity of graphs

KW - Unique completability

UR - http://www.scopus.com/inward/record.url?scp=84919912246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919912246&partnerID=8YFLogxK

U2 - 10.1137/140960098

DO - 10.1137/140960098

M3 - Article

AN - SCOPUS:84919912246

VL - 28

SP - 1797

EP - 1819

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 4

ER -