Factor models on locally tree-like graphs
DOI10.1214/12-AOP828zbMath1280.05119arXiv1110.4821OpenAlexW3105177482MaRDI QIDQ2434914
Nike Sun, Amir Dembo, Andrea Montanari
Publication date: 31 January 2014
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4821
random graphsindependent setPotts modelGibbs measuresfactor modelsfree energy densitylocal weak convergencebelief propagationBethe measures
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Exactly solvable models; Bethe ansatz (82B23) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Countable state space Markov random fields and Markov chains on trees
- Ising models on power-law random graphs
- The weak limit of Ising models on locally tree-like graphs
- Interacting particle systems. With a new postface.
- Random walks and percolation on trees
- Ising models on locally tree-like graphs
- Gibbs measures and phase transitions on sparse random graphs
- On the hardness of sampling independent sets beyond the tree threshold
- A remark on Dobrushin's uniqueness theorem
- Gibbs measures and phase transitions
- Markov random fields on an infinite tree
- Remarks on the limiting Gibbs states on a (d+1)-tree
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
- Bounds for diluted mean-fields spin glass models
- The thermodynamic limit in mean field spin glass models
- Recurrence of distributional limits of finite planar graphs
- Replica bounds for optimization problems and diluted spin systems
- Broadcasting on trees and the Ising model.
- Existence of a phase-transition in a one-dimensional Ising ferromagnet
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Processes on unimodular random networks
- Gibbs states of graphical representations of the Potts model with external fields
- Improved inapproximability results for counting independent sets in the hard-core model
- Counting independent sets up to the tree threshold
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Counting without sampling
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Information, Physics, and Computation
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- The Random-Cluster Model
- The complexity of theorem-proving procedures
- Replica bounds for diluted non-Poissonian spin systems
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs