University of Cambridge > Talks.cam > MRC Biostatistics Unit Seminars > BSU Seminar: “Quasi Markov Chain Monte Carlo Methods”

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

BSU Seminar: “Quasi Markov Chain Monte Carlo Methods”

Download to your calendar using vCal

If you have a question about this talk, please contact Alison Quenault .

Generalised Metropolis-Hastings is a Markov chain Monte Carlo (MCMC) method that was introduced to allow for parallelisation by proposing multiple samples in each iteration, such that the stationary distribution is still the correct target density. In this more recent work, we prove that the consistency property still holds true when the driving sequence of pseudo-random numbers is replaced by completely uniformly distributed (c.u.d.) numbers. In essence this allows us to combine ideas from Quasi Monte Carlo with Markov chain Monte Carlo. In this talk I’ll present ideas used to construct this new Monte Carlo method, along with the results of initial numerical simulations that confirm our theoretical result, and suggest a scaling of order n-1 as we increase parallelisation instead of the usual n-1/2 convergence rate of standard MCMC methods.

This talk is part of the MRC Biostatistics Unit Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Senior Parlour, Gonville & Caius College FW 11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon The Cambridge Russian-Speaking Society

Other talks

An AI-Assisted Proof in Spectral Geometry Why people with schizophrenia die earlier? Mortality and accelerated ageing Talk TBC Topology of the Ritz energy landscape Group Presentation 5 A Few Days in Patagonia - the Deep South
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity