research
∙
05/22/2023
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
We consider the performance of Glauber dynamics for the random cluster m...
share
research
∙
06/30/2022
Fast sampling of satisfying assignments from random k-SAT
We give the first nearly linear time algorithm to approximately sample s...
research
∙
06/23/2022
Approximating observables is as hard as counting
We study the computational complexity of estimating local observables fo...
research
∙
02/11/2022
Metastability of the Potts ferromagnet on random regular graphs
We study the performance of Markov chains for the q-state ferromagnetic ...
research
∙
11/07/2021
Fast sampling via spectral independence beyond bounded-degree graphs
Spectral independence is a recently-developed framework for obtaining sh...
research
∙
07/12/2021
Inapproximability of counting hypergraph colourings
Recent developments in approximate counting have made startling progress...
research
∙
05/04/2021
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
For spin systems, such as the q-colorings and independent-set models, ap...
research
∙
05/02/2021
Fast mixing via polymers for random graphs with unbounded degree
The polymer model framework is a classical tool from statistical mechani...
research
∙
05/01/2021
The complexity of approximating the complex-valued Ising model on bounded degree graphs
We study the complexity of approximating the partition function Z_Ising(...
research
∙
07/16/2020
Rapid Mixing for Colorings via Spectral Independence
The spectral independence approach of Anari et al. (2020) utilized recen...
research
∙
06/26/2020
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
We study the computational complexity of approximating the partition fun...
research
∙
05/03/2020
The complexity of approximating the complex-valued Potts model
We study the complexity of approximating the partition function of the q...
research
∙
04/28/2020
Fast algorithms for general spin systems on bipartite expanders
A spin system is a framework in which the vertices of a graph are assign...
research
∙
04/20/2020
The complexity of approximating averages on bounded-degree graphs
We prove that, unless P=NP, there is no polynomial-time algorithm to app...
research
∙
11/16/2019
Counting solutions to random CNF formulas
We give the first efficient algorithm to approximately count the number ...
research
∙
09/16/2019
Improved Strong Spatial Mixing for Colorings on Trees
Strong spatial mixing (SSM) is a form of correlation decay that has play...
research
∙
01/20/2019
Markov chains for the hard-core model via polymer models
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling alg...
research
∙
01/20/2019
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling alg...
research
∙
07/13/2018
The complexity of approximating the matching polynomial in the complex plane
We study the problem of approximating the value of the matching polynomi...
research
∙
04/22/2018
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
We consider the problem of sampling from the Potts model on random regul...
research
∙
04/10/2018
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree
The antiferromagnetic q-state Potts model is perhaps the most canonical ...
research
∙
11/01/2017
Inapproximability of the independent set polynomial in the complex plane
We study the complexity of approximating the independent set polynomial ...
research
∙
04/06/2017
