ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be the number of Potts symbols, let θ=tanh⁡(β)\theta=\tanh(\beta), and let d0d_0 denote the random offspring degree under the tree measure QQ. Reconstruction is the problem of recovering the root state from the states arbitrarily far from the root. Purity conjecture. For q≤4q\leq 4, there is QQ-almost surely no reconstruction if

Q(d0)(2θq−(q−2)θ)2<1.\mathbb{Q}(d_0)\left(\frac{2\theta}{q-(q-2)\theta}\right)^2<1.

This conjecture asserts sharpness of the Kesten–Stigum bound in the stated regime for random trees, extending the corresponding conjecture of Mézard and Montanari for regular trees. The paper notes that numerical evidence supports the claim, while results cited there establish sharpness for q≤3q\leq 3 only in sufficiently large degree and non-sharpness for q≥5q\geq 5; the stated random-tree claim remains open 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 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.