1 Series Expansion in Nonequilibrium Statistical Mechanics Jian-Sheng Wang Dept of Computational Science, National University of Singapore.

Slides:



Advertisements
Similar presentations
Youjin Deng Univ. of Sci. & Tech. of China (USTC) Adjunct: Umass, Amherst Diagrammatic Monte Carlo Method for the Fermi Hubbard Model Boris Svistunov UMass.
Advertisements

Modern Monte Carlo Methods: (2) Histogram Reweighting (3) Transition Matrix Monte Carlo Jian-Sheng Wang National University of Singapore.
2D and time dependent DMRG
Yu Nakayama (Kavli IPMU, Caltech)
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.
Lattice regularized diffusion Monte Carlo
Neural Networks Marco Loog.
Class notes for ISE 201 San Jose State University
Localized Perturbations of Integrable Billiards Saar Rahav Technion, Haifa, May 2004.
Dissipation of Alfvén Waves in Coronal Structures Coronal Heating Problem T corona ~10 6 K M.F. De Franceschis, F. Malara, P. Veltri Dipartimento di Fisica.
Principles of the Global Positioning System Lecture 10 Prof. Thomas Herring Room A;
Absolute error. absolute function absolute value.
Presentation in course Advanced Solid State Physics By Michael Heß
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
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.
Census A survey to collect data on the entire population.   Data The facts and figures collected, analyzed, and summarized for presentation and.
Chapter 9 Numerical Integration Flow Charts, Loop Structures Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 11: Ising model Outline: equilibrium theory d = 1
Outline Review of extended ensemble methods (multi-canonical, Wang-Landau, flat-histogram, simulated tempering) Replica MC Connection to parallel tempering.
Classical Antiferromagnets On The Pyrochlore Lattice S. L. Sondhi (Princeton) with R. Moessner, S. Isakov, K. Raman, K. Gregor [1] R. Moessner and S. L.
Chapter 12 Chemical Kinetics. Chapter 12 Table of Contents Copyright © Cengage Learning. All rights reserved Reaction Rates 12.2 Rate Laws: An.
Edge Linking & Boundary Detection
Universal Behavior of Critical Dynamics far from Equilibrium Bo ZHENG Physics Department, Zhejiang University P. R. China.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
9. Convergence and Monte Carlo Errors. Measuring Convergence to Equilibrium Variation distance where P 1 and P 2 are two probability distributions, A.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 3.1 Mathematical Foundation.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Nonequilibrium Green’s Function and Quantum Master Equation Approach to Transport Wang Jian-Sheng 1.
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo Performance & Stability Analysis.
1 Heat Conduction in One- Dimensional Systems: molecular dynamics and mode-coupling theory Jian-Sheng Wang National University of Singapore.
Mixture Models, Monte Carlo, Bayesian Updating and Dynamic Models Mike West Computing Science and Statistics, Vol. 24, pp , 1993.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
4. Numerical Integration. Standard Quadrature We can find numerical value of a definite integral by the definition: where points x i are uniformly spaced.
Outline 1.Critical short-time dynamics ― hot start & cold start ― 2. Application to lattice gauge theory ― extract critical exponents ― 3. Summary Short-Time.
1 Cluster Monte Carlo Algorithms: Jian-Sheng Wang National University of Singapore.
Austin Howard & Chris Wohlgamuth April 28, 2009 This presentation is available at
ChE 553 Lecture 9 Statistical Mechanics Of Adsorption 1.
13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Interacting Molecules in a Dense Fluid
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
1 The phonon Hall effect – NEGF and Green- Kubo treatments Jian-Sheng Wang, National University of Singapore.
CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov
Network Science K. Borner A.Vespignani S. Wasserman.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Fracture Toughness of Metallic Glasses: A Ductile-to-Brittle Transition? Eran Bouchbinder Weizmann Institute of Science Work with Chris H. Rycroft University.
Random Sampling Algorithms with Applications Kyomin Jung KAIST Aug ERC Workshop.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Nonequilibrium Green’s Function Method for Thermal Transport Jian-Sheng Wang.
Exact vector channel sum rules at finite temperature Talk at the ECT* workshop “Advances in transport and response properties of strongly interacting systems”
Fluctuation relations in Ising models G.G. & Antonio Piscitelli (Bari) Federico Corberi (Salerno) Alessandro Pelizzola (Torino) TexPoint fonts used in.
New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y
Computational Physics (Lecture 10)
4. Numerical Integration
Monte Carlo methods 10/20/11.
Special Topics In Scientific Computing
Intermittency and clustering in a system of self-driven particles
Statistical Methods For Engineers
National University of Singapore
14. TMMC, Flat-Histogram and Wang-Landau Method
Bin Fu Department of Computer Science
Filtering and State Estimation: Basic Concepts
DIAGRAMMATIC MONTE CARLO:
Exact vector channel sum rules at finite temperature
(ITEP, Moscow and JINR, Dubna)
Biointelligence Laboratory, Seoul National University
Outline Texture modeling - continued Markov Random Field models
Presentation transcript:

