Relative mutual-information loss conjecture for shuffled stochastic block models
Statement
Let -SBM, with and fixed in , and let be uniformly distributed on . Relative information-loss conjecture. If , then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.