Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't

We consider a variation of the problem of corruption detection on networks posed by Alon, Mossel, and Pemantle u002715. In this model, each vertex of a graph can be either truthful or corrupt. Each vertex reports about the types (truthful or corrupt) of all its neighbors to a central agency, where truthful nodes report the true types they...More