Covers the theory of Markov Chain Monte Carlo (MCMC) sampling and discusses convergence conditions, transition matrix choice, and target distribution evolution.
Explores explicit stabilised Runge-Kutta methods and their application to Bayesian inverse problems, covering optimization, sampling, and numerical experiments.
Explores the convergence of Langevin Monte Carlo algorithms under different growth rates and smoothness conditions, emphasizing fast convergence for a wide class of potentials.