activity
20102023
most citedA sharp upper bound for sampling numbers in

53 citations · 640 across the 36 of their papers we have counts for

collaborators
Showing math.PRShow all

6 papers · 1 filter

math.PR2015★ 7 cited

Comparison of hit-and-run, slice sampling and random walk Metropolis

Daniel Rudolf, Mario Ullrich

Different Markov chains can be used for approximate sampling of a distribution given by an unnormalized density function with respect to the Lebesgue measure. The hit-and-run, (hyb…

math.PR2012★ 27 cited

Positivity of hit-and-run and related algorithms

Daniel Rudolf, Mario Ullrich

We prove positivity of the Markov operators that correspond to the hit-and-run algorithm, random scan Gibbs sampler, slice sampler and an Metropolis algorithm with positive proposa…

math.PR2012★ 15 cited

Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions

Mario Ullrich

We prove that the spectral gap of the Swendsen-Wang dynamics for the random-cluster model on arbitrary graphs with m edges is bounded above by 16 m log m times the spectral gap of…

math.PR2012★ 29 cited

Swendsen-Wang is faster than single-bond dynamics

Mario Ullrich

We prove that the spectral gap of the Swendsen-Wang dynamics for the random-cluster model is larger than the spectral gap of a single-bond dynamics, that updates only a single edge…

math.PR2011★ 21 cited

Comparison of Swendsen-Wang and Heat-Bath Dynamics

Mario Ullrich

We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any s…

math.PR2010★ 2 cited

Exact Sampling for the Ising Model at all Temperatures

Mario Ullrich

We give a survey of the known results on mixing time of Glauber dynamics for the Ising model on the square lattice and present a technique that makes exact sampling of the Ising mo…