Combinatorics and Probability
Béla BollobásCambridge University, UK
Michael KrivelevichTel Aviv University, Israel
Oliver M. RiordanOxford University, UK
Emo WelzlETH Zürich, Switzerland
For the past few decades, Combinatorics and Probability Theory have had a fruitful symbiosis, each benefitting from and influencing developments in the other. Thus to prove the existence of designs, probabilistic methods are used, algorithms to factorize integers need combinatorics and probability theory (in addition to number theory), and the study of random matrices needs combinatorics. In the workshop a great variety of topics exemplifying this interaction were considered, including problems concerning designs, Cayley graphs, additive number theory, multiplicative number theory, noise sensitivity, random graphs, extremal graphs and random matrices.
Cite this article
Béla Bollobás, Michael Krivelevich, Oliver M. Riordan, Emo Welzl, Combinatorics and Probability. Oberwolfach Rep. 13 (2016), no. 2, pp. 1189–1257DOI 10.4171/OWR/2016/22