Presented by Rhee, Je-Keun

Slides:



Advertisements
Similar presentations
Review Of Statistical Mechanics
Advertisements

Molecular Dynamics at Constant Temperature and Pressure Section 6.7 in M.M.
Monte Carlo Methods and Statistical Physics
Introduction to Molecular Orbitals
Contextual Classification by Melanie Ganz Lecture 6, Medical Image Analysis 2008.
The Potts and Ising Models of Statistical Mechanics.
Image Segmentation Using Physical Models Yuliya Kopylova CS 867 Computer Vision.
Monte Carlo Simulation of Ising Model and Phase Transition Studies
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
1 IE 607 Heuristic Optimization Simulated Annealing.
Physics Fluctuomatics / Applied Stochastic Process (Tohoku University) 1 Physical Fluctuomatics Applied Stochastic Process 7th “More is different” and.
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 7th~10th Belief propagation Appendix Kazuyuki Tanaka Graduate School of Information.
Lecture 11: Ising model Outline: equilibrium theory d = 1
Summary: Isolated Systems, Temperature, Free Energy Zhiyan Wei ES 241: Advanced Elasticity 5/20/2009.
MonteCarlo Optimization (Simulated Annealing) Mathematical Biology Lecture 6 James A. Glazier.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
1 CE 530 Molecular Simulation Lecture 6 David A. Kofke Department of Chemical Engineering SUNY Buffalo
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
Two Temperature Non-equilibrium Ising Model in 1D Nick Borchers.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
Chapter 7 Energy of a System.
Animating Tessellations of the Plane with Statistic Models Ben McCabe Advisor: Rolfe Petschek Department of Physics, Case Western Reserve University Artists,
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
ChE 452 Lecture 17 Review Of Statistical Mechanics 1.
Javier Junquera Introduction to atomistic simulation methods in condensed matter Alberto García Pablo Ordejón.
Graduate School of Information Sciences, Tohoku University
Assignment for the course: “Introduction to Statistical Thermodynamics of Soft and Biological Matter” Dima Lukatsky In the first.
From J.R. Waldram “The Theory of Thermodynamics”.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.
Statistical Mechanics and Multi-Scale Simulation Methods ChBE
Eutectic Phase Diagram NOTE: at a given overall composition (say: X), both the relative amounts.
Ch 6. Markov Random Fields 6.1 ~ 6.3 Adaptive Cooperative Systems, Martin Beckerman, Summarized by H.-W. Lim Biointelligence Laboratory, Seoul National.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
1 (c) SNU CSE Biointelligence Lab, Chap 3.8 – 3.10 Joon Shik Kim BI study group.
Ch 2. THERMODYNAMICS, STATISTICAL MECHANICS, AND METROPOLIS ALGORITHMS 2.6 ~ 2.8 Adaptive Cooperative Systems, Martin Beckerman, Summarized by J.-W.
Monte Carlo Simulation of the Ising Model Consider a system of N classical spins which can be either up or down. The total.
Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009 Intoduction to topological order and topologial quantum computation.
The Monte Carlo Method/ Markov Chains/ Metropolitan Algorithm from sec in “Adaptive Cooperative Systems” -summarized by Jinsan Yang.
The Quantum Mechanical Picture of the Atom
Biointelligence Laboratory, Seoul National University
Biointelligence Laboratory, Seoul National University
Applications of the Canonical Ensemble: Simple Models of Paramagnetism
Simulated Annealing Chapter
Computational Physics (Lecture 10)
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Van Laarhoven, Aarts Version 1, October 2000
LAWS OF THERMODYNAMICS
Boltzmann statistics Reservoir R U0 -  Combined system U0 = const
Applications of the Canonical Ensemble:
Ising Model of a Ferromagnet
Presented by Rhee, Je-Keun
In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok
Presented by Rhee, Je-Keun
Ferromagnetism.
Biointelligence Laboratory, Seoul National University
Introduction to Simulated Annealing
(c) SNU CSE Biointelligence Lab,
Biointelligence Laboratory, Seoul National University
Adaptive Cooperative Systems Chapter 6 Markov Random Fields
Lattice gas with interactions
Common Types of Simulations
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
Ch 3. Linear Models for Regression (2/2) Pattern Recognition and Machine Learning, C. M. Bishop, Previously summarized by Yung-Kyun Noh Updated.
Chapter 7: Covalent Bonds and Molecular Structure
Copyright©2000 by Houghton Mifflin Company. All rights reserved.
Biointelligence Laboratory, Seoul National University
Chapter 4 Earth Chemistry.
Thermodynamics and Statistical Physics
Presentation transcript:

Presented by Rhee, Je-Keun Ch 4. Simulated Annealing 4.1 ~ 4.4 Adaptive Cooperative Systems, Martin Beckerman, 1997. Presented by Rhee, Je-Keun

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Contents 4.1 Introduction 4.1.1 Energy Landscapes 4.1.2 Multiple Constraints and Selectivity 4.1.3. Searching for Optimal Solutions 4.2 Objectives 4.3 Kinetic Ising Model 4.3.1 The Master Equation 4.3.2 Spin Kinetics 4.4 Order-Disorder Transitions in Binary Alloys 4.4.1 Order-Disorder Transitions 4.4.2 Particle Kinetics and Binary Alloys (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Energy Landscapes The spontaneous magnetization of two-dimensional Ising ferromagnet can be either positive or negative. At temperature below the Curie point, there are two minima in the free energy, corresponding to positive or negative ordering. The energy landscape for a ferromagnet changes dramatically if we allow the sign of the coupling constants Jij to vary in a random way from site to site. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Multiple Constraints and Selectivity In the traveling salesman, graph partitioning and other NP-hard problems, competing constraints, frustration, and a multiplicity of local energy minima are essential features. The structure of these problems bears a great similarity to the statistical mechanics description of a dilute disordered magnet known as a spin glass. The multiple constraints can be appeared in image processing problems. The digital images can be regarded as highly organized spatial lattice systems, and it is examined by modeling as Markov random fields in Chapter 6. Those problems involved in the self-organization of the central nervous system. In the next chapter we will explore an equally dramatic set of findings regarding developmental and functional plasticity in the retinotectal projection of lover vertebrates, and in Chapter 9 we well look at the dynamic modulation of neural firing states. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Searching for Optimal solutions The search for optimal solutions – that is, for highly ordered, low-energy, stable states – is a particularly difficult one in systems possessing many local minima. The necessary clues for developing strategies for finding optimal solution Low-energy, stable states stand out at low temperatures, whereas they are buried among the multitude of disordered states at high temperatures. The fluctuations are a useful mechanism, in that they allow a system to probe its surrounding solution space for better energy configurations. The difficulties in obtaining exact, analytic solutions to nearest-neighbor models of lattice cooperativity can be alleviated using the Monte Carlo importance sampling method such as Metropolis algorithm. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Objectives The first sampling method is the Glauber heat bath algorithm used in conjunction with the kinetic Ising model. (Section 4.3) The second set of alternative procedures is related to the treatment of binary alloys. (Section 4.4) Spin glasses and the general problems encountered in treating systems with frozen-in, or quenched, disorder helped inspire the development of the simulated annealing method. (Section 4.5) A brief overview of the world of NP-completeness (Section 4.6) The simulated annealing algorithms (Section 4.7, 4.8) The microcanonical annealing approach (Section 4.9) The continuous simulated annealing method (Section 4.10) (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Kinetic Ising Model Two classes of kinetic Ising models Due to Glauber, spins may randomly flip from one state to the other. In the spin model neither the total energy nor the magnetization is conserved. Molecules may exchange positions with one another or migrate to empty lattice sites. Particle (molecule) number, the analog of magnetization, is conserved in these kinetic processes. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ The Master Equation Consider a lattice system in which a lattice variable x may assume one of a number of values at each of the i=1,…,N lattice sites. w({x},t) denote the probability that a system has assumed a particular configuration {x}=(x1,…,.xN) at time t. p(a,b) is the transition probability from state a to state b. At equilibrium the time derivative is zero (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Spin Kinetics Consider a simple case where the variable for a single lattice site j may change its state. We regard the lattice variables as spin elements whose interaction are given by an Ising hamilonian. This results is sometimes called the heat bath algorithm, and for the one-dimensional case, it is known as Glauber dynamics. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

An algorithm simulating an Ising spin system Initialize by arranging spins into the lattice in an ordered arrangement, in a completely disordered arrangement, or randomly. Select a lattice site Calculate the transition probability corresponding to flipping the spin Choose a random number. If it is less than the transition probability, flip the spin; otherwise, do not flip the spin. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Order-Disorder Transitions Beta brass is an alloy composed of copper and zinc in equal amounts and arranged into a body-centered cubic lattice. In the completely ordered state, all copper atoms are nearest neighbors of zinc atoms, and vice versa. As the temperature increases, the probability for finding the correct neighbor decreases toward ½, and at temperature above the critical temperature, copper and zinc placements on the lattice are completely random. There are two types of ordered states in the binary alloys. The lattice ordering described above resembles an antiferromagnetic domain, and it arise when the interaction between the two kinds of atoms is attractive. If the interaction is repulsive, or alternatively if one introduces an attraction between like atoms, a different kind of ordering, that of a two-phase system, is produced. In an phase-separated system, there are regions where atoms of one type only are found. Thus phase separation is analogous to ferromagnetism. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Particle Kinetics and Binary Alloys Consider a system composed of two different kinds of atoms, called A and B, arranged in a regular lattice. For the nearest neighbors the interaction energies , and are introduced, and similarly for second nearest neighbors , and are had. Let us form the quantities We now generate configurations by interchanging pairs of nearest-neighbor atoms, A on lattice site S and B on site S’. The energy difference N are the numbers of first nearest-neighbor B atoms of S and S’, respectively, before the interchange, and similarly for N. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Metropolis algorithm simulating the kinetics of a binary alloy Initialize by arranging A and B atoms into the lattice in an ordered arrangement, in a completely disordered arrangement, of randomly. Select a central lattice site at random Select one of the 12 nearest-neighbor sites at random If the nearest-neighbor atom selected differs from the central atom, calculate the energy change resulting from an exchange of atoms; if negative, exchange particles; if positive, calculate the probability; select a random number – if less than the probability, switch particles; otherwise, do not exchange particles, but count as a new configuration. If the atoms are identical, do not exchange, but count as a new configuration. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/