![Graph Limits and Processes on Networks_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-03/Graph%20Limits%20and%20Processes%20on%20Networks_hi-res.jpg?h=6dcb57f1&itok=0PfSnAhz)
Abstract
The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. I will give a necessary and sufficient condition, stated in the language of graph limit theory, for a sequence of matrix completion problems with arbitrary missing patterns to be asymptotically solvable. I will also present an algorithm that is able to approximately recover the matrix whenever recovery is possible.