Finding Planted Cliques in Sublinear Time

04/24/2020
by   Jay Mardia, et al.
0

We study the planted clique problem in which a clique of size k is planted in an Erdős-Rényi graph of size n and one wants to recover this planted clique. For k=Ω(√(n)), polynomial time algorithms can find the planted clique. The fastest such algorithms run in time linear O(n^2) (or nearly linear) in the size of the input [FR10,DGGP14,DM15a]. In this work, we initiate the development of sublinear time algorithms that find the planted clique when k=ω(√(n loglog n)). Our algorithms can recover the clique in time O(n+(n/k)^3)=O(n^3/2) when k=Ω(√(nlog n)), and in time O(n^2/(k^2/24n)) for ω(√(nloglog n))=k=o(√(nlogn)). An Ω(n) running time lower bound for the planted clique recovery problem follows easily from the results of [RS19] and therefore our recovery algorithms are optimal whenever k = Ω(n^2/3). As the lower bound of [RS19] builds on purely information theoretic arguments, it cannot provide a detection lower bound stronger than Ω(n^2/k^2). Since our algorithms for k = Ω(√(n log n)) run in time O(n^3/k^3 + n), we show stronger lower bounds based on computational hardness assumptions. With a slightly different notion of the planted clique problem we show that the Planted Clique Conjecture implies the following. A natural family of non-adaptive algorithms—which includes our algorithms for clique detection—cannot reliably solve the planted clique detection problem in time O( n^3-δ/k^3) for any constant δ>0. Thus we provide evidence that if detecting small cliques is hard, it is also likely that detecting large cliques is not too easy.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/28/2021

On Lower Bounds of Approximating Parameterized k-Clique

Given a simple graph G and an integer k, the goal of k-Clique problem is...
12/17/2020

Clique Is Hard on Average for Regular Resolution

We prove that for k ≪√(n) regular resolution requires length n^Ω(k) to e...
11/11/2020

The Strongish Planted Clique Hypothesis and Its Consequences

We formulate a new hardness assumption, the Strongish Planted Clique Hyp...
08/28/2020

Is the space complexity of planted clique recovery the same as that of detection?

We study the planted clique problem in which a clique of size k is plant...
02/16/2018

Parallel Tempering for the planted clique problem

The theoretical information threshold for the planted clique problem is ...
08/08/2019

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries

This paper develops several average-case reduction techniques to show ne...
09/12/2020

Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection

We note the significance of hypergraphic planted clique (HPC) detection ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.