skip to content

Combinatorial and Computational Aspects of Statistical Physics/Random Graphs and Structures

27th August 2002 to 6th September 2002


Organisers: Béla Bollobás (Memphis), Martin Dyer (Leeds), Mark Jerrum (Edinburgh), Alan Sokal (New York) and Peter Winkler (Bell Labs)

Workshop Theme

The heading "random structures" is intended to cover both the finite (random graphs, partial orders, etc.) and infinite (configurations of some physical model on an infinite lattice). Our aim is to bring together combinatorialists, probabilists, physicists and theoretical computer scientists to engage in an interdisciplinary meeting that will study random structures from various directions.


There will be two linked workshops: Combinatorial and computational aspects of statistical physics and Random graphs and structures. The overarching theme that unites these two is that of phase transition, broadly interpreted. A rough distinction between the two workshops might be that the first deals with phase transitions in infinite systems (e.g., the Ising model on the 2-dimensional square lattice), and the second with "phase transitions" in finite structure (e.g., random graphs or random partial orders). However, this distinction is certainly not intended to be a hard-and-fast. Computational questions - such as the extent to which phase transitions may coincide with the boundary between tractable and intractable - will certainly be addressed.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons