Combinatorial Conditions for the Unique Completability of Low-Rank Matrices

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 rect...

[1]  Walter Whiteley,et al.  Vertex Splitting in Isostatic Frameworks , 1990 .

[2]  Steven J. Gortler,et al.  Characterizing generic global rigidity , 2007, Ad Hoc Networks.

[3]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[4]  Franz J. Király,et al.  The algebraic combinatorial approach for low-rank matrix completion , 2012, J. Mach. Learn. Res..

[5]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[6]  Walter Whiteley,et al.  SOME NOTES ON THE EQUIVALENCE OF FIRST-ORDER RIGIDITY IN VARIOUS GEOMETRIES , 2007, 0709.3354.

[7]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[8]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[9]  Tiong-Seng Tay,et al.  Rigidity of multi-graphs. I. Linking rigid bodies in n-space , 1984, J. Comb. Theory, Ser. B.

[10]  Robert Connelly,et al.  Global Rigidity: The Effect of Coning , 2010, Discret. Comput. Geom..

[11]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization the Dress Conjectures on Rank in the 3-dimensional Rigidity Matroid the Dress Conjectures on Rank in the 3-dimensional Rigidity Matroid , 2003 .

[12]  M. Laurent,et al.  Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property , 2013, 1301.6616.

[13]  A. V. Pogorelov.  Extrinsic geometry of convex surfaces , 1973 .

[14]  Walter Whiteley,et al.  Some matroids from discrete applied geometry , 1996 .

[15]  Amit Singer,et al.  Uniqueness of Low-Rank Matrix Completion by Rigidity Theory , 2009, SIAM J. Matrix Anal. Appl..

[16]  Gil Kalai,et al.  Bipartite Rigidity , 2013, 1312.0209.

[17]  Tiong-Seng Tay,et al.  Rigidity of multi-graphs II , 1984 .

[18]  Bill Jackson,et al.  On the Rank Function of the 3-Dimensional Rigidity Matroid Bill Jackson ? and , 2005 .

[19]  Walter Whiteley,et al.  Cones, infinity and one-story buildings , 1983 .

[20]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[21]  Ivan Izmestiev,et al.  Projective background of the infinitesimal rigidity of frameworks , 2008, 0804.2694.

[22]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[23]  Vladimir Batagelj.  An inductive definition of the class of 3-connected quadrangulations of the plane , 1989, Discret. Math..

[24]  Monique Laurent,et al.  A new graph parameter related to bounded rank positive semidefinite matrix completions , 2012, Math. Program..

[25]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[26]  Tibor Jordán,et al.  Generic global rigidity of body-bar frameworks , 2013, J. Comb. Theory B.

[27]  Tibor Jordán,et al.  Egerváry Research Group on Combinatorial Optimization Operations Preserving the Global Rigidity of Graphs and Frameworks in the Plane Operations Preserving the Global Rigidity of Graphs and Frameworks in the Plane , 2022 .