Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
From MaRDI portal
Publication:5346344
DOI10.1109/TIT.2013.2264715zbMath1364.94632arXiv1012.0065OpenAlexW3106495992MaRDI QIDQ5346344
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0065
Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation ⋮ Metastability of the Potts ferromagnet on random regular graphs ⋮ Statistical Matching Theory ⋮ Loop expansion around the Bethe approximation through theM-layer construction ⋮ Covers, orientations and factors ⋮ Gauges, loops, and polynomials for partition functions of graphical models ⋮ A short survey on stable polynomials, orientations and matchings
This page was built for publication: Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
