DIAGRAMMATIC MONTE CARLO:

Slides:



Advertisements
Similar presentations
The Quantum Mechanics of Simple Systems
Advertisements

Postulates of Quantum Mechanics. The Fundamental Rules of Our Game Any measurement we can make with an experiment corresponds to a mathematical “operator”
Youjin Deng Univ. of Sci. & Tech. of China (USTC) Adjunct: Umass, Amherst Diagrammatic Monte Carlo Method for the Fermi Hubbard Model Boris Svistunov UMass.
INT, 05/18/2011 MC sampling of skeleton Feynman diagrams: Road to solution for interacting fermions/spins? Nikolay Prokofiev, Umass, Amherst Boris Svistunov.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Lecture 3: Markov processes, master equation
Bayesian statistics – MCMC techniques
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 CE 530 Molecular Simulation Lecture 8 Markov Processes David A. Kofke Department of Chemical Engineering SUNY Buffalo
Nikolay Prokofiev, Umass, Amherst work done in collaboration with PITP, Dec. 4, 2009 DIAGRAMMATIC MONTE CARLO FOR CORRELATED FERMIONS Boris Svistunov UMass.
DIAGRAMMATIC MONTE CARLO: From polarons to path-integrals (with worm, of course) Les Houches, June 2006, Lecture 2 Nikolay Prokofiev, Umass, Amherst Boris.
Monte Carlo Methods in Partial Differential Equations.
PHYS 3313 – Section 001 Lecture #17
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
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Computational Solid State Physics 計算物性学特論 第9回 9. Transport properties I: Diffusive transport.
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.
1 Physical Chemistry III Molecular Simulations Piti Treesukol Chemistry Department Faculty of Liberal Arts and Science Kasetsart University :
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
 1  Outline  stages and topics in simulation  generation of random variates.
