Graph Theory and Complex Systems in Statistical Mechanics

Slides:



Advertisements
Similar presentations
Dr Roger Bennett Rm. 23 Xtn Lecture 19.
Advertisements

The Kinetic Theory of Gases
Pressure and Kinetic Energy
The microcanonical ensemble Finding the probability distribution We consider an isolated system in the sense that the energy is a constant of motion. We.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
ASYMPTOTIC PROPERTIES OF ESTIMATORS: PLIMS AND CONSISTENCY
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees David R. Karger David R. Karger Philip N. Klein Philip N. Klein Robert E. Tarjan.
Entropy Rates of a Stochastic Process
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
The Potts and Ising Models of Statistical Mechanics.
Whitney Sherman & Patti Bodkin Saint Michael’s College.
The Potts Model Laura Beaudin Saint Michael’s College The project described was supported by the Vermont Genetics Network through NIH Grant Number 1 P20.
10/27/051 From Potts to Tutte and back again... A graph theoretical view of statistical mechanics Jo Ellis-Monaghan
6/23/20151 Graph Theory and Complex Systems in Statistical Mechanics website:
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
1 Patti Bodkin Saint Michael’s College Colchester, VT
Monte Carlo Simulation of Ising Model and Phase Transition Studies
The Increasingly Popular Potts Model or A Graph Theorist Does Physics (!) Jo Ellis-Monaghan website:
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Graphs Chapter 10.
CS774. Markov Random Field : Theory and Application Lecture 21 Kyomin Jung KAIST Nov
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
With Jesper Lykke Jacobsen Hubert Saleur Alan D. Sokal Andrea Sportiello Fields for Trees and Forests Physical Review Letters 93 (2004) Bari, September.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
CSM Workshop 1: Zeros of Graph Polynomials Enumeration of Spanning Subgraphs with Degree Constraints Dave Wagner University of Waterloo.
1 8. One Function of Two Random Variables Given two random variables X and Y and a function g(x,y), we form a new random variable Z as Given the joint.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
CHAPTER SIX T HE P ROBABILISTIC M ETHOD M1 Zhang Cong 2011/Nov/28.
Trees.
Chapter Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Physics 2 – Feb 21, 2017 P3 Challenge – a) What is the average kinetic energy of a molecule of oxygen gas at 298 K? b) What is the root mean square velocity.
Continuous Random Variables and Probability Distributions
The Increasingly Popular Potts Model or A Graph Theorist Does Physics (!) Jo Ellis-Monaghan website:
Applications of the Canonical Ensemble: Simple Models of Paramagnetism
New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y
Graphs: Definitions and Basic Properties
Bipartite Matching Lecture 8: Oct 7.
The units of g(): (energy)-1
Continuous Random Variables and Probability Distributions
Ch9: Decision Trees 9.1 Introduction A decision tree:
LAWS OF THERMODYNAMICS
Minimum Spanning Tree 8/7/2018 4:26 AM
Graph theory Definitions Trees, cycles, directed graphs.
Eulerian tours Miles Jones MTThF 8:30-9:50am CSE 4140 August 15, 2016.
Haim Kaplan and Uri Zwick
Pigeonhole Principle and Ramsey’s Theorem
Distinct Distances in the Plane
Degree and Eigenvector Centrality
Section 7.12: Similarity By: Ralucca Gera, NPS.
Don’t be in a such a hurry to condemn a person because he doesn’t do what you do, or think as you think. There was a time when you didn’t know what you.
Discrete Mathematics for Computer Science
Condensed Matter Physics: Quantum Statistics & Electronic Structure in Solids Read: Chapter 10 (statistical physics) and Chapter 11 (solid-state physics)
Haim Kaplan and Uri Zwick
Ising Model of a Ferromagnet
Presented by Rhee, Je-Keun
Chemistry: The Central Science
V12 Menger’s theorem Borrowing terminology from operations research
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
8. One Function of Two Random Variables
Derivatives and Differentiation
Biointelligence Laboratory, Seoul National University
Discrete Mathematics for Computer Science
Complexity Theory in Practice
8. One Function of Two Random Variables
General Trees A general tree T is a finite set of one or more nodes such that there is one designated node r, called the root of T, and the remaining nodes.
Integer and fractional packing of graph families
Presentation transcript:

