Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Landscape of the Planted Clique Problem: Dense subgraphs and the
  Overlap Gap Property   In this paper we study the computational-statistical gap of the planted
clique problem, where a clique of size $k$ is planted in an Erdos Renyi graph
$G(n,\frac{1}{2})$ resulting in a graph $G\left(n,\frac{1}{2},k\right)$. The
goal is to recover the planted clique vertices by observing
$G\left(n,\frac{1}{2},k\right)$ . It is known that the clique can be recovered
as long as $k \geq \left(2+\epsilon\right)\log n $ for any $\epsilon>0$, but no
polynomial-time algorithm is known for this task unless $k=\Omega\left(\sqrt{n}
\right)$. Following a statistical-physics inspired point of view as an attempt
to understand this computational-statistical gap, we study the landscape of the
"sufficiently dense" subgraphs of $G$ and their overlap with the planted
clique.
  Using the first moment method, we study the densest subgraph problems for
subgraphs with fixed, but arbitrary, overlap size with the planted clique, and
provide evidence of a phase transition for the presence of Overlap Gap Property
(OGP) at $k=\Theta\left(\sqrt{n}\right)$. OGP is a concept introduced
originally in spin glass theory and known to suggest algorithmic hardness when
it appears. We establish the presence of OGP when $k$ is a small positive power
of $n$ by using a conditional second moment method. As our main technical tool,
we establish the first, to the best of our knowledge, concentration results for
the $K$-densest subgraph problem for the Erdos-Renyi model
$G\left(n,\frac{1}{2}\right)$ when $K=n^{0.5-\epsilon}$ for arbitrary
$\epsilon>0$. Finally, to study the OGP we employ a certain form of
overparametrization, which is conceptually aligned with a large body of recent
work in learning theory and optimization.

13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin