We consider the algorithmic problem of finding large balanced
independen...
We prove tight bounds on the site percolation threshold for k-uniform
hy...
We provide a perfect sampling algorithm for the hard-sphere model on sub...
For many computational problems involving randomness, intricate geometri...
We study the locations of complex zeroes of independence polynomials of
...
The symmetric binary perceptron () exhibits a dramatic
statistical-to-co...
We prove that a Gibbs point process interacting via a finite-range, repu...
We give an efficient perfect sampling algorithm for weighted, connected
...
The ferromagnetic Ising model is a model of a magnetic material and a ce...
By implementing algorithmic versions of Sapozhenko's graph container met...
Approximating the partition function of the ferromagnetic Ising model wi...
We give an FPTAS for computing the number of matchings of size k in a gr...
We determine the computational complexity of approximately counting and
...
For Δ≥ 5 and q large as a function of Δ, we give a
detailed picture of t...
We improve upon all known lower bounds on the critical fugacity and crit...
For d > 2 and all q≥ q_0(d) we give an efficient algorithm to
approximat...
We give an FPTAS for approximating the partition function of the hard-co...
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling
alg...
We give an FPTAS and an efficient sampling algorithm for the high-fugaci...
We develop an efficient algorithmic approach for approximate counting an...