Algorithms approaching the threshold for semi-random planted clique

by   Rares-Darius Buhai, et al.

We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian <cit.>. The previous best algorithms for this model succeed if the planted clique has size at least n^2/3 in a graph with n vertices (Mehta, Mckenzie, Trevisan, 2019 and Charikar, Steinhardt, Valiant 2017). Our algorithms work for planted-clique sizes approaching n^1/2 – the information-theoretic threshold in the semi-random model <cit.> and a conjectured computational threshold even in the easier fully-random model. This result comes close to resolving open questions by Feige and Steinhardt. Our algorithms are based on higher constant degree sum-of-squares relaxation and rely on a new conceptual connection that translates certificates of upper bounds on biclique numbers in unbalanced bipartite Erdős–Rényi random graphs into algorithms for semi-random planted clique. The use of a higher-constant degree sum-of-squares is essential in our setting: we prove a lower bound on the basic SDP for certifying bicliques that shows that the basic SDP cannot succeed for planted cliques of size k =o(n^2/3). We also provide some evidence that the information-computation trade-off of our current algorithms may be inherent by proving an average-case lower bound for unbalanced bicliques in the low-degree-polynomials model.


page 1

page 2

page 3

page 4


A degree 4 sum-of-squares lower bound for the clique number of the Paley graph

We prove that the degree 4 sum-of-squares (SOS) relaxation of the clique...

Algorithmic Thresholds for Refuting Random Polynomial Systems

Consider a system of m polynomial equations {p_i(x) = b_i}_i ≤ m of degr...

Is Planted Coloring Easier than Planted Clique?

We study the computational complexity of two related problems: recoverin...

Convergence rates for sums-of-squares hierarchies with correlative sparsity

This work derives upper bounds on the convergence rate of the moment-sum...

Cut Sparsification of the Clique Beyond the Ramanujan Bound

We prove that a random d-regular graph, with high probability, is a cut ...

Finding Planted Cliques in Sublinear Time

We study the planted clique problem in which a clique of size k is plant...

A Stress-Free Sum-of-Squares Lower Bound for Coloring

We prove that with high probability over the choice of a random graph G ...

Please sign up or login with your details

Forgot password? Click here to reset