Monte Carlo Methods in Statistical Mechanics Aziz Abdellahi CEDER group Materials Basics Lecture : 08/18/2011 1.

Slides:



Advertisements
Similar presentations
PRAGMA – 9 V.S.S.Sastry School of Physics University of Hyderabad 22 nd October, 2005.
Advertisements

Simulazione di Biomolecole: metodi e applicazioni giorgio colombo
Lecture 18: Temporal-Difference Learning
Monte Carlo Simulation Wednesday, 9/11/2002 Stochastic simulations consider particle interactions. Ensemble sampling Markov Chain Metropolis Sampling.
Review Of Statistical Mechanics
Molecular Dynamics at Constant Temperature and Pressure Section 6.7 in M.M.
Lecture 13: Conformational Sampling: MC and MD Dr. Ronald M. Levy Contributions from Mike Andrec and Daniel Weinstock Statistical Thermodynamics.
Monte Carlo Methods and Statistical Physics
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Graduate School of Information Sciences, Tohoku University
BAYESIAN INFERENCE Sampling techniques
1 CE 530 Molecular Simulation Lecture 8 Markov Processes David A. Kofke Department of Chemical Engineering SUNY Buffalo
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
Machine Learning CUNY Graduate Center Lecture 7b: Sampling.
Computational Physics Quantum Monte Carlo methods Dr. Guy Tel-Zur.
Monte Carlo Simulation of Ising Model and Phase Transition Studies
Inferences About Process Quality
Econ 482 Lecture 1 I. Administration: Introduction Syllabus Thursday, Jan 16 th, “Lab” class is from 5-6pm in Savery 117 II. Material: Start of Statistical.
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Advanced methods of molecular dynamics Monte Carlo methods
Monte Carlo Methods: Basics
Classical and Quantum Monte Carlo Methods Or: Why we know as little as we do about interacting fermions Erez Berg Student/Postdoc Journal Club, Oct
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Introduction to Monte Carlo Simulation. What is a Monte Carlo simulation? In a Monte Carlo simulation we attempt to follow the `time dependence’ of a.
Monte Carlo and Statistical Methods in HEP Kajari Mazumdar Course on Particle Physics, TIFR, August, 2009.
Machine Learning Lecture 23: Statistical Estimation with Sampling Iain Murray’s MLSS lecture on videolectures.net:
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
P T A typical experiment in a real (not virtual) space 1.Some material is put in a container at fixed T & P. 2.The material is in a thermal fluctuation,
Experimental Method and Data Process: “Monte Carlo Method” Presentation # 1 Nafisa Tasneem CHEP,KNU
Monte Carlo Methods Versatile methods for analyzing the behavior of some activity, plan or process that involves uncertainty.
Simulated Annealing.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
ChE 553 Lecture 15 Catalytic Kinetics Continued 1.
Understanding Molecular Simulations Introduction
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
NCN nanoHUB.org Wagner The basics of quantum Monte Carlo Lucas K. Wagner Computational Nanosciences Group University of California, Berkeley In collaboration.
Schematic representation of ‘Microstates’. Integretion over a Markovian Web. G. C. Boulougouris, D. Frenkel, J. Chem. Theory Comput. 2005, 1,
Lecture 2 Molecular dynamics simulates a system by numerically following the path of all particles in phase space as a function of time the time T must.
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
ChE 452 Lecture 17 Review Of Statistical Mechanics 1.
Path Integral Quantum Monte Carlo Consider a harmonic oscillator potential a classical particle moves back and forth periodically in such a potential x(t)=
Computer simulation Sep. 9, QUIZ 2 Determine whether the following experiments have discrete or continuous out comes A fair die is tossed and the.
Sampling and estimation Petter Mostad
Expectation-Maximization (EM) Algorithm & Monte Carlo Sampling for Inference and Approximation.
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
Monte Carlo in different ensembles Chapter 5
1 Introduction to Statistics − Day 4 Glen Cowan Lecture 1 Probability Random variables, probability densities, etc. Lecture 2 Brief catalogue of probability.
Review Session BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Gil McVean, Department of Statistics Thursday February 12 th 2009 Monte Carlo simulation.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Ka-fu Wong © 2007 ECON1003: Analysis of Economic Data Lesson0-1 Supplement 2: Comparing the two estimators of population variance by simulations.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 17: Boltzmann Machines as Probabilistic Models Geoffrey Hinton.
Chapter 6: Basic Methods & Results of Statistical Mechanics
Monte Carlo Simulation of Canonical Distribution The idea is to generate states i,j,… by a stochastic process such that the probability  (i) of state.
COMPUTERS SIMULATION IN MATHEMATICS EDUCATION Dr. Ronit Hoffmann Kibbutzim College of Education, Israel.
Computational Physics (Lecture 11) PHY4061. Variation quantum Monte Carlo the approximate solution of the Hamiltonian Time Independent many-body Schrodinger’s.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Computational Physics (Lecture 8) PHY4061. Inverse of a matrix The inverse of a matrix A using linear equating approach: A −1 i j = x i j, – for i, j.
Monte Carlo Simulation of the Ising Model Consider a system of N classical spins which can be either up or down. The total.
The Monte Carlo Method/ Markov Chains/ Metropolitan Algorithm from sec in “Adaptive Cooperative Systems” -summarized by Jinsan Yang.
Computational Physics (Lecture 10)
Point and interval estimations of parameters of the normally up-diffused sign. Concept of statistical evaluation.
Monte Carlo: A Simple Simulator’s View
14. TMMC, Flat-Histogram and Wang-Landau Method
DIAGRAMMATIC MONTE CARLO:
Common Types of Simulations
Presentation transcript:

Monte Carlo Methods in Statistical Mechanics Aziz Abdellahi CEDER group Materials Basics Lecture : 08/18/2011 1

What is Monte Carlo ? Famous for its casinos ! Monte Carlo is an administrative area of the principality of Monaco. Monte Carlo is a (large) class of numerical methods used to solve integrals and differential equations using sampling and probabilistic criteria. 2

The simplest Monte Carlo method Finding the value of π (“shooting darts”) π/4 is equal to the area of a circle of diameter Details of the Method Randomly select a large number of points inside the square Integral solved with Monte Carlo (Exact when N_total  ∞) 3

MC : Common features and applications Common features in Monte Carlo methods Uses random numbers and selection criteria Monte Carlo in Statistical Mechanics : Calculating thermodynamic properties of a material from its first-principles Hamiltonian Requires the repetition of a large number of events Monte Carlo method that will be discussed in this talk Example of results obtained from MC : Li x FePO 4 (Li-ion battery cathode) Only consider configurational degrees of freedom (Li-Vacancy) The energies of all Li-Vacancy configurations are known (Hamiltonian) 4

Useful battery properties that can be obtained from Monte Carlo Phase diagram, Voltage profiles Results obtained from Monte Carlo These properties are deduced from the μ(x,T) relation [or alternatively x(μ,T)] Results obtained in the Ceder group (using Monte Carlo) Li x FePO 4 phase diagramVoltage profile (room temperature) 5

How to calculate the partition function ? Key physical quantity : The partition function Finding a numerical approximation to the partition function Monte Carlo strategy : Calculate thermodynamic properties by sampling configurations according to their Boltzmann probability {j} : Set of all possible Li-Vacancy configurations E j : Energy of configuration j N j : Number of Li in configuration j All thermodynamic properties can be computed from the partition function Etc. Control parameters The partition function cannot be calculated directly because the number of configurations scales exponentially with the system size (2 N_sites possible configurations … too hard even for modern computers !). 6

Monte Carlo or “Importance Sampling” Importance sampling : Sample states according to their actual probability Consider the following random variable x : Direct calculation of : Importance sampling : Randomly pick 10 values of x out of a giant hat containing 10% 0’s, 80% 1’s and 10% 2’s. Possible outcome :  The arithmetic average will not always be equal to the average. However, the two become equal in the limit of large “chains”. Importance sampling : Sample states with the correct probability. Works well for very large systems that have heavy probability discrepancies. 7

Monte Carlo or “Importance Sampling” Monte Carlo : Methodology Create a Markov chain of configurations, where each configuration is determined from the previous one using a certain probabilistic criteria C 1  C 2  …  C N_max Choose the probabilistic criteria so that states are asympotically sampled with the equilibrium Boltzmann probability (that is the main difficulty !) Start from an initial configuration C 1 Calculate thermodynamic averages directly through arithmetic averages over the Markov Chain E n : Energy of configuration C n N n : Number of Li in configuration C n 8

Metropolis Algorithm Building the chain : The Metropolis Algorithm Start from an initial configuration C 1 : Change the occupation state of the first Li site :  Calculate E i -μN i (Before the change) and E f -μN f (After the change)  If E f -μN f < E i -μN i, accept the change  If E f -μN f > E i –μN i, accept the change with the probability : Repeat for all other Li sites to get C 2 (Ratio of Boltzmann probabilities…) 9

Metropolis algorithm (3) Why does the Metropolis algorithm work ? The Metropolis algorithm generates a chain Markov consistent with Boltzmann probabilities sampling because the selection criteria has Boltzmann probabilities built into it.  It can be shown that all selection criteria that respect the condition of detailed balance produce correct sampling : Probability of generating configuration j from configuration i Because the most probable configurations are sampled preferentially, good approximations of thermodynamic averages can be obtained by sampling a relatively small number of configurations 10

Conclusion Monte Carlo in Statistical Mechanics Method to approximate thermodynamic properties using clever sampling Other Monte Carlo methods in engineering Good results can be obtained by sampling a relatively small number of configurations (relative to the total number of possible configurations) :  Li x FePO 4 voltage profile : states sampled instead of Kinetic Monte Carlo (to calculate diffusivities) Quantum Monte Carlo (to solve the Schrodinger equation) Monte Carlo in nuclear engineering (to predict the evolution of the neutron population in a nuclear reactor) 11

Questions ? 12