2 citations · 2 across the 5 of their papers we have counts for
8 papers
Sink-free orientations: a local sampler with applications
Konrad Anand, Graham Freifeld, Heng Guo +2
For sink-free orientations in graphs of minimum degree at least , we show that there is a deterministic approximate counting algorithm that runs in time $O((n^{73}/\varepsilon^{…
Rapid mixing of the flip chain over non-crossing spanning trees
Konrad Anand, Weiming Feng, Graham Freifeld +3
We show that the flip chain for non-crossing spanning trees of points in convex position mixes in time . We use connections between Fuss-Catalan structures to c…
Approximate Counting for Spin Systems in Sub-Quadratic Time
Konrad Anand, Weiming Feng, Graham Freifeld +2
We present two randomised approximate counting algorithms with running time for some constant and accuracy : (1) for the h…
Inapproximability of Counting Independent Sets in Linear Hypergraphs
Guoliang Qiu, Jiaheng Wang
It is shown in this note that approximating the number of independent sets in a -uniform linear hypergraph with maximum degree at most is NP-hard if …
Towards derandomising Markov chain Monte Carlo
Weiming Feng, Heng Guo, Chunyang Wang +2
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of marginal…
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
Weiming Feng, Heng Guo, Mark Jerrum +1
We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
Weiming Feng, Heng Guo, Jiaheng Wang
We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand m…
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 \…