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 Inequality
Graph Chatbot
Related lectures (29)
Previous
Page 1 of 3
Next
Convergence of Random Walks
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
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.
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Cheeger's Inequalities
Explores Cheeger's inequalities for random walks on graphs and their implications.
Sparsest Cut: Leighton-Rao Algorithm
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Polynomial Identity Testing
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Interlacing Families and Ramanujan Graphs
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Graph Sketching: Connected Components
Covers the concept of graph sketching with a focus on connected components.
Cheeger's Inequalities
Covers Cheeger's inequalities and the combinatorial properties of graphs.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
