skip to content
 

An introduction to dynamic critical phenomena and cluster algorithms

Presented by: 
A Sokal [UCL and NYU]
Date: 
Thursday 27th March 2008 - 14:35 to 15:05
Venue: 
INI Seminar Room 1
Abstract: 

I give an introduction, aimed at mathematicians and computer scientists, to physics lore about dynamic critical phenomena. I then give an introduction to cluster algorithms, notably those of Swendsen--Wang and Chayes--Machta, which can potentially achieve significant reductions in critical slowing-down compared to local algorithms.

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.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons