5 papers · 1 filter
Local large deviations for triangles in sparse random graphs
Jade Lintott, Will Perkins, Corrine Yap
We revisit a classic topic in probabilistic combinatorics, the lower-tail large-deviation problem for triangles in the random graph . Here we aim for first-order asymptotic…
Structural Corrections to the Bethe Approximation of the Permanent
Ijay Narang, Will Perkins
We study deterministic approximation algorithms for the permanent of a nonnegative matrix through the Bethe permanent, an approximation computable in polynomial time. The tight ana…
The Hard-Core Model on Bipartite Spectral Expanders: Counting and Sampling at All Fugacities
Ijay Narang, Will Perkins
We study approximate counting and sampling algorithms for the hard-core model on -regular bipartite graphs under a spectral expansion condition. Let be the biadjacency mat…
Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs
Ijay Narang, Will Perkins, Yuzhou Wang +1
Motivated by recent work of Kocurek, Oveis Gharan, and Tjowasi, which gives an efficient sampling algorithm for the hard-core model on random regular bipartite graphs by decomposin…
Sampling Colorings with Fixed Color Class Sizes
Aiya Kuchukova, Will Perkins, Xavier Povill
In 1970 Hajnal and Szemerédi proved a conjecture of Erdös that for a graph with maximum degree , there exists an equitable coloring; that is a coloring where color class s…