Loop series for discrete statistical models on graphs
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Exactly solvable models; Bethe ansatz (82B23) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31)
Abstract: In this paper we present derivation details, logic, and motivation for the loop calculus introduced in cite{06CCa}. Generating functions for three inter-related discrete statistical models are each expressed in terms of a finite series. The first term in the series corresponds to the Bethe-Peierls (Belief Propagation)-BP contribution, the other terms are labeled by loops on the factor graph. All loop contributions are simple rational functions of spin correlation functions calculated within the BP approach. We discuss two alternative derivations of the loop series. One approach implements a set of local auxiliary integrations over continuous fields with the BP contribution corresponding to an integrand saddle-point value. The integrals are replaced by sums in the complimentary approach, briefly explained in cite{06CCa}. A local gauge symmetry transformation that clarifies an important invariant feature of the BP solution, is revealed in both approaches. The partition function remains invariant while individual terms change under the gauge transformation. The requirement for all individual terms to be non-zero only for closed loops in the factor graph (as opposed to paths with loose ends) is equivalent to fixing the first term in the series to be exactly equal to the BP contribution. Further applications of the loop calculus to problems in statistical physics, computer and information sciences are discussed.
Recommendations
- Loop calculus in statistical physics and information science
- Partition function loop series for a general graphical model: free-energy corrections and message-passing equations
- Fermions and loops on graphs. I: Loop calculus for determinants
- Loop series expansion with propagation diagrams
- Belief propagation and loop series on planar graphs
Cites work
- A Theory of Cooperative Phenomena
- Codes on graphs: normal realizations
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Factor graphs and the sum-product algorithm
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Good error-correcting codes based on very sparse matrices
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Loop calculus in statistical physics and information science
- On Ising's model of ferromagnetism
- Statistical theory of superlattices
- Survey propagation as local equilibrium equations
Cited in
(31)- On forest expansions for two-body partition functions on tree-like interaction graphs
- Evaluations of Tutte polynomials of regular graphs
- Counting degree-constrained subgraphs and orientations
- Random cluster model on regular graphs
- Approximate inference on planar graphs using loop calculus and belief propagation
- Belief propagation and loop series on planar graphs
- Loop calculus in statistical physics and information science
- New graph polynomials from the Bethe approximation of the Ising partition function
- Partition function loop series for a general graphical model: free-energy corrections and message-passing equations
- Loop corrections for approximate inference on factor graphs
- Truncating the loop series expansion for belief propagation
- Approximate inverse Ising models close to a Bethe reference point
- Random field Ising model in two dimensions: Bethe approximation, cluster variational method and message passing algorithms
- A spin glass approach to the directed feedback vertex set problem
- On one-step replica symmetry breaking in the Edwards-Anderson spin glass model
- Loop expansion around the Bethe approximation through the \(M\)-layer construction
- Spectral bounds for the Ising ferromagnet on an arbitrary given graph
- Cycle-based cluster variational method for direct and inverse inference
- Loop series expansion with propagation diagrams
- Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results
- Convergence analysis of distributed inference with vector-valued Gaussian belief propagation
- Ising spin glass models versus Ising models: an effective mapping at high temperature. III: Rigorous formulation and detailed proof for general graphs
- 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
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
- Gauging variational inference
- Gauges, loops, and polynomials for partition functions of graphical models
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Message-passing algorithms for inference and optimization
- Mixing artificial and natural intelligence: from statistical mechanics to AI and back to turbulence
- Counting degree-constrained orientations
This page was built for publication: Loop series for discrete statistical models on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904241)
