skip to content
 

Graphical representations and cluster algorithms

Presented by: 
J Machta [Massachusetts]
Date: 
Thursday 27th March 2008 - 15:40 to 16:10
Venue: 
INI Seminar Room 1
Abstract: 

In this talk I discuss developments in graphical representations and associated cluster algorithms. After a review of the Edwards-Sokal spin-bond representation for Potts models and the associated Swendsen-Wang algorithm, I discuss graphical representations and cluster algorithms for other systems including random cluster models for real q>1 and Ising spin systems with external fields and/or frustration.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons