Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach
Mahya Ghandehari, Teddy Mishura · The Electronic Journal of Combinatorics · 2024
This paper investigates the Robinson graphon completion/recovery problem within the class of $L^p$-graphons, focusing on the range $5 5$, any $L^p$-graphon $w$ can be approximated by a Robinson graphon, with error of the approximation bounded in terms of $\Lambda(w)$. When viewing $w$ as a noisy version of a Robinson graphon, our method provides a concrete recipe for recovering a cut-norm approximation of a noiseless $w$. Given that any symmetric matrix is a special type of graphon, our results can be applicable to symmetric matrices of any size. Our work extends and improves previous results, where a similar question for the special case of $L^\infty$-graphons was answered.