Corpus ID: 216552971

# Finding Planted Cliques in Sublinear Time

@article{Mardia2020FindingPC,
title={Finding Planted Cliques in Sublinear Time},
author={Jay Mardia and Hilal Asi and Kabir Chandrasekher},
journal={ArXiv},
year={2020},
volume={abs/2004.12002}
}
• Published 2020
• Mathematics, Computer Science
• ArXiv
• We study the planted clique problem in which a clique of size $k$ is planted in an Erdős-Renyi graph of size $n$ and one wants to recover this planted clique. For $k=\Omega(\sqrt{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 develop sublinear time algorithms that find the planted clique when $k=\omega(\sqrt{n \log \log n})$. Our algorithms can… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

## The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

• Computer Science, Mathematics
• ArXiv
• 2019

## Finding a planted clique by adaptive probing

• Computer Science, Mathematics
• ArXiv
• 2019

## Finding hidden cliques in linear time

• Mathematics
• 2009

## Finding cliques using few probes

• Computer Science, Mathematics
• Random Struct. Algorithms
• 2020

## Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

• Computer Science, Mathematics
• COLT
• 2015

## On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

• Mathematics, Computer Science
• SODA
• 2016

## Sum-of-squares Lower Bounds for Planted Clique

• Computer Science, Mathematics
• STOC '15
• 2015

## Finding Hidden Cliques in Linear Time with High Probability

• Mathematics, Computer Science
• Comb. Probab. Comput.
• 2014

## Computational Barriers in Minimax Submatrix Detection

• Computer Science, Mathematics
• ArXiv
• 2013

## A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

• Boaz Barak, +3 authors Aaron Potechin
• Computer Science, Mathematics
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016