Fetching the paper…
Reading the bibliography…
We explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems.
On colouring the nodes of a network
R. L. Brooks · 1941
Earlier work this paper cites.
Statistical theory of equations of state and phase transitions. I. Theory of condensation
C. N. Yang and T. D. Lee · 1952
Earlier work this paper cites.
Matchings and walks in graphs
C. D. Godsil · 1981
Earlier work this paper cites.
Completely analytical Gibbs fields
R. L. Dobrushin and S. B. Shlosman · 1985
Earlier work this paper cites.
Completely analytical interactions: Constructive description
R. L. Dobrushin and S. B. Shlosman · 1987
Earlier work this paper cites.
The Ising model and percolation on trees and tree-like graphs
R. Lyons · 1989
Earlier work this paper cites.
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
M. Jerrum · 1995
Earlier work this paper cites.
Path coupling: A technique for proving rapid mixing in Markov chains
R. Bubley and M. Dyer · 1997
Earlier work this paper cites.
Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
J. Salas and A. D. Sokal · 1997
Earlier work this paper cites.
Improved bounds for sampling colorings
E. Vigoda · 2000
Earlier work this paper cites.
Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
A. D. Sokal · 2001
Earlier work this paper cites.
A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models
A. D. Sokal · 2001
Earlier work this paper cites.
Uniqueness of uniform random colorings of regular trees
J. Jonasson · 2002
Earlier work this paper cites.
Randomly coloring graphs with lower bounds on girth and maximum degree
M. Dyer and A. Frieze · 2003
Earlier work this paper cites.
Randomly coloring graphs of girth at least five
T. P. Hayes · 2003
Earlier work this paper cites.
A non-Markovian coupling for randomly sampling colorings
T. P. Hayes and E. Vigoda · 2003
Earlier work this paper cites.
The Glauber dynamics on colorings of a graph with high girth and maximum degree
M. Molloy · 2004
Earlier work this paper cites.
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
A. Scott and A. Sokal · 2004
Earlier work this paper cites.
Strong spatial mixing for lattice graphs with fewer colours
L. A. Goldberg, R. Martin, and M. Paterson · 2005
Earlier work this paper cites.
The multivariate Tutte polynomial (alias Potts model)
A. D. Sokal · 2005
Earlier work this paper cites.
Combinatorial criteria for uniqueness of Gibbs measures
D. Weitz · 2005
Earlier work this paper cites.
On randomly colouring locally sparse graphs
A. Frieze and J. Vera · 2006
Cited alongside, same era.
Coupling with the stationary distribution and improved sampling for colorings and independent sets
T. P. Hayes and E. Vigoda · 2006
Cited alongside, same era.
Counting independent sets up to the tree threshold
D. Weitz · 2006
Cited alongside, same era.
Simple deterministic approximation algorithms for counting matchings
M. Bayati, D. Gamarnik, D. Katz, C. Nair, and P. Tetali · 2007
Cited alongside, same era.
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
A. Bandyopadhyay and D. Gamarnik · 2008
Cited alongside, same era.
Regions without complex zeros for chromatic polynomials on graphs with bounded degree
R. Fernández and A. Procacci · 2008
Strong spatial mixing of list coloring of graphs
D. Gamarnik, D. Katz, and S. Misra · 2015
Later among the works it cites.
Benjamini–Schramm continuity of root moments of graph polynomials
P. Csikvári and P. E. Frenkel · 2016
Later among the works it cites.
Spatial mixing and the connective constant: Optimal bounds
A. Sinclair, P. Srivastava, D. Štefankovič, and Y. Yin · 2016
Later among the works it cites.
Combinatorics and Complexity of Partition Functions
A. Barvinok · 2017
Later among the works it cites.
Computing the partition function for graph homomorphisms
A. Barvinok and P. Soberón · 2017
Later among the works it cites.
An FPTAS for counting proper four-colorings on cubic graphs
P. Lu, K. Yang, C. Zhang, and M. Zhu · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A survey on the use of Markov chains to randomly sample colourings
A. Frieze and E. Vigoda · 2008
Cited alongside, same era.
Computational transition at the uniqueness threshold
A. Sly · 2010
Cited alongside, same era.
Strong spatial mixing of q q -colorings on Bethe lattices
Q. Ge and D. Štefankovič · 2011
Cited alongside, same era.
Gibbs Measures and Phase Transitions
Georgii Hans-Otto · 2011
Cited alongside, same era.
Approximating partition functions of the two-state spin system
J. Zhang, H. Liang, and F. Bai · 2011
Cited alongside, same era.
Correlation decay and deterministic fptas for counting colorings of a graph
D. Gamarnik and D. Katz · 2012
Cited alongside, same era.
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
V. Patel and G. Regts · 2017
Later among the works it cites.
Approximating the permanent of a random matrix with vanishing mean
L. Eldar and S. Mehraban · 2018
Later among the works it cites.
Weighted counting of integer points in a subspace
A. Barvinok and G. Regts · 2019
Closest in time.
Improved bounds for randomly sampling colorings via linear programming
S. Chen, M. Delcourt, A. Moitra, G. Perarnau, and L. Postle · 2019
Closest in time.
Algorithms for #BIS-hard problems on expander graphs
M. Jenssen, P. Keevash, and W. Perkins · 2019
Closest in time.
Approximate Counting, Phase Transitions and Geometry of Polynomials
J. Liu · 2019
Closest in time.
A deterministic algorithm for counting colorings with 2 Δ 2\Delta colors
J. Liu, A. Sinclair, and P. Srivastava · 2019
Closest in time.
Fisher zeros and correlation decay in the Ising model
J. Liu, A. Sinclair, and P. Srivastava · 2019
Closest in time.
The Ising partition function: Zeros and deterministic approximation
J. Liu, A. Sinclair, and P. Srivastava · 2019
Closest in time.
On a conjecture of Sokal concerning roots of the independence polynomial
H. Peters and G. Regts · 2019
Closest in time.
Zeros of Holant problems: Locations and algorithms
H. Guo, C. Liao, P. Lu, and C. Zhang · 2020
Closest in time.
Algorithmic Pirogov-Sinai theory
T. Helmuth, W. Perkins, and G. Regts · 2020
Closest in time.
Location of zeros for the partition function of the Ising model on bounded degree graphs
H. Peters and G. Regts · 2020
Closest in time.
Contraction: A unified perspective of correlation decay and zero-freeness of 2-spin systems
S. Shao and Y. Sun · 2020
Closest in time.
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
F. Bencs, E. Davies, V. Patel, and G. Regts · 2021
Closest in time.