Census non-solvability at the Kesten–Stigum threshold
Statement
Let be a channel with second eigenvalue , and let be the -ary tree. The reconstruction problem is census-solvable when the root can be reconstructed from the empirical counts of the symbols at a level. Census non-solvability conjecture. The reconstruction problem is not census-solvable when
The surrounding theorem establishes the corresponding strict inequalities, while the equality case is left as a conjecture in the source.
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.