1 citations · 3 across the 12 of their papers we have counts for
6 papers · 1 filter
Computational thresholds for the fixed-magnetization Ising model
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate co…
Approximately counting independent sets in bipartite graphs via graph containers
Matthew Jenssen, Will Perkins, Aditya Potukuchi
By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first…
Potential-weighted connective constants and uniqueness of Gibbs measures
Marcus Michelen, Will Perkins
We define a potential-weighted connective constant that measures the effective strength of a repulsive pair potential of a Gibbs point process modulated by the geometry of the unde…
Approximation algorithms for the random-field Ising model
Tyler Helmuth, Holden Lee, Will Perkins +2
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and i…
Approximate counting and sampling via local central limit theorems
Vishesh Jain, Will Perkins, Ashwin Sah +1
We give an FPTAS for computing the number of matchings of size in a graph of maximum degree on vertices, for all , where is fixed and $m^*(…
Frozen -RSB structure of the symmetric Ising perceptron
Will Perkins, Changji Xu
We prove, under an assumption on the critical points of a real-valued function, that the symmetric Ising perceptron exhibits the `frozen 1-RSB' structure conjectured by Krauth and…