Boring (?) firstorder phase transitions


 Carol Webster
 1 years ago
 Views:
Transcription
1 Boring (?) firstorder phase transitions Des Johnston Edinburgh, June 2014 Johnston First Order 1/34
2 Plan of talk First and Second Order Transitions Finite size scaling (FSS) at first order transitions Nonstandard FSS Johnston First Order 2/34
3 First and Second Order Transitions (Ehrenfest) Firstorder phase transitions exhibit a discontinuity in the first derivative of the free energy with respect to some thermodynamic variable. Secondorder transitions are continuous in the first derivative but exhibit discontinuity in a second derivative of the free energy. Johnston First Order 3/34
4 First and Second Order Transitions ( modern ) Firstorder phase transitions are those that involve a latent heat. Secondorder transitions are also called continuous phase transitions. They are characterized by a divergent susceptibility, an infinite correlation length, and a powerlaw decay of correlations near criticality. Johnston First Order 4/34
5 First Order Transitions  Piccies First order  melting First order  field driven Johnston First Order 5/34
6 Second Order Transition H = ij σ i σ j ; Z(β) = {σ} exp( βh) Johnston First Order 6/34
7 First and Second Order Transitions  Piccies First order  discontinuities in magnetization, energy (latent heat) Second order  divergences in specific heat, susceptibility Johnston First Order 7/34
8 Looking at transitions Cook up a (lattice) model Identify order parameter, measure/calculate things Look for transition Continuous  extract critical exponents Finite Size Scaling (FSS) Johnston First Order 8/34
9 Define a model: qstate Potts Hamiltonian H q = ij δ σi,σ j Ising : H = σ i σ j ij Evaluate a partition function Z(β) = {σ} exp( βh q ) Derivatives of free energy give observables (energy, magnetization..) F (β) = ln Z(β) Johnston First Order 9/34
10 Measure 1001 Different Observables Order parameter M = (q max{n i } N)/(q 1) Persite quantities denoted by e = E/N and m = M/N u(β) = E /N, C(β) = β 2 N[ e 2 e 2 ], B(β) = [1 e4 3 e 2 2 ]. m(β) = m, χ(β) = β N[ m 2 m 2 ], U 2 (β) = [1 m2 3 m 2 ]. Johnston First Order 10/34
11 Continuous Transitions  Critical exponents (Continuous) Phase transitions characterized by critical exponents Define t = T T c /T c Then in general, ξ t ν, M t β, C t α, χ t γ Can be rephrased in terms of the linear size of a system L or N 1/d ξ N 1/d, M N β/νd, C N α/νd, χ N γ/νd Johnston First Order 11/34
12 Scaling Another exponent... ψ(0)ψ(r) r d+2 η Scaling relations α = 2 νd ; α + 2β + γ = 2 Two independent exponents Johnston First Order 12/34
13 Now, first order... Formally νd = 1, α = 1 i.e. Volume scaling C N ; ξ N Squeezing a delta function onto a lattice Johnston First Order 13/34
14 What does a first order system look like (at PT) I? Johnston First Order 14/34
15 What does a first order system look like (at PT) II? E Hysteresis COLD HOT β Johnston First Order 15/34
16 What does a first order system look like (at PT) III? Phase coexistence P(E) e05 1e06 1e E Johnston First Order 16/34
17 Heuristic twophase model A fraction W o in q ordered phase(s), energy ê o A fraction W d = 1 W o in disordered phase, energy ê d The hat = quantities evaluated at β Neglect fluctuations within the phases Johnston First Order 17/34
18 Energy moments Energy moments become e n = W o ê n o + (1 W o )ê n d And the specific heat then reads: C V (β, L) = L d β 2 ( e 2 e 2) = L d β 2 W o (1 W o ) ê 2 Max of C max V = L d (β ê/2) 2 at W o = W d = 0.5 Volume scaling Johnston First Order 18/34
19 FSS: Specific Heat Probability of being in any of the states p o e βld ˆf o and p d e βld ˆf d Time spent in the ordered states qp o Expand around β Solve for specific heat peak W o /W d qe Ld β ˆf o /e βld ˆf d 0 = ln q + L d ê(β β ) +... β Cmax V (L) = β ln q L d ê +... Johnston First Order 19/34
20 FSS: Binder Cumulant Energetic Binder cumulant Use (again) B(β, L) = 1 e4 3 e 2 2 e n = W o ê n o + (1 W o )ê n d to get location of min: β Bmin (L) β Bmin (L) = β ln(qê2 o/ê 2 d ) L d ê L d FSS Johnston First Order 20/34
21 An Aside You can do this more carefully PirogovSinai Theory (Borgs/Kotecký) Z(β) = ] [ ] [e βld f d + qe βld f o 1 + O(L d e L/L 0 ) Z(β) 2 ( qe βld (f d +f 0 βl )/2 d (f d f 0 ) cosh + 1 ) 2 2 ln q x = βld (f d f 0 ) ln q Ld ê(β β ) ln q +... Johnston First Order 21/34
22 A Bit Dull... Peaks grow like L d = V = N Critical temperatures shift like 1/L d No other numbers (?) Johnston First Order 22/34
23 Some other numbers  Fixed BC Fixed boundary conditions Z(β) = [ e β(ld f d +2dL d 1 f d ) + qe β(ld f o+2dl d 1 f o) ] [1 +...] x = Ld (f d f 0 ) + dl d 1 ( 2 f d f 0 ) ln q al d (β β ) + bl d (since f d = a 1 + ẽ d (β β ) +..., fo = a 2 + ẽ o (β β ) +...) β 1 L It is clear that there can now be O(1/L) corrections Johnston First Order 23/34
24 Fitting the data  8state Potts Estimated from peak in χ: β c (L) = β + a L +... Johnston First Order 24/34
25 Some other numbers  degeneracy A 3D plaquette Ising model Its dual A big critical temperature discrepancy (30σ) Johnston First Order 25/34
26 A 3D Plaquette Ising action 3D cubic, spins on vertices H = 1 σ i σ j σ k σ l 2 [i,j,k,l] NOT H = U ij U jk U kl U li, U ij = ±1 Z 2 Lattice Gauge [i,j,k,l] Johnston First Order 26/34
27 And the dual An anisotropically coupled AshkinTeller model H dual = 1 σ i σ j 1 τ i τ j 1 σ i σ j τ i τ j, ij x ij y ij z Johnston First Order 27/34
28 The Problem Original model: L = 8, 9,..., 26, 27, periodic bc, 1/L d fits β = (30) Dual model: L = 8, 10,..., 22, 24, periodic bc, 1/L d fits βdual = (19) β = (11) Estimates are about 30 error bars apart. Johnston First Order 28/34
29 A Solution... Degeneracy Modified FSS Johnston First Order 29/34
30 Groundstates: Plaquette Persists into low temperature phase: degeneracy 2 3L Johnston First Order 30/34
31 Ground state Johnston First Order 31/34
32 1st Order FSS with Exponential Degeneracy Normally q is constant Suppose instead q e L β Cmax V (L) = β ln q L d ê +... become β Bmin (L) = β ln(qê2 o/ê 2 d ) L d ê +... β Cmax V (L) = β 1 L d 1 ê +... β Bmin (L) = β ln(ê2 o/ê 2 d ) L d 1 ê +... Johnston First Order 32/34
33 Conclusions Standard 1st order FSS: 1/L 3 corrections in 3D Fixed BC: 1/L (surface tension) Exponential degeneracy: 1/L 2 in 3D Further applications may be higherdimensional variants of the gonihedric model, ANNNI models, spin ice systems, orbital compass models,... Johnston First Order 33/34
34 References K. Binder, Rep. Prog. Phys. 50, 783 (1987) C. Borgs and R. Kotecký, Phys. Rev. Lett. 68, 1734 (1992) W. Janke, Phys. Rev. B 47, (1993) M. Mueller, W. Janke and D. A. Johnston, Phys. Rev. Lett. 112, (2014) Johnston First Order 34/34
1 OneDimensional Magnetism
1 OneDimensional Magnetism HansJürgen Mikeska 1 and Alexei K. Kolezhuk 1,2 1 Institut für Theoretische Physik, Universität Hannover, Appelstaße 2, 30167 Hannover, Germany, mikeska@itp.unihannover.de
More informationOrdering, metastability and phase transitions in twodimensional systems
J. Phys. C: Solid State Phys., Vol. 6, 1973. Erinted in Great Britain. @ 1973 Ordering, metastability and phase transitions in twodimensional systems J M Kosterlit7 and D J Thouless Department of Mathematical
More informationSpaceTime Approach to NonRelativistic Quantum Mechanics
R. P. Feynman, Rev. of Mod. Phys., 20, 367 1948 SpaceTime Approach to NonRelativistic Quantum Mechanics R.P. Feynman Cornell University, Ithaca, New York Reprinted in Quantum Electrodynamics, edited
More informationUnsupervised Spike Detection and Sorting with Wavelets and Superparamagnetic Clustering
LETTER Communicated by Maneesh Sahani Unsupervised Spike Detection and Sorting with Wavelets and Superparamagnetic Clustering R. Quian Quiroga rodri@vis.caltech.edu Z. Nadasdy zoltan@vis.caltech.edu Division
More informationScience, New Series, Vol. 220, No. 4598. (May 13, 1983), pp. 671680.
Optimization by Simulated Annealing S. Kirkpatrick; C. D. Gelatt; M. P. Vecchi Science, New Series, Vol. 220, No. 4598. (May 13, 1983), pp. 671680. Stable URL: http://links.jstor.org/sici?sici=00368075%2819830513%293%3a220%3a4598%3c671%3aobsa%3e2.0.co%3b28
More informationThere is no such thing as heat energy
There is no such thing as heat energy We have used heat only for the energy transferred between the objects at different temperatures, and thermal energy to describe the energy content of the objects.
More informationON THE DISTRIBUTION OF SPACINGS BETWEEN ZEROS OF THE ZETA FUNCTION. A. M. Odlyzko AT&T Bell Laboratories Murray Hill, New Jersey ABSTRACT
ON THE DISTRIBUTION OF SPACINGS BETWEEN ZEROS OF THE ZETA FUNCTION A. M. Odlyzko AT&T Bell Laboratories Murray Hill, New Jersey ABSTRACT A numerical study of the distribution of spacings between zeros
More informationInterfacial conditions between a pure fluid and a porous medium: implications for binary alloy solidification
J. Fluid Mech. (26), vol. 55, pp. 149 173. c 26 Cambridge University Press doi:1.117/s2211257998 Printed in the United Kingdom 149 Interfacial conditions between a pure fluid and a porous medium: implications
More informationThe Backpropagation Algorithm
7 The Backpropagation Algorithm 7. Learning as gradient descent We saw in the last chapter that multilayered networks are capable of computing a wider range of Boolean functions than networks with a single
More informationManipulating atoms with photons*
Manipulating atoms with photons* Claude N. CohenTannoudji Collège de France et Laboratoire Kastler Brossel de l Ecole Normale Supérieure, 75231 Paris Cedex 05, France [S00346861(98)011039] Electromagnetic
More informationRevisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations
Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations Melanie Mitchell 1, Peter T. Hraber 1, and James P. Crutchfield 2 In Complex Systems, 7:8913, 1993 Abstract We present
More informationUnderstanding the FiniteDifference TimeDomain Method. John B. Schneider
Understanding the FiniteDifference TimeDomain Method John B. Schneider June, 015 ii Contents 1 Numeric Artifacts 7 1.1 Introduction...................................... 7 1. Finite Precision....................................
More informationMEP Y9 Practice Book A
1 Base Arithmetic 1.1 Binary Numbers We normally work with numbers in base 10. In this section we consider numbers in base 2, often called binary numbers. In base 10 we use the digits 0, 1, 2, 3, 4, 5,
More informationErgodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains
Ergodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains Peter Balint 1, Kevin K. Lin 2, and LaiSang Young 3 Abstract. We consider systems of moving particles in 1dimensional
More informationTwolevel states in glasses
Rep. Prog. Phys. 50 (1987) 16571708. Printed in the UK Twolevel states in glasses W A Phillips Cavendish Laboratory, University of Cambridge, Madingley Road, Cambridge CB3 OHE, UK Abstract This review
More informationWHICH SCORING RULE MAXIMIZES CONDORCET EFFICIENCY? 1. Introduction
WHICH SCORING RULE MAXIMIZES CONDORCET EFFICIENCY? DAVIDE P. CERVONE, WILLIAM V. GEHRLEIN, AND WILLIAM S. ZWICKER Abstract. Consider an election in which each of the n voters casts a vote consisting of
More informationAcidbase Chemistry of Aquatic Systems
i Acidbase Chemistry of Aquatic Systems An introduction to the chemistry of acidbase equilibria with emphasis on the carbon dioxide system in natural waters eith A. Hunter Professor in Chemistry Department
More informationThere s more to volatility than volume
There s more to volatility than volume László Gillemot, 1, 2 J. Doyne Farmer, 1 and Fabrizio Lillo 1, 3 1 Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501 2 Budapest University of Technology
More informationThe SmallWorld Phenomenon: An Algorithmic Perspective
The SmallWorld Phenomenon: An Algorithmic Perspective Jon Kleinberg Abstract Long a matter of folklore, the smallworld phenomenon the principle that we are all linked by short chains of acquaintances
More informationSteering User Behavior with Badges
Steering User Behavior with Badges Ashton Anderson Daniel Huttenlocher Jon Kleinberg Jure Leskovec Stanford University Cornell University Cornell University Stanford University ashton@cs.stanford.edu {dph,
More informationWhen Is Nearest Neighbor Meaningful?
When Is Nearest Neighbor Meaningful? Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft CS Dept., University of WisconsinMadison 1210 W. Dayton St., Madison, WI 53706 {beyer, jgoldst,
More informationRandom matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs
Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs Jeong Han Kim Microsoft Research One Microsoft Way Redmond, WA 9805 USA jehkim@microsoft.com Nicholas
More informationThe Capital Asset Pricing Model: Some Empirical Tests
The Capital Asset Pricing Model: Some Empirical Tests Fischer Black* Deceased Michael C. Jensen Harvard Business School MJensen@hbs.edu and Myron Scholes Stanford University  Graduate School of Business
More informationFast Solution of l 1 norm Minimization Problems When the Solution May be Sparse
Fast Solution of l 1 norm Minimization Problems When the Solution May be Sparse David L. Donoho and Yaakov Tsaig October 6 Abstract The minimum l 1 norm solution to an underdetermined system of linear
More informationOn Graphite Transformations at High Temperature and Pressure Induced by Absorption of the LHC Beam
LHC Project Note 78 / 97 January 18, 1997 zazula@mail.cern.ch On Graphite Transformations at High Temperature and Pressure Induced by Absorption of the LHC Beam Jan M. Zazula CERNSL/BT(TA) Keywords: Summary
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 4, APRIL 2006 1289. Compressed Sensing. David L. Donoho, Member, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 4, APRIL 2006 1289 Compressed Sensing David L. Donoho, Member, IEEE Abstract Suppose is an unknown vector in (a digital image or signal); we plan to
More informationAn Impossibility Theorem for Clustering
An Impossibility Theorem for Clustering Jon Kleinberg Department of Computer Science Cornell University Ithaca NY 14853 Abstract Although the study of clustering is centered around an intuitively compelling
More informationDecoding by Linear Programming
Decoding by Linear Programming Emmanuel Candes and Terence Tao Applied and Computational Mathematics, Caltech, Pasadena, CA 91125 Department of Mathematics, University of California, Los Angeles, CA 90095
More informationIntroduction to. Hypothesis Testing CHAPTER LEARNING OBJECTIVES. 1 Identify the four steps of hypothesis testing.
Introduction to Hypothesis Testing CHAPTER 8 LEARNING OBJECTIVES After reading this chapter, you should be able to: 1 Identify the four steps of hypothesis testing. 2 Define null hypothesis, alternative
More informationFoundations of Data Science 1
Foundations of Data Science John Hopcroft Ravindran Kannan Version /4/204 These notes are a first draft of a book being written by Hopcroft and Kannan and in many places are incomplete. However, the notes
More information