Lecture

Stochastic Simulation: Markov Chains and Monte Carlo

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-414: Stochastic simulation

The student who follows this course will get acquainted with computational tools used to analyze systems with uncertainty arising in engineering, physics, chemistry, and economics. Focus will be on sampling methods as Monte Carlo, quasi Monte Carlo, Mark ...

Description

This lecture covers the theory of Markov chains and Monte Carlo methods for stochastic simulation. Topics include low discrepancy sequences, Markov Chain Monte Carlo, and the computation of multidimensional integrals using Monte Carlo estimators. The lecture also discusses Halton and Hammersley point sets, as well as the concept of radical inverse for numerical computations.

Instructor

Fabio Nobile

Teaching & PhD PhD Students Veronica Montanaro, Matteo Raviola, Francesca Bettinelli, Eliott Van Dieren, Riccardo Saporiti, Giacomo Mossinelli, Noé Stauffer, Fabio Zoccolan Past EPFL PhD Students Diane Sylvie Guignard, Francesco Tesei, Eleonora Musharbash, Matthieu Claude Martin, Davide Pradovera, Sundar Subramaniam Ganesh, Eva Vidlicková, Juan Pablo Madrigal Cianci, Andrea Zanoni, Thomas Simon Spencer Trigo Trindade Past EPFL PhD Students as codirector Michele Pisaroni Courses Advanced analysis II - ve

Official source

Related concepts (32)

Markov chain Monte Carlo

In statistics, Markov chain Monte Carlo (MCMC) methods comprise a class of algorithms for sampling from a probability distribution. By constructing a Markov chain that has the desired distribution as its equilibrium distribution, one can obtain a sample of the desired distribution by recording states from the chain. The more steps that are included, the more closely the distribution of the sample matches the actual desired distribution. Various algorithms exist for constructing chains, including the Metropolis–Hastings algorithm.

Web page

A web page (or webpage) is a hypertext document on the World Wide Web. Web pages are delivered by a web server to the user and displayed in a web browser. A website consists of many web pages linked together under a common domain name. The name "web page" is a metaphor of paper pages bound together into a book. A web page is a structured document. The core element of a web page is a written in the HyperText Markup Language (HTML) which specifies the content of the web page (including links (called hyperlinks) to other web resources, primarily other web pages, and to different sections of the same web page).

Markov chain

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC).

Computational science

Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science that uses advanced computing capabilities to understand and solve complex physical problems. This includes Algorithms (numerical and non-numerical): mathematical models, computational models, and computer simulations developed to solve sciences (e.

Monte Carlo method

Monte Carlo methods, or Monte Carlo experiments, are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. The underlying concept is to use randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in three problem classes: optimization, numerical integration, and generating draws from a probability distribution.

Related lectures (64)

Markov Chains: Simulation and Optimization

Explores Markov chains, Metropolis-Hastings, and simulation for optimization purposes, highlighting the significance of ergodicity in efficient variable simulation.

Markov Chains and Applications

Explores Markov chains and their applications in algorithms, focusing on user impatience and faithful sample generation.

Quantum Monte Carlo: Basic Concepts

Covers the basic concepts of Quantum Monte Carlo and its application in spin chains, Markov chains, and Monte Carlo simulations.

Equilibrium and Distribution

Explores the mesoscopic master equation, equilibrium, distribution, and Metropolis algorithm in Monte Carlo simulations.

Optimization and Simulation