Almost-Linear Planted Cliques Elude the Metropolis Process

by   Zongchen Chen, et al.

A seminal work of Jerrum (1992) showed that large cliques elude the Metropolis process. More specifically, Jerrum showed that the Metropolis algorithm cannot find a clique of size k=Θ(n^α), α∈ (0,1/2), which is planted in the Erdős-Rényi random graph G(n,1/2), in polynomial time. Information theoretically it is possible to find such planted cliques as soon as k ≥ (2+ϵ) log n. Since the work of Jerrum, the computational problem of finding a planted clique in G(n,1/2) was studied extensively and many polynomial time algorithms were shown to find the planted clique if it is of size k = Ω(√(n)), while no polynomial-time algorithm is known to work when k=o(√(n)). Notably, the first evidence of the problem's algorithmic hardness is commonly attributed to the result of Jerrum from 1992. In this paper we revisit the original Metropolis algorithm suggested by Jerrum. Interestingly, we find that the Metropolis algorithm actually fails to recover a planted clique of size k=Θ(n^α) for any constant 0 ≤α < 1. Moreover, we strengthen Jerrum's results in a number of other ways including: Like many results in the MCMC literature, the result of Jerrum shows that there exists a starting state (which may depend on the instance) for which the Metropolis algorithm fails. For a wide range of temperatures, we show that the algorithm fails when started at the most natural initial state, which is the empty clique. This answers an open problem stated in Jerrum (1992). We also show that the simulated tempering version of the Metropolis algorithm, a more sophisticated temperature-exchange variant of it, also fails at the same regime of parameters. Finally, our results confirm recent predictions by Gamarnik and Zadik (2019) and Angelini, Fachin, de Feo (2021).


page 1

page 2

page 3

page 4


How to hide a clique?

In the well known planted clique problem, a clique (or alternatively, an...

Finding Planted Cliques in Sublinear Time

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

Hardness of Approximation of (Multi-)LCS over Small Alphabet

The problem of finding longest common subsequence (LCS) is one of the fu...

Algorithmic Obstructions in the Random Number Partitioning Problem

We consider the algorithmic problem of finding a near-optimal solution f...

Parallel Tempering for the planted clique problem

The theoretical information threshold for the planted clique problem is ...

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...

Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model

Over-parametrization was a crucial ingredient for recent developments in...