Skip to content

SPD

Seminar

SPDE scaling limits of an Markov chain Montecarlo algorithm

Mattingly, J (Duke)
Monday 28 June 2010, 14:10-15.00

Seminar Room 1, Newton Institute

Abstract

I will discuss how a simple random walk metropolis algorithm converges to an SPDE as the dimension of the sample space goes to infinity. I will discuss how this the limiting SPDE gives insight into how one should tune the algorithm to obtain an asymptotically optimal mixing rate. This is joint work with Andrew Stuart and Natesh Pialli.

Video

Your browser can’t play this video. You do not appear to have a flash player installed.
Please download flash player or choose an alternative format instead.

Get Adobe Flash player

Available Video Formats

Back to top ∧