Exploring Pseudorandomness And Regularity In Graphs I
Welcome to our comprehensive guide on Pseudorandomness And Regularity In Graphs I.
- Jacob Fox, Stanford University https://simons.berkeley.edu/talks/
- Instructor: Ramprasad Saptharishi Agenda: [k-APs in dense sets] Szemerédi
- Instructor: Prahladh Harsha Agenda: [Spectral expansion] Random-walk matrix, expander mixing lemma, spectral expansion ...
- Luca Trevisan, UC Berkeley https://simons.berkeley.edu/talks/fundamental-techniques-in-
- Instructor: Prahladh Harsha Agenda: vertex expansion, random
In-Depth Information on Pseudorandomness And Regularity In Graphs I
David Conlon, University of Oxford https://simons.berkeley.edu/talks/ Yufei Zhao, University of Oxford https://simons.berkeley.edu/talks/ MIT 18.217 Jacob Fox, Stanford University https://simons.berkeley.edu/talks/
Instructor: Ramprasad Saptharishi Agenda: [Constructing expanders from scratch]
In summary, understanding Pseudorandomness And Regularity In Graphs I gives us a better perspective.
