Class Times and Locations
 Monday and Wednesday, 2:15PM3:30PM in Room: Sequoia 200
Course Description
We will study probabilistic models for large systems
of discrete variables interacting according to general graphs.
Local weak convergence, Gibbs measures on trees,
cavity method and replica symmetry breaking.
Examples include: random ksatisfiability, the
assignment problem, spin glasses, neural networks.
References
We will use the following lecture notes.
Selected portions of the foollowing texts will be `visited' during the
course.
Prerequisites
STAT310A or equivalent (STAT310B or equivalent is also recommended).
What is the figure on the right ?
It is a 3coloring (greenbluereed) of a 3regular tree. This coloring
has two peculiarities: (1) It is proper (no edge has both ends of the
same color); (2) We leave to you the puzzle of finding the second
peculiarity.
[Courtesy of Peter Winkler]

