In June 2012, the Institute for Advanced Study and Center for Computational Intractability at Princeton University hosted a five-day Conference on Graphs and Analysis. One of the unexpected interactions emerging between seemingly distant areas in mathematics is between graph theory and analysis. One such link is the theory of continuous limits of discrete structures. This theory has applications in computer science, probability theory, the theory of quasirandomness, number theory, statistical physics, and elsewhere. Further examples of interactions include the theory of measurable graphs, connections with ergodic theory, function norms related to graphs, analytic methods in extremal graph theory, and differential equations on graphs.
The conference was attended by close to a 100 registered participants from around the US and quite a few from around the world. Besides the excellent lectures, which covered all aspects of research on Graph Limits and their applications and connections, there were three self-organized special sessions, on "Local Algorithms" "Statistical Mechanics" and "Spin-Glass models". More generally, the relaxed schedule allowed for many informal interactions.
This workshop was organized by Laszlo Lovasz , Balazs Szegedy, Kati Vesztergombi, and Avi Wigderson. The description of the conference, organizers, speakers, the agenda and the videos of the taped lectures are all available from the conference website http://www.math.ias.edu/cga