ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (G1,G2)∼ρ(G_1,G_2)\sim \rho-SBM(K,n⃗,b,Λ)(K,\vec{n},b,\Lambda), with KK and Λ\Lambda fixed in nn, and let σ\boldsymbol{\sigma} be uniformly distributed on Π(n)\Pi(n). Relative information-loss conjecture. If ρ=o(log⁡n/n)\rho=o(\sqrt{\log n/n}), then

I(G1;G2)−I(G1;σ(G2))I(G1;G2)=Θ(1).\frac{I(G_1;G_2)-I(G_1;\boldsymbol{\sigma}(G_2))}{I(G_1;G_2)}=\Theta(1).

This conjectures that below the matchability threshold, a nontrivial fraction of the mutual information between the two graphs is lost under vertex shuffling. The preceding theorem establishes non-matchability in a related low-correlation regime, but the asserted information-loss estimate is not proved in the supplied text.

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.