Graph-cover characterization conjecture for Bethe partition functions of DE-NFGs
Statement
Let be a DE-NFG, for which denotes the degree- Bethe partition function and denotes the Bethe partition function associated with the sum-product-algorithm formulation for DE-NFGs.
Graph-cover characterization conjecture. It holds that
This conjecture asks whether the graph-cover characterization of the Bethe partition function for S-NFGs extends to DE-NFGs. The right-hand side uses , since the ordinary Bethe partition function is not defined for DE-NFGs; the paper proves the claim for a class of DE-NFGs satisfying a checkable condition.
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.