Konrad Anand
Probability · Combinatorics · Algorithms
Counting, sampling, and randomization
I am a postdoctoral researcher in the Department of Computer Science at the University of Oxford, hosted by Leslie Goldberg.
My research sits at the intersection of probability, combinatorics, and algorithms, with a particular focus on efficient methods for approximate counting and sampling.
Before Oxford, I was a postdoc at the University of Edinburgh from 2024 to 2026, hosted by Heng Guo. I completed my PhD in Mathematics at Queen Mary University of London with Mark Jerrum, and my MSc in Computer Science and BSc Honours in Mathematics at McGill University; my MSc was supervised by Luc Devroye.
Latest papers
Recent work
Linear time approximation of the TV distance between product distributions
With Alistair Benford and Heng Guo.
Simulating Gaussian boson sampling on graphs in polynomial time
With Zongchen Chen, Mary Cryan, Graham Freifeld, Leslie Ann Goldberg, Heng Guo, and Xinyuan Zhang.
Sink-free orientations: a local sampler with applications
With Graham Freifeld, Heng Guo, Chunyang Wang, and Jiaheng Wang.