1

Towards derandomising Markov Chain Monte Carlo
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting …
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
PDF Cite Slides
Deterministic counting Lovász local lemma beyond linear programming
Kun He, Chunyang Wang, Yitong Yin
PDF Cite Slides DOI
Sampling Lovász Local Lemma for General Constraint Satisfaction Solutions in Near-Linear Time
We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. The …
Kun He, Chunyang Wang, Yitong Yin
PDF Cite Slides DOI