Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Spectral Graph Theory: Introduction
Graph Chatbot
Related lectures (51)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Cheeger's Inequalities
Covers Cheeger's inequalities and the combinatorial properties of graphs.
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.
Networked Control Systems: Properties and Connectivity
Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.
Networked Control Systems: Graph Theory and Stochastic Matrices
Explores graph theory, stochastic matrices, consensus algorithms, and spectral properties in networked control systems.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Handling Networks: Graph Theory
Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.
Polynomial Identity Testing
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Convergence of Random Walks
Log in to Mediaspace to watch this video
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Sparsest Cut: ARV Theorem
Log in to Mediaspace to watch this video
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.
Sparsest Cut: Leighton-Rao Algorithm
Log in to Mediaspace to watch this video
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Log in to Mediaspace to watch this video
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Cheeger's Inequality
Log in to Mediaspace to watch this video
Explores Cheeger's inequality and its implications in graph theory.
Building Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Pseudorandomness: Expander Mixing Lemma
Log in to Mediaspace to watch this video
Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Previous
Page 1 of 3
Next
