13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.

Slides:



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

Efficient Cosmological Parameter Estimation with Hamiltonian Monte Carlo Amir Hajian Amir Hajian Cosmo06 – September 25, 2006 Astro-ph/
1 Spin Freezing in Geometrically Frustrated Antiferromagnets with Weak Bond Disorder Tim Saunders Supervisor: John Chalker.
Modern Monte Carlo Methods: (2) Histogram Reweighting (3) Transition Matrix Monte Carlo Jian-Sheng Wang National University of Singapore.
Training of the exchange bias effect reduction of the EB shift upon subsequent magnetization reversal of the FM layer Training effect: - origin of training.
Lecture 14: Advanced Conformational Sampling
CS774. Markov Random Field : Theory and Application Lecture 16 Kyomin Jung KAIST Nov
1 Quantum Monte Carlo Methods Jian-Sheng Wang Dept of Computational Science, National University of Singapore.
1 Cluster Monte Carlo Algorithms & softening of first-order transition by disorder TIAN Liang.
Phase Diagram of a Point Disordered Model Type-II Superconductor Peter Olsson Stephen Teitel Umeå University University of Rochester IVW-10 Mumbai, India.
Monte Carlo Simulation of Ising Model and Phase Transition Studies
Parallel Flat Histogram Simulations Malek O. Khan Dept. of Physical Chemistry Uppsala University.
Continuous Time Monte Carlo and Driven Vortices in a Periodic Potential V. Gotcheva, Yanting Wang, Albert Wang and S. Teitel University of Rochester Lattice.
Stochastic Relaxation, Simulating Annealing, Global Minimizers.
Ferromagnetic fluid as a model of social impact Piotr Fronczak, Agatka Fronczak and Janusz A. Hołyst Faculty of Physics and Center of Excellence for Complex.
Elements of the Heuristic Approach
Monte Carlo Methods H. Rieger, Saarland University, Saarbrücken, Germany Summerschool on Computational Statistical Physics, NCCU Taipei, Taiwan.
Introduction to Monte Carlo Methods D.J.C. Mackay.
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Advanced methods of molecular dynamics Monte Carlo methods
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
Applications of Extended Ensemble Monte Carlo Yukito IBA The Institute of Statistical Mathematics, Tokyo, Japan.
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
Monte Carlo Simulation of Interacting Electron Models by a New Determinant Approach Mucheng Zhang (Under the direction of Robert W. Robinson and Heinz-Bernd.
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
Outline Review of extended ensemble methods (multi-canonical, Wang-Landau, flat-histogram, simulated tempering) Replica MC Connection to parallel tempering.
Universal Behavior of Critical Dynamics far from Equilibrium Bo ZHENG Physics Department, Zhejiang University P. R. China.
Dynamical Replica Theory for Dilute Spin Systems Jon Hatchett RIKEN BSI In collaboration with I. Pérez Castillo, A. C. C. Coolen & N. S. Skantzos.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Thermodynamics and dynamics of systems with long range interactions David Mukamel S. Ruffo, J. Barre, A. Campa, A. Giansanti, N. Schreiber, P. de Buyl,
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
Simulated Annealing.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
1 Monte Carlo Methods Wang Jian-Sheng Department of Physics.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
Exploring the connection between sampling problems in Bayesian inference and statistical mechanics Andrew Pohorille NASA-Ames Research Center.
1 Cluster Monte Carlo Algorithms: Jian-Sheng Wang National University of Singapore.
Animating Tessellations of the Plane with Statistic Models Ben McCabe Advisor: Rolfe Petschek Department of Physics, Case Western Reserve University Artists,
Order and disorder in dilute dipolar magnets
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
Introduction to Molecular Magnets Jason T. Haraldsen Advanced Solid State II 4/17/2007.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
1 Series Expansion in Nonequilibrium Statistical Mechanics Jian-Sheng Wang Dept of Computational Science, National University of Singapore.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Monte Carlo methods applied to magnetic nanoclusters L. Balogh, K. M. Lebecki, B. Lazarovits, L. Udvardi, L. Szunyogh, U. Nowak Uppsala, 8 February 2010.
Some physical properties of disorder Blume-Emery-Griffiths model S.L. Yan, H.P Dong Department of Physics Suzhou University CCAST
Determining the Complexity of the Quantum Adiabatic Algorithm using Monte Carlo Simulations A.P. Young, University of California Santa Cruz
Marco G. Mazza Departmental Seminar Boston – February Acknowledgements: Kevin Stokely, BU Elena G. Strekalova, BU Giancarlo Franzese, Universitat.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
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.
Lecture 14: Advanced Conformational Sampling Dr. Ronald M. Levy Statistical Thermodynamics.
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,
Monte Carlo Simulation of the Ising Model Consider a system of N classical spins which can be either up or down. The total.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
8. Selected Applications
Computational Physics (Lecture 10)
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Tim Drews, Dan Finkenstadt, Xuemin Gu
Phase diagram of a mixed spin-1 and spin-3/2 Ising ferrimagnet
11. Cluster Algorithms.
12. Reweighting Methods.
A Multicanonical Monte Carlo Study of the 3D ±J Spin Glass
14. TMMC, Flat-Histogram and Wang-Landau Method
Model systems with interaction
Monte Carlo Methods in Scientific Computing
Presentation transcript:

13. Extended Ensemble Methods

Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by the interface barrier where β=1/(k B T), σ is interface free energy, d is dimension, L is linear size

Multi-Canonical Ensemble We define multi-canonical ensemble as such that the (exact) energy histogram is a constant h(E) = n(E) f(E) = const This implies that the probability of configuration is P(X)  f ( E(X) )  1/n ( E(X) )

Multi-Canonical Simulation Do simulation with probability weight f n (E), using Metropolis algorithm acceptance rate min[1, f n (E’)/f n (E) ] Collection histogram H(E) Re-compute weight by f n+1 (E) = f n (E)/H(E) Iterate until H(E) is flat

Multi-Canonical Simulation and Reweighting Multicanonical histogram and reweighted canonical distribution for 2D 10-state Potts model From A B Berg and T Neuhaus, Phys Rev Lett 68 (1992) 9.

Simulated Tempering Simulated tempering treats parameters as dynamical variables, e.g., β jumps among a set of values β i. We enlarge sample space as {X, β i }, and make move {X,β i } -> {X’,β’ i } according to the usual Metropolis rate.

Probability Distribution Simulated tempering samples P(X,i)  exp ( -β i E(X) + F i ) Adjust F i so that p i = Σ X P(X,i) ≈ const F i is related to the free energy at temperature T i.

Temperature Jump Move We propose a move β i -> β i+1, fixing X Using Metropolis rate, we accept the move with probability min [ 1, exp ( -(β i+1 -β i )E(X) + (F i+1 -F i ) ) ]

Replica Monte Carlo A collection of M systems at different temperatures is simulated in parallel, allowing exchange of information among the systems. β1β1 β2β2 β3β3 βMβM...

Spin Glass Model A random interaction Ising model - two types of random, but fixed coupling constants (ferro J ij > 0) and (anti- ferro J ij < 0)

Moves between Replicas Consider two neighboring systems, σ 1 and σ 2, the joint distribution is P(σ 1,σ 2 )  exp [ -β 1 E(σ 1 ) –β 2 E(σ 2 ) ] = exp [ -H pair (σ 1, σ 2 ) ] Any valid Monte Carlo move should preserve this distribution

Pair Hamiltonian in Replica Monte Carlo We define  i =σ i 1 σ i 2, then H pair can be rewritten as The H pair again is a spin glass. If β 1 ≈β 2, and two systems have consistent signs, the interaction is twice as strong; if they have opposite sign, the interaction is small.

Cluster Flip in Replica Monte Carlo  = +1  = -1 Clusters are defined by the values of  i of same sign, The effective Hamiltonian for clusters is H cl = - Σ k bc s b s c Where k bc is the interaction strength between cluster b and c, k bc = sum over boundary of cluster b and c of K ij. b c Metropolis algorithm is used to flip the clusters, i.e., σ i 1 -> -σ i 1, σ i 2 -> -σ i 2 fixing  for all i in a given cluster.

Comparing Correlation Times Correlation times as a function of inverse temperature β on 2D, ±J Ising spin glass of 32x32 lattice. From R H Swendsen and J S Wang, Phys Rev Lett 57 (1986) Replica MC Single spin flip

2D Spin Glass Susceptibility 2D +/-J spin glass susceptibility on 128x128 lattice, 1.8x10 4 MC steps. From J S Wang and R H Swendsen, PRB 38 (1988)   K 5.11 was concluded.

Heat Capacity at Low T c  T 2 exp(-2J/T) This result is confirmed recently by Lukic et al, PRL 92 (2004) slope = -2

Replica Exchange (or Parallel Tempering) A simple move of exchange configuration (or equivalently temperature) with Metropolis acceptance rate σ 1 σ 2 The move is accepted with probability min { 1, exp [ (β 2 -β 1 ) ( E(σ 2 )-E(σ 1 ) )] }

Replica Exchange Spin-spin relaxation time for replica exchange MC on 12 3 lattice. From K Hukushima and K Nemoto, J Phys Soc Jpn, 65 (1996) 1604.