ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a constant p∈(0,1)p\in(0,1). Let EE be a fixed known partition of [n][n] into knk_n equally sized subsets, and under the alternative choose exactly one planted clique vertex uniformly from each part. Let k\textsc−PCD(n,kn,p)k\textsc{-PC}_D(n,k_n,p) denote the resulting detection problem, with hypotheses H0H_0 and H1H_1. For randomized polynomial-time algorithms An:Gn→{0,1}A_n:G_n\to\{0,1\} and positive-integer sequences knk_n satisfying

lim sup⁡n→∞log⁡nkn<12,\limsup_{n\to\infty}\log_n k_n<\frac{1}{2},

the kk-planted clique conjecture. If GG is an instance of k\textsc−PCD(n,kn,p)k\textsc{-PC}_D(n,k_n,p), then

lim inf⁡n→∞(PH0[An(G)=1]+PH1[An(G)=0])≥1.\liminf_{n\to\infty}\left(\mathbb{P}_{H_0}[A_n(G)=1]+\mathbb{P}_{H_1}[A_n(G)=0]\right)\geq 1.

This is a planted-clique hardness assumption with secret leakage: the algorithm knows the partition, while the planted set contains one uniformly selected vertex from each part. The supplied text gives no evidence that the conjecture has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.