ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,G)(X,G) follow the same stochastic block model as in the achievability conjecture, with

SNR⁡=(a−b)2k(a+(k−1)b).\operatorname{SNR}=\frac{(a-b)^2}{k(a+(k-1)b)}.

Decelle et al.'s computational impossibility conjecture. Irrespective of kk, if SNR⁡<1\operatorname{SNR}<1, it is impossible to detect communities in polynomial time. This is the computational counterpart to the Kesten–Stigum achievability statement. The source presents it among further conjectures concerning impossibility statements; no resolution is given in the supplied text.

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.