Graphs and Randomness

IMPA, Rio de Janeiro, February 19 – March 4

Combinatorics and probability theory have a had a fruitful history of interactions. On the one hand, the probabilistic method developed by Erdős and collaborators became a cornerstone of the theory of graphs and hypergraphs. On the other hand, the study of random graph models (pioneered by Erdős and Rényi) and of random processes on graphs led to many fruitful interactions between the two subjects, as well as to interesting applications.

Our two-week workshop will bring together some of the world’s leading experts in combinatorics and probability to discuss recent advances and collaborate both within and across the lines of their respective disciplines. Each week of the workshop will have its own focus:

  1. Focus Week #1: Probabilistic Combinatorics from February 19th to 25th, 2018.
  2. Focus Week #2: Random Graph Models and Processes from February 26th to March 4th, 2018.

Minicourses and talks will be geared towards students entering the field. Otherwise, structured activities will be kept to a minimum in order to allow time for discussions and collaboration. We encourage participants to stay for the whole duration of the workshop in order to enjoy as broad an experience as possible. At the same time, more limited participation during one of the two focus weeks is also possible.


Organizing Committee:

Rob Morris (IMPA)
Simon Griffiths (PUC-Rio)
Bruce Reed (CNRS/IMPA)

Scientific Committee:

Bruce Reed (CNRS/IMPA)
Maya Stein (UChile)
Yoshiharu Kohayakawa (USP)



Postal Address: Instituto Nacional de Matemática Pura e Aplicada 
Estrada Dona Castorina 110, Jardim Botânico
Rio de Janeiro, RJ, CEP 22460-320, Brasil