1 citations · 3 across the 12 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
On the hardness of finding balanced independent sets in random bipartite graphs
Will Perkins, Yuzhou Wang
We consider the algorithmic problem of finding large \textit{balanced} independent sets in sparse random bipartite graphs, and more generally the problem of finding independent set…
math.PR2023
Percolation on hypergraphs and the hard-core model
Tyler Helmuth, Will Perkins, Michail Sarantis
We prove tight bounds on the site percolation threshold for -uniform hypergraphs of maximum degree and for -uniform hypergraphs of maximum degree in which any pair of…
cs.DS2023
Perfect Sampling for Hard Spheres from Strong Spatial Mixing
Konrad Anand, Andreas Göbel, Marcus Pappik +1
We provide a perfect sampling algorithm for the hard-sphere model on subsets of with expected running time linear in the volume under the assumption of strong spatia…