ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gn∼PDS(n,kn,pn,qn)G_n\sim\mathsf{PDS}(n,k_n,p_n,q_n), where the planted support has size knk_n. Exact recovery means outputting the planted support. If kn=ω(n)k_n=\omega(\sqrt n) and

lim sup⁡n→∞log⁡nkn2(pn−qn)2nqn(1−qn)<0,\limsup_{n\to\infty}\log_n\frac{k_n^2(p_n-q_n)^2}{nq_n(1-q_n)}<0,

the planted dense subgraph recovery conjecture. No polynomial-time algorithm A:G→([n]kn)\mathcal{A}:G\to{[n]\choose k_n} can achieve exact recovery asymptotically.

The conjecture concerns the computational threshold for recovering the planted dense subgraph, which is asserted to be substantially stronger than the threshold for detection. The surrounding discussion attributes this conjectured threshold to prior work, but the supplied text gives no resolution.

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.