1 citations · 3 across the 13 of their papers we have counts for
4 papers · 1 filter
Sampling and counting triangle-free graphs near the critical density
Matthew Jenssen, Will Perkins, Aditya Potukuchi +1
We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erdős-Rényi random graph conditioned on triangle-freeness? Can we e…
Quasipolynomial-time algorithms for Gibbs point processes
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. Thi…
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…
Algorithms for #BIS-hard problems on expander graphs
Matthew Jenssen, Peter Keevash, Will Perkins
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts m…