Bounding the Bethe and the Degree- Bethe Permanents
arXiv:1503.02217
Abstract
It was recently conjectured that the permanent of a -lifting of a matrix of degree is less than or equal to the th power of the permanent perm, i.e., perm and, consequently, that the degree- Bethe permanent of a matrix is less than or equal to the permanent perm of , i.e., perm. In this paper, we prove these related conjectures and show in addition a few properties of the permanent of block matrices that are lifts of a matrix. As a corollary, we obtain an alternative proof of the inequality perm on the Bethe permanent of the base matrix that uses only the combinatorial definition of the Bethe permanent.
References in corpus (5)
- The Bethe Partition Function of Log-supermodular Graphical Models
- Unleashing the power of Schrijver's permanental inequality with the help of the Bethe Approximation
- Approximating the Permanent with Belief Propagation
- A rigorous proof of the cavity method for counting matchings
- Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties