92 citations · 395 across the 40 of their papers we have counts for
5 papers · 1 filter
Efficient sampling and counting algorithms for the Potts model on at all temperatures
Christian Borgs, Jennifer Chayes, Tyler Helmuth +2
For and all we give an efficient algorithm to approximately sample from the -state ferromagnetic Potts and random cluster models on finite tori $(\mat…
Independent sets in the hypercube revisited
Matthew Jenssen, Will Perkins
We revisit Sapozhenko's classic proof on the asymptotics of the number of independent sets in the discrete hypercube and Galvin's follow-up work on weighted independent…
Counting independent sets in unbalanced bipartite graphs
Sarah Cannon, Will Perkins
We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the si…
Fast algorithms at low temperatures via Markov chains
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +3
We define a discrete-time Markov chain for abstract polymer models and show that under sufficient decay of the polymer weights, this chain mixes rapidly. We apply this Markov chain…
Storage capacity in symmetric binary perceptrons
Benjamin Aubin, Will Perkins, Lenka Zdeborová
We study the problem of determining the capacity of the binary perceptron for two variants of the problem where the corresponding constraint is symmetric. We call these variants th…