6/23/20151 Graph Theory and Complex Systems in Statistical Mechanics website:

Slides:



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

The Kinetic Theory of Gases
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.
Optimization in mean field random models Johan Wästlund Linköping University Sweden.
The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College.
To show that the Kauffman Bracket is unchanged under each of the three Reidemeister moves. First explain the basics of knot theory. Then show you what.
Introduction to Graph Theory Lecture 11: Eulerian and Hamiltonian Graphs.
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
Planning under Uncertainty
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
The Potts and Ising Models of Statistical Mechanics.
Whitney Sherman & Patti Bodkin Saint Michael’s College.
The Markov property Discrete time: A time symmetric version: A more general version: Let A be a set of indices >k, B a set of indices
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.
Statistics. Large Systems Macroscopic systems involve large numbers of particles.  Microscopic determinism  Macroscopic phenomena The basis is in mechanics.
10/27/051 From Potts to Tutte and back again... A graph theoretical view of statistical mechanics Jo Ellis-Monaghan
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
Counting Proper Colors Given k  N and a graph G, the value  (G;k) is the number of proper colorings f: V(G)  [k]. The set of available colors is [k]={1,…,k};
G. Cowan Lectures on Statistical Data Analysis 1 Statistical Data Analysis: Lecture 8 1Probability, Bayes’ theorem, random variables, pdfs 2Functions of.
1 Patti Bodkin Saint Michael’s College Colchester, VT
Jo Ellis-Monaghan St. Michaels College, Colchester, VT website: Work.
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:
TELCOM2125: Network Science and Analysis
Boyce/DiPrima 9th ed, Ch 11.2: Sturm-Liouville Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
Monte Carlo Simulation of Ising Model and Phase Transition Studies By Gelman Evgenii.
Graphs Chapter 10.
Random matching and traveling salesman problems Johan Wästlund Chalmers University of Technology Sweden.
7 Graph 7.1 Even and Odd Degrees.
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
Entropy and the Second Law Lecture 2. Getting to know Entropy Imagine a box containing two different gases (for example, He and Ne) on either side of.
V. Space Curves Types of curves Explicit Implicit Parametric.
CS774. Markov Random Field : Theory and Application Lecture 21 Kyomin Jung KAIST Nov
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
For a new configuration of the same volume V and number of molecules N, displace a randomly selected atom to a point chosen with uniform probability inside.
The Tutte Polynomial Graph Polynomials winter 05/06.
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-
Techniques for Proving NP-Completeness Show that a special case of the problem you are interested in is NP- complete. For example: The problem of finding.
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.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
1 Decomposition into bipartite graphs with minimum degree 1. Raphael Yuster.
Copyright © Cengage Learning. All rights reserved. 4 Continuous Random Variables and Probability Distributions.
Graduate School of Information Sciences, Tohoku University
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Trees Thm 2.1. (Cayley 1889) There are nn-2 different labeled trees
One Function of Two Random Variables
Network Science K. Borner A.Vespignani S. Wasserman.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
On the behaviour of an edge number in a power-law random graph near a critical points E. V. Feklistova, Yu.
Week 10 - Wednesday.  What did we talk about last time?  Counting practice  Pigeonhole principle.
Theory of Computational Complexity Yusuke FURUKAWA Iwama Ito lab M1.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Graph Theory and Complex Systems in Statistical Mechanics
The Increasingly Popular Potts Model or A Graph Theorist Does Physics (!) Jo Ellis-Monaghan website:
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Minimum Spanning Tree 8/7/2018 4:26 AM
Degree and Eigenvector Centrality
Presented by Rhee, Je-Keun
8. One Function of Two Random Variables
8. One Function of Two Random Variables
Presentation transcript:

6/23/20151 Graph Theory and Complex Systems in Statistical Mechanics website: Jo Ellis-Monaghan

6/23/20152 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) 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. Mary Cox (UVM grad) Robert Schrock (SUNY Stonybrook) Greta Pangborn (SMC) Alan Sokal (NYU) Isaac Newton Institute for Mathematical Sciences Cambridge University, UK

6/23/20153 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.

6/23/20154 Ernst Ising ,500 Articles on ‘Potts Model’ found by Google Scholar Ising, E. Beitrag zur Theorie des Ferromagnetismus. Zeitschrift fr Physik 31 (1925),

6/23/20155 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. * Mathematicians should NOT attempt this at home…

6/23/20156 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

6/23/20157 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.

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

6/23/20159 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 HealthySickNecrotic

6/23/ 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. 3 (note—q n possible states)

6/23/ 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-- Probability of a state 4 The numerator is easy. The denominator, called the Potts Model Partition Function, is the interesting (hard) piece.

6/23/ Example The Potts model partition function of a square lattice with two possible spins 4 Minimum Energy States

6/23/ 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) = = 1/16 Setting J = k for convenience, so

6/23/ 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.

6/23/ Ising Model at different temperatures Cold Temperature Hot Temperature Images from Critical Temperature Here H is and energy is

6/23/ Monte Carlo Simulations ?

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

6/23/ Capture effect of temperature High TempLow Temp H(B) < H(A) B is a lower energy state than A exp(‘-’/kT) ~1exp(‘-’/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 states.> r, so change to lower energy state. Given r between 0 and 1, and that, with B the current state and A the one we are considering changing to, we have:

6/23/ 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 9

6/23/ 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: ws&sa=view&newsId=392

6/23/ 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. 7

6/23/ 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 8

6/23/ 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

6/23/ 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

6/23/ Example =+=++= +++= The Tutte polynomial of a cycle on 4 vertices… 13

6/23/ Does the order of contraction/deletion matter? 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. vs. k(A) = 2 |A| = 2

6/23/ 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. Universality THEOREM: (various forms—Brylawsky, Welsh, Oxley, etc.) If f is a function of graphs such that a) 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 ( ) = x 0, and f ( ) = y 0.

6/23/ The q-state Potts Model Partition Function is an evaluation of the Tutte Polynomial If we let, then: (Fortuin and Kasteleyn, 1972) The Potts Model Partition Function is a polynomial in q!!! 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,

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

6/23/ A different point of view 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…). Another reason to believe that

6/23/ 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: Thermodynamic Functions

6/23/ 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.

6/23/ 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. Temp Energy

6/23/ The antiferromagnetic model at zero temperature 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 DC B 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.

6/23/ 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 Recursively: Let e be an edge of G. Then, Chromatic polynomial

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

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

6/23/ 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.

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

6/23/ 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.

6/23/ Some zeros (Robert Shrock)

6/23/ 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….

6/23/ 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:

6/23/ 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).

6/23/ Thank you for your attention! Questions?