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)
Polynomial Identity Testing
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Stein Algorithm: Polynomial Identity Testing
Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.
Matrices and Networks
Explores the application of matrices and eigendecompositions in networks.
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.
Markov Chains: Applications and Analysis
Explores Markov chains, focusing on the coloring problem and algorithm analysis.
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.
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.
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.
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.
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.
Differentiable Functions and Lagrange Multipliers
Log in to Mediaspace to watch this video
Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.
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.
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.
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.
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.
Previous
Page 1 of 3
Next
