Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
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^{…
cs.DS2023
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…