DeepAI AI Chat
Log In Sign Up

Exact recovery of Planted Cliques in Semi-random graphs

11/17/2020
by   Yash Khanna, et al.
indian institute of science
0

In this paper, we study the Planted Clique problem in a semi-random model. Our model is inspired from the Feige-Kilian model [FK01] which has been studied in many other works [Ste17, MMT20]. Our algorithm and analysis is on similar lines to the one studied for the Densest k-subgraph problem in the recent work of Khanna and Louis [KL20]. However since our algorithm fully recovers the planted clique w.h.p., we require some new ideas. As a by-product of our main result, we give an alternate SDP based rounding algorithm (with matching guarantees) for solving the Planted Clique problem in a random graph. Also, we are able to solve special cases of the DkSReg(n, k, d, δ, γ) and DkSReg(n, k, d, δ, d', λ) models introduced in [KL20], when the planted subgraph 𝒢[𝒮] is a clique instead of an arbitrary d-regular graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/24/2019

Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number

In this study, we address the independent set enumeration problem. Altho...
05/17/2023

Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles

We aim to understand the extent to which the noise distribution in a pla...
07/03/2019

Solving Partial Assignment Problems using Random Clique Complexes

We present an alternate formulation of the partial assignment problem as...
04/15/2019

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 ...
03/07/2021

Termination of Multipartite Graph Series Arising from Complex Network Modelling

An intense activity is nowadays devoted to the definition of models capt...
08/13/2020

Cut Sparsification of the Clique Beyond the Ramanujan Bound

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