activity
20122024
most citedCoupled MCMC with a randomized acceptance probability

33 citations · 54 across the 17 of their papers we have counts for

collaborators
Showing 2015 · math.PRShow all

1 paper · 2 filters

math.PR2015★ 2 cited

Efficiency and computability of MCMC with Langevin, Hamiltonian, and other matrix-splitting proposals

Richard A. Norton, Colin Fox

We analyse computational efficiency of Metropolis-Hastings algorithms with AR(1) process proposals. These proposals include, as a subclass, discretized Langevin diffusion (e.g. MAL…