Loop series for discrete statistical models on graphs
From MaRDI portal
Publication:2904241
DOI10.1088/1742-5468/2006/06/P06009zbMath1244.82059arXivcond-mat/0603189MaRDI QIDQ2904241
Michael Chertkov, Vladimir Y. Chernyak
Publication date: 12 August 2012
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0603189
Planar graphs; geometric and topological aspects of graph theory (05C10) Exactly solvable models; Bethe ansatz (82B23) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Belief propagation and loop series on planar graphs, Cycle-based cluster variational method for direct and inverse inference, Evaluations of Tutte polynomials of regular graphs, Counting degree-constrained subgraphs and orientations, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, Random cluster model on regular graphs, Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results, Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs, Message-passing algorithms for inference and optimization, 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 theM-layer construction, Spectral bounds for the Ising ferromagnet on an arbitrary given graph, Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation, New Graph Polynomials from the Bethe Approximation of the Ising Partition Function, 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, Gauging variational inference, Gauges, loops, and polynomials for partition functions of graphical models, On forest expansions for two-body partition functions on tree-like interaction graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Loop calculus in statistical physics and information science
- Survey propagation as local equilibrium equations
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Factor graphs and the sum-product algorithm
- Codes on graphs: normal realizations
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Good error-correcting codes based on very sparse matrices
- Statistical theory of superlattices
- On Ising's model of ferromagnetism
- A Theory of Cooperative Phenomena