“Schramm-MSR Lecture”: Random Cayley Graphs
The study of random Cayley graphs of finite groups is related to the investigation of Expanders and to problems in Combinatorial Number Theory and in Information Theory. I will discuss this topic, describing the motivation and focusing on the question of estimating the chromatic number of a random Cayley graph of a given group with a prescribed number of generators.
Noga Alon is a Baumritter Professor of Mathematics and Computer Science in Tel Aviv University, Israel. He received his Ph. D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Laboratories, Bellcore and Microsoft Research. He serves on the editorial boards of more than a dozen international technical journals and has given invited lectures in many conferences, including a plenary address in the 1996 European Congress of Mathematics and an invited lecture in the 1990 International Congress of Mathematicians. He published more than three hundred research papers, mostly in Combinatorics and in Theoretical Computer Science, and one book. He is a member of the Israel National Academy of Sciences since 1997 and received the Erdos prize in 1989, the Feher prize in 1991, the Polya Prize in 2000 and the Bruno Memorial Award in 2001.
- Noga Alon
- Tel Aviv University