Decelle et al.'s computational impossibility conjecture below the Kesten–Stigum threshold
Statement
Let follow the same stochastic block model as in the achievability conjecture, with
Decelle et al.'s computational impossibility conjecture. Irrespective of , if , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.