Lecture
Pseudorandomness: Theory and Applications
Related lectures (122)
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Building Ramanujan Graphs
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Interlacing Families and Ramanujan Graphs
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Poisson Paradigm: Qualitative / Quantitative
Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.
Ramanujan Graphs: Generating Functions and Expander Graphs
Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Martingales: More Theory
Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.
Probability and Statistics
Covers topics related to probability and statistics, including finding specific values and significant events.
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.