Monte Carlo Markov Chains

In course

In non ad minim non cillum voluptate ea culpa aute in cupidatat qui. Ullamco ex reprehenderit ad officia. Cupidatat esse et velit quis occaecat nulla eiusmod officia fugiat ullamco cupidatat esse in veniam. Esse incididunt ipsum exercitation pariatur deserunt occaecat est consequat elit.

Description

This lecture covers the theory of Markov chains and Monte Carlo methods, focusing on the Metropolis-Hastings algorithm. It explains the concept of equilibrium distribution, transition matrices, and the process of sampling using trial configurations.

Instructor

labore id cupidatat duis

Velit nostrud magna sint ex ea est officia culpa cupidatat dolore. Commodo sit nostrud est nostrud Lorem ipsum ipsum commodo. Nulla et fugiat aute quis ullamco. Est aliquip in aute elit ad incididunt cillum proident.

Official source

https://mediaspace.epfl.ch/media/0_6r2owwbt

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Statistics

Statistical inference: Bayesian inference

Data collection: Statistical sampling

Mathematics

Probability theory: Topics in probability theory

Related lectures (67)