Graph Theory and Complex Systems in Statistical Mechanics Jo Ellis-Monaghan e-mail: jellis-monaghan@smcvt.edu website: http://academics.smcvt.edu/jellis-monaghan 5/7/2018

Getting by with a little (a lot of!) help from my friends…. Patrick Redmond (SMC 2010) Eva Ellis-Monaghan (Villanova 2010) Laura Beaudin (SMC 2006) Patti Bodkin (SMC 2004) Whitney Sherman (SMC 2004) Mary Cox (UVM grad) Robert Schrock (SUNY Stonybrook) Greta Pangborn (SMC) Alan Sokal (NYU) This work is supported by the Vermont Genetics Network through NIH Grant Number 1 P20 RR16462 from the INBRE program of the National Center for Research Resources. Isaac Newton Institute for Mathematical Sciences Cambridge University, UK 5/7/2018

Applications of the Potts Model ● Liquid-gas transitions ● Foam behaviors ● Magnetism ● Biological Membranes ● Social Behavior ● Separation in binary alloys ● Spin glasses ● Neural Networks ● Flocking birds ● Beating heart cells These are all complex systems with nearest neighbor interactions. These microscale interactions determine the macroscale behaviors of the system, in particular phase transitions. 5/7/2018

Ernst Ising 1900-1998 Ising, E. Beitrag zur Theorie des Ferromagnetismus. Zeitschrift fr Physik 31 (1925), 253-258. 72,500 Articles on ‘Potts Model’ found by Google Scholar http://www.physik.tu-dresden.de/itp/members/kobe/isingconf.html 5/7/2018

The Ising Model Consider a sheet of metal: It has the property that at low temperatures it is magnetized, but as the temperature increases, the magnetism “melts away”*. We would like to model this behavior. We make some simplifying assumptions to do so. The individual atoms have a “spin”, i.e., they act like little bar magnets, and can either point up (a spin of +1), or down (a spin of –1). Neighboring atoms with the same spins have an interaction energy, which we will assume is constant. The atoms are arranged in a regular lattice. 5/7/2018 *Mathematicians should NOT attempt this at home…

One possible state of the lattice A choice of ‘spin’ at each lattice point. Ising Model has a choice of two possible spins at each point 5/7/2018

The Kronecker delta function and the Hamiltonian of a state Kronecker delta-function is defined as: The Hamiltonian of a system is the sum of the energies on edges with endpoints having the same spins. 5/7/2018

The energy (Hamiltonian) of the state Endpoints have the same spins, so δ is 1. Endpoints have different spins, so δ is 0. of this system is A state w with the value of δ marked on each edge. 5/7/2018

The Potts Model Now let there be q possible states…. Orthogonal vectors, with δ replaced by dot product Colorings of the points with q colors States pertinent to the application Healthy Sick Necrotic 5/7/2018

More states--Same Hamiltonian The Hamiltonian still measures the overall energy of the a state of a system. The Hamiltonian of a state of a 4X4 lattice with 3 choices of spins (colors) for each element. 1 1 1 1 1 1 1 1 1 1 (note—qn possible states) 5/7/2018 3

Probability of a state The probability of a particular state S occurring depends on the temperature, T (or other measure of activity level in the application) --Boltzmann probability distribution-- The numerator is easy. The denominator, called the Potts Model Partition Function, is the interesting (hard) piece. 5/7/2018 4

Example The Potts model partition function of a square lattice with two possible spins Minimum Energy States 5/7/2018 4

Probability of a state occurring depends on the temperature P(all red, T=0.01) = .50 or 50% P(all red, T=2.29) = 0.19 or 19% P(all red, T = 100, 000) = 0.0625 = 1/16 Setting J = k for convenience, so 5/7/2018

Effect of Temperature Consider two different states A and B, with H(A) < H(B). The relative probability of the two states is: At high temperatures (i.e., for kT much larger than the energy difference |D|), the system becomes equally likely to be in either of the states A or B - that is, randomness and entropy "win". On the other hand, if the energy difference is much larger than kT (very likely at low temperatures), the system is far more likely to be in the lower energy state. 5/7/2018

