Infinite families of graphs and stable completion of arbitrary matrices, Part I

Augustin Cosse

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the c…