ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be an order-KK hypergraph in the HPC detection problem, with null distribution H0:H∼HK(p,1/2)H_0:H\sim\mathcal{H}_K(p,1/2) and planted-clique alternative H1:H∼HK(p,1/2,κp)H_1:H\sim\mathcal{H}_K(p,1/2,\kappa_p), where {κp}\{\kappa_p\} satisfies

lim sup⁡p→∞log⁡κplog⁡p≤1−τ.\limsup_{p\to\infty}\frac{\log\kappa_p}{\log\sqrt{p}}\leq 1-\tau.

A polynomial-time test is a sequence {φp}\{\varphi_p\} with φp:H↦{0,1}\varphi_p:H\mapsto\{0,1\}. HPC conjecture. For every sequence of polynomial-time tests {φp}\{\varphi_p\},

lim inf⁡p→∞PH0(φp(H)=1)+PH1(φp(H)=0)≥12.\liminf_{p\to\infty}\mathbb{P}_{H_0}\bigl(\varphi_p(H)=1\bigr)+\mathbb{P}_{H_1}\bigl(\varphi_p(H)=0\bigr)\geq\frac{1}{2}.

Thus, when the planted clique size is below the stated threshold, no polynomial-time test can reliably distinguish the null hypergraph from the hypergraph with a planted clique. This computational hardness conjecture is used to derive computational limits for degree-corrected tensor block models; its resolution status is not specified 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.