Partition function loop series for a general graphical model: free energy corrections and message-passing equations
arXiv:1104.3631 · doi:10.1088/1751-8113/44/42/425001
Abstract
A loop series expansion for the partition function of a general statistical model on a graph is carried out. If the auxiliary probability distributions of the expansion are chosen to be a fixed point of the belief-propagation equation, the first term of the loop series gives the Bethe-Peierls free energy functional at the replica-symmetric level of the mean-field spin glass theory, and corrections are contributed only by subgraphs that are free of dangling edges. This result generalize the early work of Chertkov and Chernyak on binary statistical models. If the belief-propagation equation has multiple fixed points, a loop series expansion is performed for the grand partition function. The first term of this series gives the Bethe-Peierls free energy functional at the first-step replica-symmetry-breaking (RSB) level of the mean-field spin-glass theory, and corrections again come only from subgraphs that are free of dangling edges, provided that the auxiliary probability distributions of the expansion are chosen to be a fixed point of the survey-propagation equation. The same loop series expansion can be performed for higher-level partition functions, obtaining the higher-level RSB Bethe-Peierls free energy functionals (and the correction terms) and message-passing equations without using the Bethe-Peierls approximation.
12 pages with 1 figure included. Extensive revision on structure of the paper (no change in results). Accepted by Journal of Physica A
References in corpus (5)
Cited by in corpus (27)
- Spin glass approach to the feedback vertex set problem
- Networking - A Statistical Physics Perspective
- Statistical Mechanics of the Minimum Dominating Set Problem
- Region graph partition function expansion and approximate free energy landscapes: Theory and some numerical results
- A Cavity Master Equation for the continuous time dynamics of discrete spins models
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
- Statistical physics of hard combinatorial optimization: The vertex cover problem
- Message passing and Monte Carlo algorithms: connecting fixed points with metastable states
- Partition Function Expansion on Region-Graphs and Message-Passing Equations
- Minimal Dominating Set problem studied by simulated annealing and cavity method: Analytics and population dynamics
- Replica Symmetry Breaking without Replicas
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Message-passing algorithm of quantum annealing with nonstoquastic Hamiltonian
- New Understanding of the Bethe Approximation and the Replica Method
- Kinked Entropy and Discontinuous Microcanonical Spontaneous Symmetry Breaking
- Perturbative large deviation analysis of non-equilibrium dynamics
- Quantum Cluster Variational Method and Message Passing Algorithms Revisited
- Cycle-based Cluster Variational Method for Direct and Inverse Inference
- Loop-corrected belief propagation for lattice spin models
- Gauge-free cluster variational method by maximal messages and moment matching
- Two-distance minimal dominating set problem studied by statistical mechanics and simulated annealing
- The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances. A Proof from the Polymer Expansion
- Witness of unsatisfiability for a random 3-satisfiability formula
- CCCP Algorithms to Minimize the Bethe free energy of 3-SAT Problem
- Statistical Mechanics of the L-Distance Minimal Dominating Set problem
- The Directed Dominating Set problem studied by cavity method: Warning propagation and population dynamics
- Fast convergence to an approximate solution by message-passing for complex optimizations