3:30 PM - 6:00 PM
Room: Cornett A120
For Part I, see MS2
Probabilistic Combinatorics is an interface between Probability and Discrete Mathematics. Initiated by P. Erdos over fifty years ago, it has now become one of the fastest developing areas in discrete mathematics, with fascinating applications to many other important areas, such as Theoretical Computer Science. This minisymposium will focus on all the main research topics of Probabilistic Combinatorics, including the application of probability to solve combinatorial problems, the study of random combinatorial objects and the investigation of randomized algorithms.
One aim of the minisymposium is simply to foster interaction between researchers in these fields, discuss recent progress and communicate new results and ideas. We also intend to use this forum to make the main state-of-the-art probabilistic techniques available to a broader audience.
Organizer:
Benjamin Sudakov
Princeton University