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
Interlacing Families and Ramanujan Graphs
Graph Chatbot
Related lectures (52)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Networked Control Systems: Properties and Connectivity
Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.
Networked Control Systems: Opportunities
Explores coordination in networked control systems, graph theory, and consensus algorithms.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Networked Control Systems: Graph Theory and Stochastic Matrices
Explores graph theory, stochastic matrices, consensus algorithms, and spectral properties in networked control systems.
Graph Representation and Traversal
Introduces graph theory basics, graph representation methods, and traversal algorithms like BFS and DFS.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
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.
Graph Theory and Network Flows
Log in to Mediaspace to watch this video
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Reformulating Problems: Tools and Intuition
Log in to Mediaspace to watch this video
Focuses on open problems and the importance of reformulating problems with better tools and intuition.
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.
Pseudorandomness: Theory and Applications
Log in to Mediaspace to watch this video
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Cheeger's Inequalities
Log in to Mediaspace to watch this video
Explores Cheeger's inequalities for random walks on graphs and their implications.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
Statistical Analysis of Network Data
Log in to Mediaspace to watch this video
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
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.
Cheeger's Inequality
Log in to Mediaspace to watch this video
Explores Cheeger's inequality and its implications in graph theory.
Previous
Page 1 of 3
Next
