R A N D O M R E G U L A R G R A P H S F A L L 2 0 1 8
Lectures: Tuesday, 11:00-12:50pm, in Warren Weaver Hall 1302.
Lecturers: Paul Bourgade, Eyal Lubetzky.
The course will center around recent breakthroughs on sparse random regular graphs.
The first part will be devoted to the spectrum of such graphs, with three aspects:
(i) Bordenave's proof of Friedman's second eigenvalue theorem (arXiv:1502.04482);
(ii) Anantharaman's quantum ergodicity for deterministic regular graphs (arXiv:1512.06624)
(iii) Bauerschmidt, Huang and Yau's strong delocalization for uniform regular graphs of fixed degree (arXiv:1609.09052).
The second part will aim to go through the paper by Ding, Sly and Sun (arXiv:1310.4787) on maximal independent sets in random regular graphs, via belief propagation and tools from statistical physics.
Prerequisites: Basic knowledge of linear algebra and probability theory is required.
Additional documents: For the first part of this course Anantharaman's ICM 2018 proceedings give some introduction to themes and results of interest. For the second part of this course, see here for an introduction and related literature.
A tentative schedule for this course is (click on the title for detailed content):