CM_Part_3

CM_Part_3 - Metropolis Monte Carlo Detailed balance condition There are many possible choices of the W which will satisfy detailed balance Each

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Virginia, MSE 4270/6270: Introduction to Atomistic Simulations, Leonid Zhigilei Metropolis Monte Carlo: Detailed balance condition if U(n) > U(m) = = kT U kT U m n W n m W nm nm exp 1 exp ) ( ) ( ) 0 ( 1 ) ( ) 0 ( exp ) ( = > = nm nm nm U n m W U kT U n m W if U(n) < U(m) = = kT U kT U m n W n m W nm mn exp exp 1 ) ( ) ( Thus, the Metropolis Monte Carlo algorithm generates a new configuration n from a previous configuration m so that the transition probability W(m -> n) satisfies the detailed balance condition. There are many possible choices of the W which will satisfy detailed balance. Each choice would provide a dynamic method of generating an arbitrary probability distribution. Let us make sure that Metropolis algorithm satisfies the detailed balance condition.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
University of Virginia, MSE 4270/6270: Introduction to Atomistic Simulations, Leonid Zhigilei Metropolis Monte Carlo algorithm 1. Choose the initial configuration, calculate energy
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2012 for the course MSE 4270 taught by Professor Zhigilei during the Fall '11 term at UVA.

Page1 / 5

CM_Part_3 - Metropolis Monte Carlo Detailed balance condition There are many possible choices of the W which will satisfy detailed balance Each

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online