78 citations · 362 across the 40 of their papers we have counts for
4 papers · 1 filter
On the size of the largest empty box amidst a point set
Christoph Aistleitner, Aicke Hinrichs, Daniel Rudolf
The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest…
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…
On a generalization of the preconditioned Crank-Nicolson Metropolis algorithm
Daniel Rudolf, Björn Sprungk
Metropolis algorithms for approximate sampling of probability measures on infinite dimensional Hilbert spaces are considered and a generalization of the preconditioned Crank-Nicols…
Perturbation theory for Markov chains via Wasserstein distance
Daniel Rudolf, Nikolaus Schweizer
Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions. We…