Corruption Detection on Networks
Year: 2015
Type: preprint
Abstract: We consider the problem of corruption detection on networks. We show that graph expansion is necessary for corruption detection and discuss algorithms and the computational hardness of the problem. 1
Source: arXiv (Cornell University)
Authors: Noga Alon, Elchanan Mossel, Robin Pemantle
Institutions: Tel Aviv University, University of Pennsylvania
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2120167892
