Inference in Sparse Graphs with Pairwise Measurements and Side Information

Dylan J. Foster, Daniel Reichman, Karthik Sridharan

We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurement…