Fetching the paper…
Reading the bibliography…
We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n \mathbb Z)^d$.
Annals of Mathematics pp. 583–599 (1948)
Otter, R.: The number of trees · 1948
Earlier work this paper cites.
Physical Review 87
Lee, T.D., Yang, C.N.: Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model · 1952
Earlier work this paper cites.
Theoretical and Mathematical Physics 25
Pirogov, S.A., Sinai, Y.G.: Phase diagrams of classical lattice systems · 1975
Earlier work this paper cites.
Theoretical and Mathematical Physics 26
Pirogov, S.A., Sinai, Y.G.: Phase diagrams of classical lattice systems continuation · 1976
Earlier work this paper cites.
Journal of Physics A: Mathematical and General 13
Baxter, R.J.: Hard hexagons: exact solution · 1980
Earlier work this paper cites.
SIAM Journal on Computing 9
Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees · 1980
Earlier work this paper cites.
Communications in Mathematical Physics 93
Zahradník, M.: An alternate version of Pirogov-Sinai theory · 1984
Earlier work this paper cites.
Combinatorica 5
Shearer, J.B.: On a problem of Spencer · 1985
Earlier work this paper cites.
Theoretical Computer Science 43
Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution · 1986
Earlier work this paper cites.
Communications in Mathematical Physics 103
Kotecký, R., Preiss, D.: Cluster expansion for abstract polymer models · 1986
Earlier work this paper cites.
Journal of Statistical Physics 48
Tracy, C.A., Grove, L., Newman, M.: Modular properties of the hard hexagon model · 1987
Earlier work this paper cites.
Phil. Trans. R. Soc. Lond. A 325
Joyce, G.: On the hard-hexagon model and the theory of modular functions · 1988
Earlier work this paper cites.
Communications in mathematical physics 123
Borgs, C., Imbrie, J.Z.: A unified approach to phase diagrams in field theory and statistical mechanics · 1989
Earlier work this paper cites.
Information and Computation 82
Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains · 1989
Earlier work this paper cites.
Journal of Statistical Physics 62
Borgs, C., Kotecký, R., Miracle-Solé, S.: Finite-size scaling for Potts models · 1991
Earlier work this paper cites.
Communications in Mathematical Physics 140
Laanait, L., Messager, A., Miracle-Solé, S., Ruiz, J., Shlosman, S.: Interfaces in the Potts model I: Pirogov-Sinai theory of the Fortuin-Kasteleyn representation · 1991
Earlier work this paper cites.
SIAM Journal on computing 22
Jerrum, M., Sinclair, A.: Polynomial-time approximation algorithms for the Ising model · 1993
Earlier work this paper cites.
Translations of the American Mathematical Society-Series 2 177
Dobrushin, R.: Estimates of semi-invariants for the Ising model at low temperatures · 1996
Earlier work this paper cites.
In: Proceedings of the Fourtieth Annual Symposium on Foundations of Computer Science, FOCS 1999, pp. 218–229. IEEE (1999)
Borgs, C., Chayes, J.T., Frieze, A., Kim, J.H., Tetali, P., Vigoda, E., Vu, V.H.: Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics · 1999
Earlier work this paper cites.
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 959–960. Society for Industrial and Applied Mathematics (1999)
Randall, D., Wilson, D.: Sampling spin configurations of an ising system · 1999
Earlier work this paper cites.
In: Graphs, Morphisms, and Statistical Physics: DIMACS Workshop Graphs, Morphisms and Statistical Physics, March 19-21, 2001, DIMACS Center, vol. 63, p. 13. American Mathematical Soc. (2004)
Borgs, C., Chayes, J.T., Dyer, M., Tetali, P.: On the sampling problem for H-colorings on the hypercubic lattice · 2004
Earlier work this paper cites.
Algorithmica 38
Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: The relative complexity of approximate counting problems · 2004
Cited alongside, same era.
Combinatorics, Probability and Computing 13
Galvin, D., Kahn, J.: On phase transition in the hard-core model on ℤ d \mathbb{Z}^{d} · 2004
Cited alongside, same era.
Journal of Statistical Physics 118
Scott, A.D., Sokal, A.D.: The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma · 2005
Cited alongside, same era.
Springer-Verlag (2006)
Grimmett, G.R.: The random-cluster model, second edn · 2006
Cited alongside, same era.
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 870–879. Society for Industrial and Applied Mathematics (2006)
Randall, D.: Slow mixing of Glauber dynamics via topological obstructions · 2006
Cited alongside, same era.
In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 140–149. ACM (2006)
Journal of Statistical Physics 162
Adams, S., Briceño, R., Marcus, B., Pavlov, R.: Representation and poly-time approximation for pressure of ℤ 2 \mathbb{Z}^{2} lattice models in the non-uniqueness region · 2016
Later among the works it cites.
Foundations of Computational Mathematics 16
Barvinok, A.: Computing the permanent of (some) complex matrices · 2016
Later among the works it cites.
Journal of Combinatorial Theory, Series A 137
Barvinok, A., Soberón, P.: Computing the partition function for graph homomorphisms with multiplicities · 2016
Later among the works it cites.
Journal of Computer and System Sciences 82
Cai, J.Y., Galanis, A., Goldberg, L.A., Guo, H., Jerrum, M., Štefankovič, D., Vigoda, E.: # BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region · 2016
Later among the works it cites.
Combinatorics, Probability and Computing 25
Galanis, A., Štefankovič, D., Vigoda, E.: Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models · 2016
Later among the works it cites.
SIAM Journal on Computing 45
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Weitz, D.: Counting independent sets up to the tree threshold · 2006
Cited alongside, same era.
Communications in Mathematical Physics 274
Fernández, R., Procacci, A.: Cluster expansion for abstract polymer models. new bounds from an old approach · 2007
Cited alongside, same era.
In: Proceedings of the Forty-ninth Annual Symposium on Foundations of Computer Science, FOCS 2008, pp. 677–686. IEEE (2008)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time · 2008
Cited alongside, same era.
Journal of Statistical Physics 137
Gamarnik, D., Katz, D.: Sequential cavity method for computing free energy and surface pressure · 2009
Cited alongside, same era.
In: Proceedings of the Fifty-first Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, pp. 287–296. IEEE (2010)
Sly, A.: Computational transition at the uniqueness threshold · 2010
Cited alongside, same era.
Probability Theory and Related Fields 152
Borgs, C., Chayes, J.T., Tetali, P.: Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point · 2012
Cited alongside, same era.
Journal of the ACM 59
Goldberg, L.A., Jerrum, M.: Approximating the partition function of the ferromagnetic Potts model · 2012
Cited alongside, same era.
Galanis, A., Stefankovic, D., Vigoda, E., Yang, L.: Ferromagnetic Potts model: Refined #-BIS-hardness and related results · 2016
Later among the works it cites.
Algorithms and Combinatorics 30
Barvinok, A.: Combinatorics and complexity of partition functions · 2017
Later among the works it cites.
Probability Theory and Related Fields 168
Blanca, A., Sinclair, A.: Random-cluster dynamics in ℤ 2 \mathbb{Z}^{2} · 2017
Later among the works it cites.
Cambridge University Press (2017)
Friedli, S., Velenik, Y.: Statistical mechanics of lattice systems: a concrete mathematical introduction · 2017
Later among the works it cites.
arXiv preprint arXiv:1708.01912 (2017)
Jauslin, I., Lebowitz, J.L.: High-fugacity expansion and crystalline ordering for non-sliding hard-core lattice particle systems · 2017
Later among the works it cites.
SIAM Journal on Computing 46
Patel, V., Regts, G.: Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials · 2017
Later among the works it cites.
In: Proceedings of the Fiftieth Annual ACM Symposium on Theory of Computing, STOC 2018, pp. 1234–1240. ACM (2018)
Bezáková, I., Galanis, A., Goldberg, L.A., Štefankovič, D.: Inapproximability of the independent set polynomial in the complex plane · 2018
Closest in time.
Communications on Pure and Applied Mathematics 71
Gheissari, R., Lubetzky, E.: Mixing times of critical two-dimensional Potts models · 2018
Closest in time.
Ann. Appl. Probab. 28
Guo, H., Jerrum, M.: Random cluster dynamics for the Ising model is rapidly mixing · 2018
Closest in time.
In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1557–1576. SIAM (2018)
Harvey, N.J., Srivastava, P., Vondrák, J.: Computing the independence polynomial: from the tree threshold down to the roots · 2018
Closest in time.
Combinatorics, Probability and Computing 28
Blanca, A., Chen, Y., Galvin, D., Randall, D., Tetali, P.: Phase coexistence for the hard-core model on ℤ 2 \mathbb{Z}^{2} · 2019
Closest in time.
Jenssen, M., Keevash, P., Perkins, W.: Algorithms for #BIS-hard problems on expander graphs · 2019
Closest in time.
Journal of Statistical Physics 174
Liu, J., Sinclair, A., Srivastava, P.: The Ising partition function: Zeros and deterministic approximation · 2019
Closest in time.
Algorithmica, 81
Patel, V., Regts, G.: Computing the number of induced copies of a fixed graph in a bounded degree graph · 2019
Closest in time.
Michigan Math. J. 68
Peters, H., Regts, G.: On a conjecture of Sokal concerning roots of the independence polynomial · 2019
Closest in time.