4 citations · 14 across the 6 of their papers we have counts for
11 papers
Optimal mixing for two-state anti-ferromagnetic spin systems
Xiaoyu Chen, Weiming Feng, Yitong Yin +1
We prove an optimal lower bound for modified log-Sobolev (MLS) constant of the Glauber dynamics for anti-ferromagnetic two-spin systems with vertices in the tree un…
Improved bounds for randomly colouring simple hypergraphs
Weiming Feng, Heng Guo, Jiaheng Wang
We study the problem of sampling almost uniform proper -colourings in -uniform simple hypergraphs with maximum degree . For any , if and $q \…
Optimal Mixing Time for the Ising Model in the Uniqueness Regime
Xiaoyu Chen, Weiming Feng, Yitong Yin +1
We prove an optimal mixing time of the Glauber dynamics for the Ising models with edge activity . This mixing time bound h…
Sampling Constraint Satisfaction Solutions in the Local Lemma Regime
Weiming Feng, Kun He, Yitong Yin
We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lovász local lemma, wh…
Rapid mixing from spectral independence beyond the Boolean domain
Weiming Feng, Heng Guo, Yitong Yin +1
We extend the notion of spectral independence (introduced by Anari, Liu, and Oveis Gharan [ALO20]) from the Boolean domain to general discrete domains. This property characterises…
Fast sampling and counting k-SAT solutions in the local lemma regime
Weiming Feng, Heng Guo, Yitong Yin +1
We give new algorithms based on Markov chains to sample and approximately count satisfying assignments to -uniform CNF formulas where each variable appears at most times. Fo…