Building Ramanujan Graphs

Related lectures (30)

Page 1 of 3

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

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

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

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

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

Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.

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

Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Explores the application of matrices and eigendecompositions in networks.