Ramanujan graph

Related lectures (13)

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

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

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

Explores matching polynomials, emphasizing their real-rooted property and related bounds.

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

Explores pseudo randomness in graphs using eigenvalues and polynomials, emphasizing the significance of bunched roots and common interlacers.

Covers Cheeger's inequalities and the combinatorial properties of graphs.

Discusses finding d-regular graphs with specific eigenvalue properties and the existence of Ramasugan sequences for d-opt prime numbers.

Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.

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

Covers Cayley graphs, generators, group examples, and graph structures.

Covers the concept of graph sketching with a focus on connected components.

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.

Page 1 of 1