Many fundamental problems from mathematics and theoretical computer science exhibit "phase transitions" familiar from physics. Phase transitions are observed in physical systems including the Ising, Potts, and lattice-gas models, and in mathematical structures including random graphs, reconstruction problems, formula satisfiability, integer partitions, graph colorings, domino tilings, and geometric graphs. In the last 10 years, huge strides have been made in stuyding these phenomena --- in particular in uniting tools drawn from physics, theoretical computer science, and discrete mathematics and probability theory --- but the field remains nascent.
The Phase Transitions workshop will bring together researchers from theoretical computer science, probabilistic combinatorics and discrete mathematics, and statistical physics. Topics will include applications in areas such as those mentioned above; closely related research areas such as Markov chain Monte Carlo and concentration inequalities; and new techniques, including the porting of established techniques from one field to another. The workshop will include seminars on recent research results, but there will also be a substantial amount of open time to foster collaborations.