Daniel Rudolf

activity

20182022

most citedRobust random walk-like Metropolis-Hastings algorithms for concentrating posteriors

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.PR2019

Expected dispersion of uniformly distributed points

Aicke Hinrichs, David Krieg, Robert J. Kunsch +1

The dispersion of a point set in $[0, 1]^{d}$ is the volume of the largest axis parallel box inside the unit cube that does not intersect with the point set. We study the expected dis…

math.PR2019

Quantitative spectral gap estimate and Wasserstein contraction of simple slice sampling

Viacheslav Natarovskii, Daniel Rudolf, Björn Sprungk

We prove Wasserstein contraction of simple slice sampling for approximate sampling w.r.t. distributions with log-concave and rotational invariant Lebesgue densities. This yields, i…