Sampling from the Hardcore Model on Random Regular Bipartite Graphs above the Uniqueness Threshold

Nicholas Kocurek, Shayan Oveis Gharan, Dante Tjowasi

We design an efficient sampling algorithm to generate samples from the hardcore model on random regular bipartite graphs as long as $\hat{I}»\lesssim \frac{1}{\sqrt{\hat{I}}”}$, where $\hat{I}”$ is th…