Factor models on locally tree-like graphs
type: Item
instance of: scholarly article
title: Factor models on locally tree-like graphs
zbMATH Open document ID: 1280.05119
DOI: 10.1214/12-AOP828
author: Amir Dembo
author: Nike Sun
author: Andrea Montanari
published in: The Annals of Probability
publication date: 2014-01-31T00:00:00Z
full work available at URL: https://arxiv.org/abs/1110.4821
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 82B20
Mathematics Subject Classification ID: 82B23
zbMATH DE Number: 6253406
zbMATH Keywords: factor models
zbMATH Keywords: random graphs
zbMATH Keywords: belief propagation
zbMATH Keywords: Bethe measures
zbMATH Keywords: Potts model
zbMATH Keywords: independent set
zbMATH Keywords: Gibbs measures
zbMATH Keywords: free energy density
zbMATH Keywords: local weak convergence
MaRDI profile type: Publication
arXiv ID: 1110.4821
cites work: Processes on unimodular random networks
cites work: Q4450065
cites work: Counting without sampling
cites work: Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
cites work: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
cites work: Recurrence of distributional limits of finite planar graphs
cites work: Gibbs states of graphical representations of the Potts model with external fields
cites work: The complexity of theorem-proving procedures
cites work: Gibbs measures and phase transitions on sparse random graphs
cites work: Ising models on locally tree-like graphs
cites work: The replica symmetric solution for Potts models on \(d\)-regular graphs
cites work: Q4391441
cites work: Ising models on power-law random graphs
cites work: Existence of a phase-transition in a one-dimensional Ising ferromagnet
cites work: Broadcasting on trees and the Ising model.
cites work: Replica bounds for optimization problems and diluted spin systems
cites work: Replica bounds for diluted non-Poissonian spin systems
cites work: Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
cites work: Improved inapproximability results for counting independent sets in the hard-core model
cites work: Gibbs measures and phase transitions
cites work: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
cites work: The Random-Cluster Model
cites work: The thermodynamic limit in mean field spin glass models
cites work: Q5732774
cites work: Remarks on the limiting Gibbs states on a (d+1)-tree
cites work: Q4142699
cites work: Q3721805
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Interacting particle systems. With a new postface.
cites work: Random walks and percolation on trees
cites work: Information, Physics, and Computation
cites work: The weak limit of Ising models on locally tree-like graphs
cites work: On the hardness of sampling independent sets beyond the tree threshold
cites work: Bounds for diluted mean-fields spin glass models
cites work: Q5564295
cites work: A remark on Dobrushin's uniqueness theorem
cites work: Q3416249
cites work: Markov random fields on an infinite tree
cites work: Counting independent sets up to the tree threshold
cites work: Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
cites work: Countable state space Markov random fields and Markov chains on trees
cites work: Q4853606
cites work: Linear degree extractors and the inapproximability of max clique and chromatic number
OpenAlex ID: W3105177482
description: scientific article