Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs
share
In this paper we study the matrix completion problem: Suppose X ∈R^n_r × n_c is unknown except for an upper bound r on its rank. By measuring a small number m ≪ n_r n_c of elements of X, is it possible to recover X exactly, or at least, to construct a reasonable approximation of X? There are two approaches to choosing the sample set, namely probabilistic and deterministic. At present there are very few deterministic methods, and they apply only to square matrices. The focus in the present paper is on deterministic methods that work for rectangular as well as square matrices. The elements to be sampled are chosen as the edge set of an asymmetric Ramanujan graph. For such a measurement matrix, we derive bounds on the error between a scaled version of the sampled matrix and unknown matrix, and show that, under suitable conditions, the unknown matrix can be recovered exactly. Even for the case of square matrices, these bounds are an improvement on known results. Of course they are entirely new for rectangular matrices. This raises the question of how such asymmetric Ramanujan graphs might be constructed. While some techniques exist for constructing Ramanujan bipartite graphs with equal numbers of vertices on both sides, until now no methods exist for constructing Ramanujan bipartite graphs with unequal numbers of vertices on the two sides. We provide a method for the construction of an infinite family of asymmetric biregular Ramanujan graphs with q^2 left vertices and lq right vertices, where q is any prime number and l is any integer between 2 and q. The left degree is l and the right degree is q. So far as the authors are aware, this is the first explicit construction of an infinite family of asymmetric Ramanujan graphs.
READ FULL TEXT