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 2020Show all

2 papers · 1 filter

math.PR2020

The hit-and-run version of top-to-random

Samuel Boardman, Daniel Rudolf, Laurent Saloff-Coste

We study an example of a {\em hit-and-run} random walk on the symmetric group $S_{n}$ . Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-r…

math.ST2020

Stability of doubly-intractable distributions

Michael Habeck, Daniel Rudolf, Björn Sprungk

Doubly-intractable distributions appear naturally as posterior distributions in Bayesian inference frameworks whenever the likelihood contains a normalizing function $Z$ . Having tw…