Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs

Abstract

We study the problem of efficiently refuting the k-colorability of a graph, or equivalently certifying a lower bound on its chromatic number. We give formal evidence of average-case computational hardness for this problem in sparse random regular graphs, showing optimality of a simple spectral certificate. This evidence takes the form of a computationally-quiet planting: we construct a distribution of d-regular graphs that has significantly smaller chromatic number than a typical regular graph drawn uniformly at random, while providing evidence that these two distributions are indistinguishable by a large class of algorithms. We generalize our results to the more general problem of certifying an upper bound on the maximum k-cut. This quiet planting is achieved by minimizing the effect of the planted structure (e.g. colorings or cuts) on the graph spectrum. Specifically, the planted structure corresponds exactly to eigenvectors of the adjacency matrix. This avoids the pushout effect of random matrix theory, and delays the point at which the planting becomes visible in the spectrum or local statistics. To illustrate this further, we give similar results for a Gaussian analogue of this problem: a quiet version of the spiked model, where we plant an eigenspace rather than adding a generic low-rank perturbation. Our evidence for computational hardness of distinguishing two distributions is based on three different heuristics: stability of belief propagation, the local statistics hierarchy, and the low-degree likelihood ratio. Of independent interest, our results include general-purpose bounds on the low-degree likelihood ratio for multi-spiked matrix models, and an improved low-degree analysis of the stochastic block model.

arXiv comment59 pages

References in corpus (17)

• Message Passing Algorithms for Compressed Sensing
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• Broken Replica Symmetry Bounds in the Mean Field Spin Glass Model
• Phase transition in the detection of modules in sparse networks
• Graph spectra and the detectability of community structure in networks
• The largest eigenvalue of rank one deformation of large Wigner matrices
• The largest eigenvalues of finite rank deformation of large Wigner matrices: convergence and nonuniversality of the fluctuations
• Hiding Quiet Solutions in Random Constraint Satisfaction Problems
• Extremal Cuts of Sparse Random Graphs
• MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel
• Quiet Planting in the Locked Constraint Satisfaction Problems
• Equitable random graphs
• A connection between MAX $\kappa$-CUT and the inhomogeneous Potts spin glass in the large degree limit
• Bayesian estimation from few samples: community detection and related problems
• Spectral partitioning in equitable graphs
• High-Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transition
• Lifting Sum-of-Squares Lower Bounds: Degree-$2$ to Degree-$4$

Cited by in corpus (6)

• Computational Barriers to Estimation from Low-Degree Polynomials
• Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
• Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube
• Hypothesis testing with low-degree polynomials in the Morris class of exponential families
• Precise Error Rates for Computationally Efficient Testing
• Sum-of-Squares Lower Bounds for Sparse Independent Set