124 citations · 239 across the 28 of their papers we have counts for
5 papers · 1 filter
Fast sampling via spectral independence beyond bounded-degree graphs
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg +1
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal…
Inapproximability of counting hypergraph colourings
Andreas Galanis, Heng Guo, Jiaheng Wang
Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction…
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
Zongchen Chen, Andreas Galanis, Daniel Štefankovič +1
For spin systems, such as the -colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-r…
Fast mixing via polymers for random graphs with unbounded degree
Andreas Galanis, Leslie Ann Goldberg, James Stewart
The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-deg…
The complexity of approximating the complex-valued Ising model on bounded degree graphs
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
We study the complexity of approximating the partition function of the Ising model in terms of the relation between the edge interaction and a parame…