1

Local Gibbs sampling beyond local uniformity

Hongyang Liu, Chunyang Wang, Yitong Yin

Sink-free orientations: a local sampler with applications

Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang

Counting random k-SAT near the satisfiability threshold

We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \leq …

Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin

Phase Transitions via Complex Extensions of Markov Chains

We study algebraic properties of partition functions, particularly the location of zeros, through the lens of rapidly mixing Markov …

Jingcheng Liu, Chunyang Wang, Yixiao Yu, Yitong Yin

A Sampling Lovász Local Lemma for Large Domain Sizes

We present polynomial-time algorithms for approximate counting and sampling solutions to constraint satisfaction problems (CSPs) with …

Chunyang Wang, Yitong Yin

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

Deterministic counting Lovász local lemma beyond linear programming

Kun He, Chunyang Wang, Yitong Yin

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