11 citations · 26 across the 5 of their papers we have counts for
13 papers
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 \…
Local-to-Global Contraction in Simplicial Complexes
Heng Guo, Giorgos Mousa
We give a local-to-global principle for relative entropy contraction in simplicial complexes. This is similar to the local-to-global principle for variances obtained by Alev and La…
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…
Zeros of ferromagnetic 2-spin systems
Heng Guo, Jingcheng Liu, Pinyan Lu
We study zeros of the partition functions of ferromagnetic 2-state spin systems in terms of the external field, and obtain new zero-free regions of these systems via a refinement o…
Perfect sampling from spatial mixing
Weiming Feng, Heng Guo, Yitong Yin
We introduce a new perfect sampling technique that can be applied to general Gibbs distributions and runs in linear time if the correlation decays faster than the neighborhood grow…