Ramanujan Graphs: Generating Functions and Expander Graphs

Related lectures (54)

Covers the basics of computational complexity, including big O notation and complexity classes.

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Covers topics related to probability and statistics, including finding specific values and significant events.

Explores finding the equation of the tangent line to a function's graph at a point.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.

Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.

Explores Hertz theory for contact problems and the Tabor measurement method.

Explores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.

Covers the analysis of functions, composition, and mathematical induction.

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.

Explores Markov's theorem, Chernoff bound, and probability theory fundamentals, including good coloring, 2-colorable graphs, and rare events.

Explores the FKG inequality in percolation theory and the reverse FKG theorem.

Page 1 of 3