7 papers
Fast Mixing for Low-Temperature Potts Models via Poisson Trees
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +3
The -state ferromagnetic Potts model on a graph is a probability distribution on all -colourings of that favours many monochromatic edges. Approximate sampling from t…
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
Andreas Galanis, Leslie Ann Goldberg, Xandru Mifsud
We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recen…
Critical window for approximate counting in dense Ising models
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
We study the complexity of approximating the partition function of dense Ising models in the critical regime. Recent work of Chen, Chen, Yin, and Zhang (FOCS 2025) established fast…
Planting and MCMC Sampling from the Potts model
Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
We consider the problem of sampling from the ferromagnetic -state Potts model on the random -regular graph with parameter . A key difficulty that arises in sampling fro…
Inapproximability of the independent set polynomial in the complex plane
Ivona Bezakova, Andreas Galanis, Leslie Ann Goldberg +1
We study the complexity of approximating the independent set polynomial of a graph with maximum degree when the activity is a complex number. This problem i…
One-Shot Learning for k-SAT
Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang
Consider a -SAT formula where every variable appears at most times. Let be a satisfying assignment, sampled proportionally to where is the nu…