Gauges, loops, and polynomials for partition functions of graphical models

DOI10.1088/1742-5468/abcaf0OpenAlexW3117283743MaRDI QIDQ5857453

Vladimir Y. Chernyak, Michael Chertkov, Yury Maximov

Publication date: 1 April 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04713

zbMATH Keywords

statistical inferencemachine learningmessage-passing algorithmsinference of graphical models

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the permanent of (some) complex matrices
• Counting in two-spin models on \(d\)-regular graphs
• Combinatorics and complexity of partition functions
• The complexity of computing the permanent
• The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
• A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems
• Belief propagation and loop series on planar graphs
• Loop calculus in statistical physics and information science
• Loop series for discrete statistical models on graphs
• Counting independent sets up to the tree threshold
• Approximating the Permanent with Fractional Belief Propagation
• Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry
• The Complexity of Approximating a Bethe Equilibrium
• The Bethe Permanent of a Nonnegative Matrix
• Multivariate stable polynomials: theory and applications
• Counting Independent Sets Using the Bethe Approximation
• Mini-buckets
• Computing the partition function for cliques in a graph
• Modern Coding Theory
• Holographic Algorithms
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Belief propagation and loop calculus for the permanent of a non-negative matrix
• Graphical Models, Exponential Families, and Variational Inference
• Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
• Information, Physics, and Computation
• Codes on graphs: normal realizations
• Counting matchings in irregular bipartite graphs and random lifts
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• A generalization of permanent inequalities and applications in counting and optimization
• Fermions and loops on graphs: I. Loop calculus for determinants
• Fermions and loops on graphs: II. A monomer–dimer model as a series of determinants
• The Power of Linear Programming for General-Valued CSPs
• Hyperbolicity and stable polynomials in combinatorics and probability
• Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
• Statistical theory of superlattices
• On Ising's model of ferromagnetism
• On Information and Sufficiency
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model

This page was built for publication: Gauges, loops, and polynomials for partition functions of graphical models