Limits of local algorithms over sparse random graphs

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.

[1]  Andrei Agrachev,et al.  Some open problems , 2013, 1304.2590.

[2]  Fedor Nazarov,et al.  Perfect matchings as IID factors on non-amenable groups , 2009, Eur. J. Comb..

[3]  B. Szegedy,et al.  Limits of locally–globally convergent graph sequences , 2014 .

[4]  Alan M. Frieze,et al.  On the independence and chromatic numbers of random regular graphs , 1992, J. Comb. Theory, Ser. B.

[5]  David Gamarnik,et al.  Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , 2010, STOC '10.

[6]  Jorge Urrutia,et al.  Some Open Problems , 2012 .

[7]  Terrence J. Sejnowski,et al.  A Variational Principle for Graphical Models , 2007 .

[8]  M. Talagrand.  Mean Field Models for Spin Glasses , 2011 .

[9]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[10]  B. Szegedy,et al.  Limits of local-global convergent graph sequences , 2012, 1205.4356.

[11]  Gabor Lippner,et al.  Invariant random matchings in Cayley graphs , 2012, 1211.2374.

[12]  Alan M. Frieze,et al.  On the independence number of random graphs , 1990, Discret. Math..

[13]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory, Ser. B.

[14]  V. Sós,et al.  Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .

[15]  Amin Coja-Oghlan,et al.  On belief propagation guided decimation for random k-SAT , 2010, SODA '11.

[16]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[17]  RonDana,et al.  Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms , 2007 .

[18]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[19]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[20]  Béla Bollobás,et al.  Random Graphs , 1985 .

[21]  Thierry Mora,et al.  Clustering of solutions in the random satisfiability problem , 2005, Physical review letters.

[22]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[23]  Martin J. Wainwright,et al.  A variational principle for graphical models , 2005 .

[24]  Michel Talagrand,et al.  Construction of pure states in mean field models for spin glasses , 2010 .

[25]  Gabor Lippner,et al.  Borel oracles. An analytical approach to constant-time algorithms , 2009, 0907.1805.

[26]  M. Mézard,et al.  Information, Physics, and Computation , 2009 .

[27]  Amin Coja-Oghlan,et al.  On independent sets in random graphs , 2010, SODA '11.

[28]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[29]  Amin Coja-Oghlan,et al.  On the solution‐space geometry of random constraint satisfaction problems , 2011, Random Struct. Algorithms.

[30]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[31]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[32]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[33]  László Lovász,et al.  Left and right convergence of graphs with bounded degree , 2010, Random Struct. Algorithms.

[34]  Terrence J. Sejnowski,et al.  New Directions in Statistical Signal Processing: From Systems to Brains (Neural Information Processing) , 2006 .

[35]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[36]  Richard M. Karp,et al.  Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[37]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..