For a new configuration of the same volume V and number of molecules N, displace a randomly selected atom to a point chosen with uniform probability inside.

Slides:



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

Monte Carlo Methods and Statistical Physics
Simulated Annealing Methods Matthew Kelly April 12, 2011.
11 - Markov Chains Jim Vallandingham.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Lecture 14: Advanced Conformational Sampling
1 CE 530 Molecular Simulation Lecture 8 Markov Processes David A. Kofke Department of Chemical Engineering SUNY Buffalo
Analyzing the Results of a Simulation and Estimating Errors Jason Cooper.
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
CE 400 Honors Seminar Molecular Simulation Prof. Kofke Department of Chemical Engineering University at Buffalo, State University of New York Class 4.
Simulated Annealing Van Laarhoven, Aarts Version 1, October 2000.
1 CE 530 Molecular Simulation Lecture 2 David A. Kofke Department of Chemical Engineering SUNY Buffalo
1 CE 530 Molecular Simulation Lecture 3 David A. Kofke Department of Chemical Engineering SUNY Buffalo
Introduction to Monte Carlo Methods D.J.C. Mackay.
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
Advanced methods of molecular dynamics Monte Carlo methods
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
MonteCarlo Optimization (Simulated Annealing) Mathematical Biology Lecture 6 James A. Glazier.
TUTORIAL no. 2 Monte Carlo simulations: Lennard Jones gas G. Lattanzi Università degli studi di Bari “Aldo Moro” Trieste, July 10 th, 2012 CECAM school.
Number of Blocks per Pole Diego Arbelaez. Option – Number of Blocks per Pole Required magnetic field tolerance of ~10 -4 For a single gap this can be.
1 CE 530 Molecular Simulation Lecture 17 Beyond Atoms: Simulating Molecules David A. Kofke Department of Chemical Engineering SUNY Buffalo
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Microscopic states (microstates) or microscopic configurations under external constraints (N or , V or P, T or E, etc.)  Ensemble (micro-canonical, canonical,
1 CE 530 Molecular Simulation Lecture 6 David A. Kofke Department of Chemical Engineering SUNY Buffalo
Nathan Baker BME 540 The Monte Carlo method Nathan Baker BME 540.
Monte Carlo Methods1 T Special Course In Information Science II Tomas Ukkonen
Simulated Annealing.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 14 Some materials adapted from Prof. Keith E. Gubbins:
Monte Carlo Methods So far we have discussed Monte Carlo methods based on a uniform distribution of random numbers on the interval [0,1] p(x) = 1 0  x.
Markov Chain Monte Carlo and Gibbs Sampling Vasileios Hatzivassiloglou University of Texas at Dallas.
Suppressing Random Walks in Markov Chain Monte Carlo Using Ordered Overrelaxation Radford M. Neal 발표자 : 장 정 호.
Exploring the connection between sampling problems in Bayesian inference and statistical mechanics Andrew Pohorille NASA-Ames Research Center.
Statistical Inference for the Mean Objectives: (Chapter 9, DeCoursey) -To understand the terms: Null Hypothesis, Rejection Region, and Type I and II errors.
NCN nanoHUB.org Wagner The basics of quantum Monte Carlo Lucas K. Wagner Computational Nanosciences Group University of California, Berkeley In collaboration.
1 CE 530 Molecular Simulation Lecture 10 Simple Biasing Methods David A. Kofke Department of Chemical Engineering SUNY Buffalo
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
Path Integral Quantum Monte Carlo Consider a harmonic oscillator potential a classical particle moves back and forth periodically in such a potential x(t)=
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Monte Carlo method: Basic ideas. deterministic vs. stochastic In deterministic models, the output of the model is fully determined by the parameter values.
Sampling and estimation Petter Mostad
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
1/18/2016Atomic Scale Simulation1 Definition of Simulation What is a simulation? –It has an internal state “S” In classical mechanics, the state = positions.
1 1 Slide © 2004 Thomson/South-Western Simulation n Simulation is one of the most frequently employed management science techniques. n It is typically.
Monte Carlo methods (II) Simulating different ensembles
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
A bin-free Extended Maximum Likelihood Fit + Feldman-Cousins error analysis Peter Litchfield  A bin free Extended Maximum Likelihood method of fitting.
Statistical Mechanics and Multi-Scale Simulation Methods ChBE
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Simulation of Finite Geometry LDPC code on the Packet Erasure channel Wu Yuchun July 2007 Huawei Hisi Company Ltd.
Lecture 14: Advanced Conformational Sampling Dr. Ronald M. Levy Statistical Thermodynamics.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Statistical Inference for the Mean Objectives: (Chapter 8&9, DeCoursey) -To understand the terms variance and standard error of a sample mean, Null Hypothesis,
6/11/2016Atomic Scale Simulation1 Definition of Simulation What is a simulation? –It has an internal state “S” In classical mechanics, the state = positions.
Extrapolation Techniques  Four different techniques have been used to extrapolate near detector data to the far detector to predict the neutrino energy.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Systematic errors of MC simulations Equilibrium error averages taken before the system has reached equilibrium  Monitor the variables you are interested.
Computational Physics (Lecture 10)
Advanced Statistical Computing Fall 2016
Maria Okuniewski Nuclear Engineering Dept.
Markov chain monte carlo
Introduction to Simulated Annealing
Common Types of Simulations
VQMC J. Planelles.
CE 530 Molecular Simulation
Presentation transcript:

For a new configuration of the same volume V and number of molecules N, displace a randomly selected atom to a point chosen with uniform probability inside a cubic volume of edge 2  centered on the current position of the atom. Examine underlying transition probability to formulate the acceptance criterion Displacement trial move. 1. Specification ? Select an atom at random. Consider a region centered at it. Move atom to a point chosen uniformly in region. Consider acceptance of new configuration. 22 Step 1Step 2Step 3Step 4 general hitherto David A. Kofke, SUNY Buffalo

Displacement trial move. 4. Pseudo Code (Louis)

Rule of thumb: Size of the step is adjusted to reach a target acceptance rate of displacement trials, which is typically 50%. Large step leads to less acceptance but bigger moves. Small step leads to less movement but more acceptance. Displacement trial move. 6. Step size tuning

Error analysis in Metropolis Monte Carlo: Example of data correlation. 1D Harmonic oscillator (~NVT) assumes that the N measurements of x are all independent. in a sense of constant kinetic energy T (=0) i.e., E(x)=V(x)

Example of data correlation: 1D harmonic oscillator First 1000 steps in MC time history of x for three different step sizes  or  = 1; 10; 200 (corresponding acceptance rate = 0.70; 0.35; 0.02) Richard T. Scalettar rejected correlated xixi

Example of data correlation: 1D harmonic oscillator where (fluctuation around the average), which measure whether the fluctuations are related for x values l measurement apart. Autocorrelation functions for the complete data sets (400,000 steps) of x for three different step sizes  = 1; 10; 200 (acceptance rate = 0.70; 0.35; 0.02) e -1 correlation time  (short)correlation time  (long) In generating these results so far, x was measured every MC step.

c m (l) = correlation function when measurements are only every m-th MC step = c 1 (ml) If one choose m> , then the measurements all become independent. For correct error bar, measurements should be separated by awaiting time m larger than . Advantage: We don’t waste time making measurements when they are not independent. Disadvantage: We need longer (by m times) MC simulations to achieve the same accuracy. assumes that the N measurements of x are all independent. (Statistical) Error analysis in Metropolis Monte Carlo What happens if one instead measures only every m-th MC step? MC step: m m+1 m+2 m+3  Measurement: 1 MC step: 2m Measurement: m mm MC step 3 Measurement 3

(Statistical) Error analysis in Metropolis Monte Carlo: Rebinning data. Block averages. Choose a bin size M b and average x over each of the L (= N/M b ) bins (N = total number of measurements) to create L “binned” “independent” measurements {m 1, m 2, , m j, , m L }. Error bars for different bin sizes m based on the same data sets (400,000 steps) of x for three different step sizes  = 1; 10; 200 (acceptance rate = 0.70; 0.35; 0.02) increase with M b (L  ) flat out to a correct asymptotic value   (L ,  2  ) & too small  1 (M b =1) (assume independence of each measurement) MbMb MbMb MbMb

Initialization Reset block sums Compute block average Compute final results “cycle” or “sweep” “block” Move each atom once (on average) 100’s or 1000’s of cycles Independent “measurement” moves per cycle cycles per block Add to block sum blocks per simulation New configuration Entire Simulation Monte Carlo Move Select type of trial move each type of move has fixed probability of being selected Perform selected trial move Decide to accept trial configuration, or keep original David A. Kofke, SUNY Buffalo Displacement trial move. 5. Implementation

Systematic errors of MC simulations Equilibrium error averages taken before the system has reached equilibrium  Monitor the variables you are interested in.  Take averages only after they have stopped drifting. system stuck in a local minimum of the energy landscape The system may appear to equilibrate nicely inside the local well. However, it is not sampling phase-space correctly.  an “ergodicity” problem  Perform a simulation with several different starting configurations, if you can.  Otherwise, use one of the methods devised to get out of this problem. e.g. simulated annealing (T), parallel tempering (T), metadynamics (PE), etc. Finite size error Thermodynamic averages defined for infinite (impossible to simulate) system  Run on several different system sizes and extrapolate to N = . properties which depend on fluctuations with wavelengths larger than the smallest length of your simulation box  Test on several different system sizes until the property you study no longer varies.