Limits of local algorithms over sparse random graphs
Name
Gamarnik_Limits of local.pdf
Size
235.37 KB
Format
Adobe PDF
Checksum (MD5)
2f3cd5ce04a050aee13ccdc957aa0d71
Author(s)
Gamarnik, David
Sudan, Madhu
Date Issued
January 2014
Journal
Proceedings of the 5th Conference on Innovations in Theoretical Computer Science - ITCS '14
Publisher
Association for Computing Machinery
Citation
Gamarnik, David, and Madhu Sudan. “Limits of Local Algorithms over Sparse Random Graphs.” Proceedings of the 5th Conference on Innovations in Theoretical Computer Science - ITCS ’14 (2014), Jan. 12-14, 2014, Princeton, New Jersey, USA.
Version
Author's final manuscript
Abstract
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the global structure, while also potentially using some randomness. Research over the years has shown that such algorithms can be surprisingly powerful in terms of computing structures like large independent sets in graphs locally. These algorithms have also been implicitly considered in the work on graph limits, where a conjecture due to Hatami, Lovász and Szegedy [17] implied that local algorithms may be able to compute near-maximum independent sets in (sparse) random d-regular graphs. In this paper we refute this conjecture and show that every independent set produced by local algorithms is smaller that the largest one by a multiplicative factor of at least 1/2+1/(2√2) ≈ .853, asymptotically as d → ∞.
Our result is based on an important clustering phenomena predicted first in the literature on spin glasses, and recently proved rigorously for a variety of constraint satisfaction problems on random graphs. Such properties suggest that the geometry of the solution space can be quite intricate. The specific clustering property, that we prove and apply in this paper shows that typically every two large independent sets in a random graph either have a significant intersection, or have a nearly empty intersection. As a result, large independent sets are clustered according to the proximity to each other. While the clustering property was postulated earlier as an obstruction for the success of local algorithms, such as for example, the Belief Propagation algorithm, our result is the first one where the clustering property is used to formally prove limits on local algorithms.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2554797.2554831
