The Metropolis-Hastings Method

The Metropolis-Hastings Method

Gangapersad, Ravish (TU Delft Electrical Engineering, Mathematics and Computer Science)

Kekkonen, H.N. (mentor)
Meester, L.E. (mentor)

Delft University of Technology

2020-08-24

In this report, our goal is to find a way to get some information such as the mean out of high dimensional densities. If we want to calculate the mean we need to calculate integrals, which are difficult to do for high dimensional densities. We cannot use the analytical or classical (deterministic) numerical rules for high dimensional problems for which we want to calculate the mean. These methods take a lot of computational time. To solve this problem we introduced the Markov Chain Monte Carlo (MCMC) method, the method samples from the distribution, and with these samples, we can approximate the mean. Then we explain the theory behind these methods and how we can use it. Then we introduced one MCMC method, in particular, the Metropolis-Hastings Algorithm. We explain how this method works and the theory behind it. From this, we see that the method is very easy to implement and can be used to approximate the mean. Then we approximate the mean for some examples using this method.

Metropolis-Hasings algorithm
Markov chains
Markov Chain Monte Carlo

http://resolver.tudelft.nl/uuid:48af5ae0-db00-4ad6-adfc-14f25a8651f3

Student theses

bachelor thesis

© 2020 Ravish Gangapersad