Ising Model at different temperatures Cold Temperature Hot Temperature Here H is and energy is Here magnetization is average of the spins, and energy per spin is -1/N * sum( a*b) where a, b are spins at endpoint of edge. Critical Temperature Images from http://bartok.ucsc.edu/peter/java/ising/keep/ising.html http://spot.colorado.edu/~beale/PottsModel/MDFrameApplet.html 5/7/2018

Monte Carlo Simulations ? http://www.pha.jhu.edu/~javalab/potts/potts.html 5/7/2018

Monte Carlo Simulations Generate a random number r between 0 and 1. B (stay old) B (old) A (change to new) 5/7/2018

Capture effect of temperature Given r between 0 and 1, and that , with B the current state and A the one we are considering changing to, we have: High Temp Low Temp H(B) < H(A) B is a lower energy state than A exp(‘-’/kT) ~1 exp(‘-’/kT) ~ 0 > r, so change states. < r, so stay in low energy state. H(B) > H(A) B is a higher energy state than A exp(‘+’/kT) ~1 > r, so change to lower energy state. 5/7/2018

Foams “Foams are of practical importance in applications as diverse as brewing, lubrication, oil recovery, and fire fighting”. The energy function is modified by the area of a bubble. Results: Larger bubbles flow faster. There is a critical velocity at which the foam starts to flow uncontrollably 5/7/2018 9

A personal favorite Y. Jiang, J. Glazier, Foam Drainage: Extended Large-Q Potts Model Simulation We study foam drainage using the large-Q Potts model... profiles of draining beer foams, whipped cream, and egg white ... Olympic Foam: http://mathdl.maa.org/mathDL?pa=mathNews&sa=view&newsId=392 http://www.lactamme.polytechnique.fr/Mosaic/images/ISIN.41.16.D/display.html 5/7/2018

Life Sciences Applications This model was developed to see if tumor growth is influenced by the amount and location of a nutrient. Energy function is modified by the volume of a cell and the amount of nutrients. Results: Tumors grow exponentially in the beginning. The tumor migrated toward the nutrient. 5/7/2018 7

Sociological Application The Potts model may be used to “examine some of the individual incentives, and perceptions of difference, that can lead collectively to segregation …”. (T. C. Schelling won the 2005 Nobel prize in economics for this work) Variables: Preferences of individuals Size of the neighborhoods Number of individuals 5/7/2018 8

What’s a nice graph theorist doing with all this physics? If two vertices have different spins, they don’t interact, so there might as well not be an edge between them (so delete it). If two adjacent vertices have the same spin, they interact with their neighbors in exactly the same way, so they might as well be the same vertex (so contract the edge)*. *with a weight for the interaction energy e Delete e Contract e G G-e G/e 5/7/2018

Tutte Polynomial (The most famous of all graph polynomials) Let e be an edge of G that is neither a bridge nor a loop. Then, And if G consists of i bridges and j loops, then 5/7/2018

Example The Tutte polynomial of a cycle on 4 vertices… = + = + + = + + 5/7/2018 13

Does the order of contraction/deletion matter? vs. The Dichromatic Polynomial: Can show (by induction on the number of edges) that TheTutte polynomial is independent of the order in which the edges are deleted and contracted. k(A) = 2 |A| = 2 5/7/2018

Universality THEOREM: (various forms—Brylawsky, Welsh, Oxley, etc.) If f is a function of graphs such that f(G) = a f(G-e) + b f(G/e) whenever e is not a loop or bridge, and b) f(GH) = f(G)f(H) where GH is either the disjoint union of G and H or where G and H share at most one vertex. Then, , where are the number of edges, vertices, and components of G, respectively, and where f ( ) = x0 , and f ( ) = y0. Thus any graph invariant that reduces with a) and b) is an evaluation of the Tutte polynomial. Proof: By induction on the number of edges. 5/7/2018

The q-state Potts Model Partition Function is an evaluation of the Tutte Polynomial For a loop, note that there are q states, and since both endpoints of a loop necessarily have the same value, the Hamiltonian of each state is 1. Thus, For a single bridge, there are q states where the spins on the endpoints are equal, giving a Hamiltonian of 1. Then there are q(q-1) states where the spins on the endpoints are different, giving a Hamiltonian of 0. Thus, If we let , then: The Potts Model Partition Function is a polynomial in q!!! (Fortuin and Kasteleyn, 1972) 5/7/2018

