3 papers
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.DS2021
Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing
Konrad Anand, Mark Jerrum
We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph . The sampling algorithm assum…
cs.RO2020
Probabilistic Analysis of RRT Trees
Konrad Anand, Luc Devroye
This thesis presents analysis of the properties and run-time of the Rapidly-exploring Random Tree (RRT) algorithm. It is shown that the time for the RRT with stepsize to grow c…