Introduction to Monte Carlo Simulation. What is a Monte Carlo simulation? In a Monte Carlo simulation we attempt to follow the `time dependence’ of a.
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
Ch 9 pages Lecture 23 – The Hydrogen Atom.
Lecture 19: Free Energies in Modern Computational Statistical Thermodynamics: WHAM and Related Methods Dr. Ronald M. Levy Statistical.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
Monte Carlo Methods in Statistical Mechanics Aziz Abdellahi CEDER group Materials Basics Lecture : 08/18/
Quantization via Fractional Revivals Quantum Optics II Cozumel, December, 2004 Carlos Stroud, University of Rochester Collaborators:
In the Hamiltonian Formulation, the generalized coordinate q k & the generalized momentum p k are called Canonically Conjugate quantities. Hamilton’s.
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
Lesson 4: Computer method overview
Chapter 11 Angular Momentum. Angular momentum plays a key role in rotational dynamics. There is a principle of conservation of angular momentum.  In.
Path Integral Quantum Monte Carlo Consider a harmonic oscillator potential a classical particle moves back and forth periodically in such a potential x(t)=
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Monte Carlo in different ensembles Chapter 5
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Random Sampling Algorithms with Applications Kyomin Jung KAIST Aug ERC Workshop.
CWR 6536 Stochastic Subsurface Hydrology Optimal Estimation of Hydrologic Parameters.
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.
Virtual University of Pakistan
CHEM-E7130 Process Modeling Lecture 6
Monte Carlo: A Simple Simulator’s View
Chapter 41 Atomic Structure
Concept test 15.1 Suppose at time
CHAPTER 5 The Schrodinger Eqn.
Markov chain monte carlo
Announcements Exam Details: Today: Problems 6.6, 6.7
CHAPTER 5 The Schrodinger Eqn.
Quantum One.
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
14. TMMC, Flat-Histogram and Wang-Landau Method
Concept test 15.1 Suppose at time
2. Solving Schrödinger’s Equation
Quantum One.
Chapter 41 Atomic Structure
Slides for Sampling from Posterior of Shape
(ITEP, Moscow and JINR, Dubna)
Opinionated Lessons #39 MCMC and Gibbs Sampling in Statistics
PHYS 3313 – Section 001 Lecture #19
Lesson 9: Basic Monte Carlo integration
Lesson 4: Application to transport distributions
PHYS 3313 – Section 001 Lecture #18
Presentation transcript:

DIAGRAMMATIC MONTE CARLO: N. Prokof’ev Advancing Research in Basic Science and Mathematics Kourovka 2018

Diagrammatic Monte Carlo (Diag.MC) Unbiased sampling of configuration space with varying number of continuous variables path integrals impurity solvers & continuous-time methods Feynman diagrammatic expansions just any sum of multi-dimensional integrals Frochlich polaron case in practice (with all algorithmic details)

MC approach in one slide: Configuration weight quantity of interest Multi-dimensional sum/integral (label all possible states=configuration space) Average over configurations generated with probability density How general? or go fancy For arbitrary functions F, G, and W > 0 Ignore sign for the moment (efficiency, not principle issue)

Single-spin flip algorithm The most familiar example – Ising model ; configuration space , and MC Markov-chain cycle: Contribute suggest an update Accept with probability Config. Select at random any site and suggest to flip spin For “current” config. (same as before or updated, if accepted) Single-spin flip algorithm Guarantees that contributing configurations are generated with probability W

Contribution to the answer or weight (with differential measures!) More general classical case:   the number of variables N is constant General “quantum” case:   Integration variables term order different terms of of the same order (say, topologies) Contribution to the answer or weight (with differential measures!) Diagrammatic Monte Carlo (DiagMC) = unbiased sampling of configuration space with varying number of continuous variables + Estimators for thermodynamic properties and functions; data processing + Normalization, if there is no denominator

        Configuration space = (diagram order, topology and types of lines, internal & external variables) Diagram weight =

MC Markov-chain cycle:   Configuration space: Config. weight: MC Markov-chain cycle: Contribute suggest an update Accept with probability Config.   Updates of type A for same-order diagrams: Business “as usual”   Updates of type B changing the diagram order: Ooops … Not a problem, because there are other factors 

Detailed Balance: solve equation for each pair of updates separately Balance Equation: If the desired probability density distribution of configurations in the stochastic sum is then the updating process has to be stationary with respect to (equilibrium condition). Often Flux out of Flux to Is the probability of proposing an update transforming to Detailed Balance: solve equation for each pair of updates separately Acceptance ratio:

Detailed Balance equation: Updates of type A for same-order diagrams (the number of possibilities is unlimited):   1. Choose to perform a particular type A update with propability 2. Select variable in the set , e.g. at random. Probability is where is the number of variables to choose from in this update. Let it be variable .         3. Propose new value for the selected variable. Probability is for discrete variables or for continuous ones.       4. Accept the change with probability   Detailed Balance equation:   Solution for acceptance ratio       is normalized

Updates of type B changing the diagram order form complementary pairs:     2. Propose values for new variables from the probability distribution       3. Accept the change with probability       2. Accept the change with probability  

Detailed Balance equation: Updates of type B changing the diagram order form complementary pairs: Detailed Balance equation:   Solution for acceptance ratio   All differential measures are gone! Efficiency rules:   ENTER Who has the biggest button …

Configuration space = (diagram order, types of lines, topology (if not summed over), internal variables) Diagram order Diagram topology MC update   Cont. variables This is NOT: write/enumerate diagram after diagram, compute its value, and then sum

Polaron problem: quasiparticle Electrons in semiconducting crystals (electron-phonon polarons) e e electron phonons el.-ph. interaction

+ + + + + + … Green function: phonons el.-ph. interaction electron Sum of all Feynman diagrams Positive definite series in the representation   + + + + + + …

Feynman digrams Graph-to-math correspondence: is a product of

Doing MC in the Feynman diagram configuration space is an endless fun! Diagrams for: there are also diagrams for optical conductivity, etc. Doing MC in the Feynman diagram configuration space is an endless fun!

Frohlich polaron = single electron in ionic semiconductor              

Always accepted, New time: Type A: changing ”external” time (the simplest version)   New time: Exponential probability density   Transformation method:   Always accepted,

Type A: changing “external” time (another, more fancy, version)         Acceptance ratio  

Always accepted, Type A: changing internal time         1. Select any electron interval except the last one at random   Always accepted,  

Type A: changing internal momentum angle         1. Select any phonon line out of n interval at random   Momenta for q=0  

Type A: changing internal momentum modulus         1. Select any phonon line out of n interval at random    

Type A: changing local “topology”     1. Select any electron interval except the first and last one at random    

Type B: changing diagram order (one possible example) Insert/Delete a phonon line (increasing/decreasing the diagram order by one)        

Detailed Balance equation: Type B: changing diagram order (one possible example) Detailed Balance equation:   Solution for acceptance ratio in Insert   Solution for acceptance ratio in Delete

Possible distribution Type B: changing diagram order (one possible example)   Recall that     Possible distribution   Not perfect, but FAPP “good enough”

Normalization: histogram special “bin” where is known exactly Normalized histogram

Normalization using “desined bin”:

Normalization example (statistics is that for G diagrams) Define “normalization” subspace and compute some physical answer in it   Do it analytically (if possible) or numerically (to high accuracy) Collect statistics for your answers as usual     and record the number of configurations in the normalization subspace     Properly normalized physical answer:

This is it! Collect statistics for , Monte Carlo estimators for energy, group velocity, effective mass, number and distribution of phonons in the cloud, or some corr. function. Analyze it.

Analysing data: Quasiparticle energy probability of getting a bare electron (Lehman expansion) probability of getting two phonons in the polaron cloud Slope

Analyzing data: polaron energy estimator [ In the limit ]   [ In the limit ]

Not Landau Pekar limit yet: broad superposition of phonon-number states, while A. Mishchenko, B. Svistunov, A. Sakamoto, NP, ‘98, ‘00

The simplest (still physical) “bold” Diag.MC example S-wave scattering by spherically symmetric potential B. Svistunov, NP ‘07

s-wave scattering length?