37 citations · 171 across the 30 of their papers we have counts for
4 papers · 1 filter
Zeros of Holant problems: locations and algorithms
Heng Guo, Chao Liao, Pinyan Lu +1
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised sec…
Approximately counting bases of bicircular matroids
Heng Guo, Mark Jerrum
We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bas…
Tight bounds for popping algorithms
Heng Guo, Kun He
We sharpen run-time analysis for algorithms under the partial rejection sampling framework. Our method yields improved bounds for: the cluster-popping algorithm for approximating a…
Perfect simulation of the Hard Disks Model by Partial Rejection Sampling
Heng Guo, Mark Jerrum
We present a perfect simulation of the hard disks model via the partial rejection sampling method. Provided the density of disks is not too high, the method produces exact samples…