We consider the performance of Glauber dynamics for the random cluster m...
We give the first nearly linear time algorithm to approximately sample
s...
We study the computational complexity of estimating local observables fo...
We study the performance of Markov chains for the q-state ferromagnetic
...
Spectral independence is a recently-developed framework for obtaining sh...
Recent developments in approximate counting have made startling progress...
For spin systems, such as the q-colorings and independent-set models,
ap...
The polymer model framework is a classical tool from statistical mechani...
We study the complexity of approximating the partition function
Z_Ising(...
The spectral independence approach of Anari et al. (2020) utilized recen...
We study the computational complexity of approximating the partition fun...
We study the complexity of approximating the partition function of the
q...
A spin system is a framework in which the vertices of a graph are assign...
We prove that, unless P=NP, there is no polynomial-time algorithm to
app...
We give the first efficient algorithm to approximately count the number ...
Strong spatial mixing (SSM) is a form of correlation decay that has play...
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling
alg...
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling
alg...
We study the problem of approximating the value of the matching polynomi...
We consider the problem of sampling from the Potts model on random regul...
The antiferromagnetic q-state Potts model is perhaps the most canonical
...
We study the complexity of approximating the independent set polynomial
...
The Gibbs sampler is a particularly popular Markov chain used for learni...