ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be uniformly distributed on {0,1}n\{0,1\}^n, let Y=BDC⁡d(X)Y=\operatorname{BDC}_d(X) be the output of the binary deletion channel with deletion probability dd, and let D(X,Y)\mathcal{D}(X,Y) be the set of length-nn strings compatible with XX and YY. Let En=1nElog⁡∣D(X,Y)∣E_n=\frac{1}{n}\mathbb{E}\log|\mathcal{D}(X,Y)|. Concentration conjecture, strong form. For every γ>0\gamma>0,

P(∣1nlog⁡∣D(X,Y)∣−En∣≥γ)≤e−Ω(n/poly⁡(log⁡n)).\mathbb{P}\left(\left|\frac{1}{n}\log|\mathcal{D}(X,Y)|-E_n\right|\geq\gamma\right)\leq e^{-\Omega\left(n/\operatorname{poly}(\log n)\right)}.

The strong form is stated to imply the weak almost-sure concentration conjecture by the paper's convergence lemma and the Borel–Cantelli lemma. Proving it would substantially justify the observed accuracy of the simulation-based estimates.

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.