Graduate Students from MSRI Sponsoring Institutions may benominated to participate in this program.

This workshop is aimed at faculty who wish to learn about this exciting field and would like to enrich a variety of undergraduate courses with new examples and applications, or teach a stand-alone course in geometric combinatorics.

This workshop seeks to bring together (a) mathematicians studying the math
properties of particular models, and (b) experts in various network
fields who can survey the successes and challenges of modeling within
their field.

The topics of this workshop include phase transitions in connection to
random graphs, boolean functions, satisfiability problems, coding,
reconstruction on trees and spinglasses.

Special focus will be given to the study of the interplay
between the replica method, local weak convergence and algorithmic aspects of
reconstruction.

Recent years have seen the rapid development of techniques for the analysis of MCMC algorithms, with applications in all the above areas. These techniques draw from a wide range of mathematical disciplines, including combinatorics, discrete probability, functional analysis, geometry and statistical physics, and there has been significant cross-fertilization between them. This workshop aims to bring together practitioners from all these domains with the aim of furthering this interplay of ideas.