Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Cheeger's Inequalities
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Convergence of Random Walks
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Building Ramanujan Graphs
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Cheeger's Inequality
Explores Cheeger's inequality and its implications in graph theory.
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.
Matrices and Networks
Explores the application of matrices and eigendecompositions in networks.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