Example The Tutte polynomial of a 4-cycle: Compute Potts model partition function from the Universality Theorem result: Let q = 2 and 5/7/2018

A different point of view Another reason to believe that What might we be counting here? Inspiration: A is the set of edges labeled with 1, so these are exactly the number of edges contributing to the Hamiltonian, so give the exponent of v. However, this then means that all the vertices in a component of A must have the same spin, so q# components ways to assign the spins (sort of…). 1 5/7/2018

Thermodynamic Functions Important thermodynamic functions such as internal energy, specific heat, entropy, and free energy may all be derived from the Potts Model partition function, U=Internal Energy (sum of the potential and kinetic energy): C=Specific heat (energy to raise a unit amount of material one degree): S=Entropy (a measure of the randomness and disorder in a system): F=Total free energy: 5/7/2018

Phase Transitions For convenience, work with the dimensionless, reduced free energy: Reduced free energy per unit volume (or in this context, per vertex): For a fixed graph G, this is clearly an analytic function in both q and T. Any failures of analyticity can only occur in the infinite volume limit. 5/7/2018

The infinite volume limit Let {G} be an increasing sequence of finite graphs (e.g. lattices). The (limiting) free energy per unit volume is: Phase transitions (failure of analyticity) arise in the infinite volume limit. Energy Energy Temp Temp 5/7/2018

The antiferromagnetic model at zero temperature J is negative in the antiferromagnetic model, so minimal energy states have a maximum number of zeros in the summation, i.e. every edge has endpoints with different spins. If we think of the spins as colors, a minimum energy state is then just a proper coloring of the graph. Now low energy  lots of edges with different spins on endpoints. At zero temperature, low energy states prevail, i.e. we really need to consider states where the endpoints on every edge are different. Such a state corresponds to a proper coloring of a graph. A E D C B 5/7/2018

Chromatic polynomial The Chromatic Polynomial counts the ways to vertex color a graph: C(G, n ) = # proper vertex colorings of G in n colors. + = G G/e G-e Do K3 -> Recursively: Let e be an edge of G . Then, 5/7/2018

Example n(n-1)2 + + = - = = n(n-1)2 +n(n-1) + 0 = n2 (n-1) Since a contraction-deletion invariant, the chromatic polynomial is an evaluation of the Tutte polynomial: 5/7/2018

The connection Note: Recall: with These are the same function precisely when that is, when which is exactly the zero-temperature model. 5/7/2018

Another connection Consider the summands of as , and hence A summand is 0 except precisely when in which case it is 1. Thus simply counts the number of proper colorings of G with q colors. 5/7/2018

Zeros of the chromatic polynomial In the infinite volume limit, the ground state entropy per vertex of the Potts antiferromagnetic model becomes: Thus, phase transitions correspond to the accumulation points of roots of the chromatic polynomial in the infinite volume limit. 5/7/2018

Locations of Zeros Mathematicians originally focused on the real zeros of the chromatic polynomial (the quest for a proof of the 4-color theorem…) Physicists have changed the focus to the locations of complex zeros, because these can approach the real axis in the infinite limit. Now an emphasis on ‘clearing’ areas of the complex plane of zeros. 5/7/2018

Some zeros (Robert Shrock) 5/7/2018

What happens if…. Interaction energy depends on the edge? Depends on whether the edge is contracted or deleted? Depends on whether the edge is a bridge or a loop? What if no longer multiplicative? (!) There is an external field? Fortuin and Kasteleyn, Traldi, Zaslavsky, Bollobas and Riordan, Sokal, E-M and Traldi, E-M and Zaslavsky…. 5/7/2018

Life gets interesting… No longer necessarily get a well-defined function. There are necessary and sufficient conditions on the relations among the edge-weights to guarantee this. These conditions essentially live on three small graphs: 5/7/2018

Can lose mulitiplicativity…. Essential characteristics encoded by contraction/deletion Still need relations to assure well-defined BUT… Retain universality properties and that a function is determined by action on ‘smallest’ objects (all discrete matroids not just a single bridge/loop). 5/7/2018

Thank you for your attention! Questions? 5/7/2018