1 Series Expansion in Nonequilibrium Statistical Mechanics Jian-Sheng Wang Dept of Computational Science, National University of Singapore

2 Outline Introduction to Random Sequential Adsorption (RSA) and series expansion Ising relaxation dynamics and series expansion Padé analysis

3 Random Sequential Adsorption For review, see J S Wang, Colloids and Surfaces, 165 (2000) 325.

4 The Coverage Disk in d-dimension:  (t) =  (  ) – a t -1/d Lattice models  (t) =  (  ) – a exp(-b t) Problems: (1) determine accurately the function  (t), in particular the jamming coverage  (  ); (2) determine t ->  asymptotic law

5 1D Dimer Model P n (t) is the probability that n consecutive sites are empty.

6 Rate Equations Where G is some graph formed by a set of empty sites.

7 Series Expansion, 1D Dimer

8 Nearest Neighbor Exclusion Model

9 Computerized Series Expansion RSA(G,n) { S(n) += |G|; if(n > N max ) return; for each (x in G) { RSA(G U D(x), n +1); } // G is a set of sites, // x is an element in G, // D(x) is a set consisting // of x and 4 neighbor // sites. |…| stands for // cardinality, U for // union.

10 RSA of disk For continuum disk, the results can be generalized for the coefficients of a series expansion: where D(x 0 ) is a unit circle centered at (0,0), D(x 0,x 1 ) is the union of circles centered at x 0 and x 1, etc.

11 Diagrammatic Rule for RSA of disk A sum of all n-point connected graphs. Each graph represents an integral, in which each node (point) represents an integral variable, each link (line) represents f(x,y)=-1 if |x-y|<1, and 0 otherwise. This is similar to Mayer expansion.

12 Density Expansion Where  = d  /dt is rate of adsorption. The graphs involve only star graphs. From J A Given, Phys Rev A, 45 (1992) 816.

13 Symmetry Number and Star Graph A point must connect to a point with label smaller than itself. A is called an articulation point. Removal of point A breaks the graph into two subgraphs. A star graph (doubly connected graph) does not have articulation point.

14 Mayer Expansion vs RSA

15 Series Results, 2D disk

16 Series Analysis Transform variable t into a form that reflects better the asymptotic behavior: e.g: y=1-exp(-b(1-e -t )) for lattice models y=1-(1+bt) -1/2 for 2D disk Form Padé approximants in y.

17 Padé Approximation Where P N and Q D are polynomials of order N and D, respectively.

18 RSA nearest neighbor exclusion model Direct time series to 19, 20, and 21 order, and Padé approximant in variable y with b=1.05.  (  ) from Padé analysis is (1), from Monte Carlo is (1). ()()

19 Padé Analysis of Oriented Squares The [N,D] Padé results of  (  ) vs the adjustable parameter b. Best estimate is b=1.3 when most Padé approximants converge to the same value

Estimates of the Jamming Coverage Modeln max SeriesMC NN (1) A (1) E Dimer (2) A (2) F NN (honeycomb) (1) A 0.38(1) G Dimer (honeycomb) (1) A H NNN (2) B (3) I Hard disk C (7) J Oriented squares (4) D (4) K A: Gan & Wang, JCP 108 (1998) B: Baram & Fixman, JCP, 103 (1995) C: Dickman, Wang, Jensen, JCP 94 (1991) D: Wang, Col & Surf 165 (2000) 325. E: Meakin, et al, JCP 86 (1987) F: Wang & Pandey, PRL 77 (1996) G: Widom, JCP, 44 (1966) H: Nord & Evans, JCP, 82 (1985) I: Privman, Wang, Nielaba, PRB 43 (1991) J: Wang, IJMP C5 (1994) 707. K: Brosilow, Ziff, Vigil, PRA 43 (1991) 631.

21 Ising Relaxation towards Equilibrium Time t Magnetization m T < T c T = T c T > T c Schematic curves of relaxation of the total magnetization as a function of time. At T c relaxation is slow, described by power law: m  t -β/(zν)

22 Basic Equation for Ising Dynamics ( continuous time ) where  is a linear operator in configuration space . For Glauber flip rate, we can write

23 General Rate Equation in Ising Dynamics

24 The Magnetization Series at T c Energy series is also obtained.

25 Ising Dynamics Padé Plot Best z estimate is from  where most curves intersect. From J-S Wang & Gan, PRE, 57 (1998) 6548.

26 Effective Dynamical Exponent z [6,6] Padé MC Extrapolating to t -> , we found z =  0.003, consistent with Padé result.

27 Summary Series for Random Sequential Adsorption and Ising dynamics are obtained. Using Padé analysis, the results are typically more accurate than Monte Carlo results.