1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
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…
cs.DS2018
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…