Factor models on locally tree-like graphs

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree T, and study the existence of the free energy density ϕ, the limit of the log-partition function divided by the number of vertices n as n tends to infinity. We provide a new interpolation scheme and use it to prove existence of, and to explicitly compute, the quantity ϕ subject to uniqueness of a relevant Gibbs measure for the factor model on T. By way of example we compute ϕ for the independent set (or hard-core) model at low fugacity, for the ferromagnetic Ising model at all parameter values, and for the ferromagnetic Potts model with both weak enough and strong enough interactions. Even beyond uniqueness regimes our interpolation provides useful explicit bounds on ϕ. In the regimes in which we establish existence of the limit, we show that it coincides with the Bethe free energy functional evaluated at a suitable fixed point of the belief propagation (Bethe) recursions on T. In the special case that T has a Galton–Watson law, this formula coincides with the nonrigorous “Bethe prediction” obtained by statistical physicists using the “replica” or “cavity” methods. Thus our work is a rigorous generalization of these heuristic calculations to the broader class of sparse graph sequences converging locally to trees. We also provide a variational characterization for the Bethe prediction in this general setting, which is of independent interest.

[1]  Y. Higuchi Remarks on the Limiting GIbbs States on a (d+1)-Tree , 1977 .

[2]  R. Lyons Random Walks and Percolation on Trees , 1990 .

[3]  David Gamarnik,et al.  Counting without sampling: new algorithms for enumeration problems using statistical physics , 2006, SODA '06.

[4]  David Gamarnik,et al.  Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models , 2008, Random Struct. Algorithms.

[5]  David Gamarnik,et al.  Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , 2010, STOC '10.

[6]  Allan Sly,et al.  Communications in Mathematical Physics The Replica Symmetric Solution for Potts Models on d-Regular Graphs , 2022 .

[7]  D. Aldous,et al.  Processes on Unimodular Random Networks , 2006, math/0603062.

[8]  I. Benjamini,et al.  Recurrence of Distributional Limits of Finite Planar Graphs , 2000, math/0011019.

[9]  Eric Vigoda,et al.  Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model , 2011, APPROX-RANDOM.

[10]  Alan D. Sokal The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[11]  M. Talagrand,et al.  Bounds for diluted mean-fields spin glass models , 2004, math/0405357.

[12]  Allan Sly,et al.  The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[13]  Freeman J. Dyson,et al.  Existence of a phase-transition in a one-dimensional Ising ferromagnet , 1969 .

[14]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[15]  F. Guerra,et al.  The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.

[16]  Geoffrey Grimmett The Random-Cluster Model , 2002, math/0205237.

[17]  F. Y. Wu The Potts model , 1982 .

[18]  Catherine S. Greenhill The complexity of counting colourings and independent sets in sparse graphs and hypergraphs , 2000, computational complexity.

[19]  A. Dembo,et al.  Gibbs Measures and Phase Transitions on Sparse Random Graphs , 2009, 0910.5460.

[20]  Y. Peres,et al.  Broadcasting on trees and the Ising model , 2000 .

[21]  Stefan Grosskinsky Warwick,et al.  Interacting Particle Systems , 2016 .

[22]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[23]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[24]  F. Papangelou GIBBS MEASURES AND PHASE TRANSITIONS (de Gruyter Studies in Mathematics 9) , 1990 .

[25]  Andrea Montanari,et al.  The weak limit of Ising models on locally tree-like graphs , 2009, 0912.0719.

[26]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[27]  Federico Ricci-Tersenghi,et al.  Statistical Physics of Disordered Systems: from real materials to optimization and codes , 2003 .

[28]  Stan Zachary,et al.  Markov random fields and Markov chains on trees , 1983 .

[29]  David Gamarnik,et al.  Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , 2009, STOC '10.

[30]  S. Kak Information, physics, and computation , 1996 .

[31]  M. Biskup,et al.  Gibbs states of graphical representations of the Potts model with external fields , 2000 .

[32]  B. Simon A remark on Dobrushin's uniqueness theorem , 1979 .

[33]  R. Hofstad,et al.  Ising Models on Power-Law Random Graphs , 2010, 1005.4556.

[34]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[35]  F. Spitzer Markov Random Fields on an Infinite Tree , 1975 .

[36]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[37]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[38]  J. Cardy,et al.  Holomorphic parafermions in the Potts model and stochastic Loewner evolution , 2006 .

[39]  S. Franz,et al.  Replica bounds for diluted non-Poissonian spin systems , 2003, cond-mat/0307367.

[40]  Allan Sly,et al.  Computational Transition at the Uniqueness Threshold , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[41]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[42]  Elchanan Mossel,et al.  On the hardness of sampling independent sets beyond the tree threshold , 2007, math/0701471.

[43]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[44]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[45]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[46]  Michele Leone,et al.  Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .

[47]  A. Dembo,et al.  Ising models on locally tree-like graphs , 2008, 0804.4726.

[48]  J. Michael Steele,et al.  The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence , 2004 .

[49]  J. M. Hammersley,et al.  Generalization of the Fundamental Theorem on Subadditive Functions , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.