Lecture

Monte Carlo Methods: Metropolis Algorithm

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.

Description

This lecture covers the concepts of Monte Carlo methods, importance sampling, and the Metropolis algorithm. Importance sampling is explained through interactions between nearest neighbors and mean value calculations. The Metropolis algorithm is detailed, including the detailed balance condition and practical implementation in a cement simulation.

In MOOC

Sorption and transport in cementitious materials

In the MOOC: “Cement chemistry and sustainable cementitious materials”; you learned how to create more sustainable cementitious materials. But concrete is not an inert rock. It is a dynamic porous material, which can exchange water, gas and ions with its environment. Through physical and chemical interactions, these exchanges can have dramatic consequences: cracks due to shrinkage, reinforcement bars corrosion, spalling, … For a true sustainability, the durability of cementitious materials should not be f

Official source

Related concepts (16)

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.

Simulation

A simulation is the imitation of the operation of a real-world process or system over time. Simulations require the use of models; the model represents the key characteristics or behaviors of the selected system or process, whereas the simulation represents the evolution of the model over time. Often, computers are used to execute the simulation. Simulation is used in many contexts, such as simulation of technology for performance tuning or optimizing, safety engineering, testing, training, education, and video games.

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.

Training simulation

In business, training simulation is a virtual medium through which various types of skills can be acquired. Training simulations can be used in a variety of genres; however they are most commonly used in corporate situations to improve business awareness and management skills. They are also common in academic environments as an integrated part of a business or management course. The word simulation implies an imitation of a real-life process, usually via a computer or other technological device, in order to provide a lifelike experience.

Stratified sampling

In statistics, stratified sampling is a method of sampling from a population which can be partitioned into subpopulations. In statistical surveys, when subpopulations within an overall population vary, it could be advantageous to sample each subpopulation (stratum) independently. Stratification is the process of dividing members of the population into homogeneous subgroups before sampling. The strata should define a partition of the population.

Related lectures (52)

Markov Chains and Applications

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

Numerical Simulation of SDEs: Monte Carlo & Optimal Control

Covers Monte Carlo methods, variance reduction, and stochastic optimal control, exploring simulation techniques, efficiency, and investment dynamics.

Theory of MCMC

Covers the theory of Markov Chain Monte Carlo (MCMC) sampling and discusses convergence conditions, transition matrix choice, and target distribution evolution.

Efficient Stochastic Numerical Methods

Explores efficient stochastic numerical methods for modeling and learning, covering topics like the Analytical Engine and kinase inhibitors.

Molecular Dynamics and Monte Carlo