ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let I(delta)I(delta) denote the mutual information in the binary-tree broadcasting model, let δc\delta_c be the critical channel parameter, and write δ=δc−τ\delta=\delta_c-\tau with τ≪1\tau\ll 1. Mutual-information critical exponent conjecture.

I(δc−τ)=42ln⁡2τ+o(τ) bit.I(\delta_c-\tau)=\frac{4\sqrt{2}}{\ln 2}\tau+o(\tau)\text{ bit}.

This conjecture specifies the sharp first-order behavior of the mutual information as the critical point is approached from below, improving the currently stated linear upper and lower bounds.

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.