ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \bTδ\bT_\delta be the noise operator that rewires ⌊δn⌋\lfloor\delta n\rfloor swaps of a dd-regular graph, and let \sGn,d,k,η eq\sG_{n,d,k,\eta}^{\,\mathrm{eq}} be the equitable stochastic block model. Write \sG~n,d,k,η,δ eq\widetilde{\sG}^{\,\mathrm{eq}}_{n,d,k,\eta,\delta} for the distribution of \bTδ(\bG)\bT_\delta(\bG) when \bG∼\sGn,d,k,η eq\bG\sim\sG_{n,d,k,\eta}^{\,\mathrm{eq}}. For fixed δ>0\delta>0, η∈[−1k−1,1]\eta\in[-\frac{1}{k-1},1], k≥2k\geq2, and d<dKS eq(η)d<d_{\mathrm{KS}}^{\,\mathrm{eq}}(\eta), with k∣(1−η)dk\mid(1-\eta)d, the noisy equitable stochastic block model detection conjecture. There is no polynomial-time algorithm that, with high probability as n→∞n\to\infty, distinguishes \sG~n,d,k,η,δ eq\widetilde{\sG}^{\,\mathrm{eq}}_{n,d,k,\eta,\delta} from \sGn,d\sG_{n,d}. The divisibility condition ensures that the equitable model is defined for an infinite sequence of values of nn. This conjecture is used as a conditional hardness assumption for results on random regular graphs; the added rewiring noise is stated to be crucial to the conjecture's applicability.

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.