Suboptimality of local algorithms for a class of max-cut problems

We show that in random $K$-uniform hypergraphs of constant average degree, for even $K \geq 4$, local algorithms defined as factors of i.i.d. can not find nearly maximal cuts, when the average degree is sufficiently large. These algorithms have been used frequently to obtain lower bounds for the max-cut problem on random graphs, but it was not known whether they could be successful in finding nearly maximal cuts. This result follows from the fact that the overlap of any two nearly maximal cuts in such hypergraphs does not take values in a certain non-trivial interval - a phenomenon referred to as the overlap gap property - which is proved by comparing diluted models with large average degree with appropriate fully connected spin glass models and showing the overlap gap property in the latter setting.

[1]  Dmitry Panchenko,et al.  The Parisi formula for mixed $p$-spin models , 2011, 1112.4409.

[2]  A connection between MAX $κ$-CUT and the inhomogeneous Potts spin glass in the large degree limit , 2017 .

[3]  Dmitry Panchenko,et al.  On the K‐sat model with large number of clauses , 2016, Random Struct. Algorithms.

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

[5]  Wei-Kuo Chen,et al.  Variational representations for the Parisi functional and the two-dimensional Guerra-Talagrand bound , 2015, 1501.06635.

[6]  M. Talagrand,et al.  Bounds for diluted mean-fields spin glass models , 2004, math/0405357.

[7]  F. Guerra.  Broken Replica Symmetry Bounds in the Mean Field Spin Glass Model , 2002, cond-mat/0205123.

[8]  Balázs Szegedy,et al.  On large‐girth regular graphs and random processes on trees , 2014, Random Struct. Algorithms.

[9]  B. Szegedy,et al.  On the almost eigenvectors of random regular graphs , 2016, Annals of Probability.

[10]  M. Talagrand.  Mean Field Models for Spin Glasses: Some Obnoxious Problems , 2007 .

[11]  'Agnes Backhausz,et al.  Spectral measures of factor of i.i.d. processes on vertex-transitive graphs , 2015, 1505.07412.

[12]  F. Guerra,et al.  The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.

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

[14]  Aukosh Jagannath,et al.  A Dynamic Programming Approach to the Parisi Functional , 2015, 1502.04398.

[15]  Dmitry Panchenko,et al.  The Parisi ultrametricity conjecture , 2011, 1112.1003.

[16]  Andrea Montanari,et al.  How well do local algorithms solve semidefinite programs? , 2016, STOC.

[17]  Madhu Sudan,et al.  Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem , 2017, SIAM J. Comput..

[18]  M. Talagrand.  The parisi formula , 2006 .

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

[20]  Wei-Kuo Chen,et al.  The SK model is Full-step Replica Symmetry Breaking at zero temperature , 2017 .

[21]  Andrea Montanari,et al.  Extremal Cuts of Sparse Random Graphs , 2015, ArXiv.

[22]  W. Fleming,et al.  Controlled Markov processes and viscosity solutions , 1992 .

[23]  Giorgio Parisi,et al.  Infinite Number of Order Parameters for Spin-Glasses , 1979 .

[24]  G. Parisi.  A sequence of approximated solutions to the S-K model for spin glasses , 1980 .

[25]  Bálint Virág,et al.  Local algorithms for independent sets are half-optimal , 2014, ArXiv.

[26]  Xiongzhi Chen.  Brownian Motion and Stochastic Calculus , 2008 .

[27]  Viktor Harangi,et al.  Independence ratio and random eigenvectors in transitive graphs , 2013, 1308.5173.

[28]  Wei-Kuo Chen,et al.  Parisi formula for the ground state energy in the mixed p-spin model , 2016, 1606.05335.

[29]  B. Szegedy,et al.  Limits of locally–globally convergent graph sequences , 2012, Geometric and Functional Analysis.

[30]  F. Guerra,et al.  The High Temperature Region of the Viana–Bray Diluted Spin Glass Model , 2003, cond-mat/0302401.

[31]  Wei-Kuo Chen,et al.  Disorder chaos in some diluted spin glass models , 2017, The Annals of Applied Probability.

[32]  Mustazee Rahman,et al.  Factor of IID Percolation on Trees , 2014, SIAM J. Discret. Math..

[33]  Madhu Sudan,et al.  Limits of local algorithms over sparse random graphs , 2013, ITCS.

[34]  Michele Leone,et al.  Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .

[35]  Random Multi-Overlap Structures and Cavity Fields in Diluted Spin Glasses , 2004, cond-mat/0403506.

[36]  D. Panchenko.  The Sherrington-Kirkpatrick Model , 2013 .

[37]  G. Ben Arous,et al.  Spectral Gap Estimates in Mean Field Spin Glasses , 2017, 1705.04243.

[38]  A. Bruckner,et al.  Differentiation of real functions , 1978 .

[39]  Wei-Kuo Chen,et al.  The Parisi Formula has a Unique Minimizer , 2014, 1402.5132.

[40]  Tim Austin.  Mean field models for spin glasses , 2012 .

[41]  Wei-Kuo Chen,et al.  On the energy landscape of the mixed even p-spin model , 2016, 1609.04368.

[42]  Nicholas C. Wormald,et al.  Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs , 2013, Combinatorica.

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