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
Building Ramanujan Graphs
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Pseudo Randomness in Graphs
Explores pseudo randomness in graphs using eigenvalues and polynomials, emphasizing the significance of bunched roots and common interlacers.
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.
Eigenvalues and Eigenvectors in 3D
Explores eigenvalues and eigenvectors in 3D linear algebra, covering characteristic polynomials, stability under transformations, and real roots.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Sparsest Cut and Concurrent Flow
Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.
Statistical analysis of network data
Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.
Markov Chains: Applications and Analysis
Explores Markov chains, focusing on the coloring problem and algorithm analysis.
Diagonalization of Matrices
Explores the diagonalization of matrices through eigenvalues and eigenvectors, emphasizing the importance of bases and subspaces.
Networked Control Systems: Graph Theory and Stochastic Matrices
Explores graph theory, stochastic matrices, consensus algorithms, and spectral properties in networked control systems.
Cheeger's Inequality
Explores Cheeger's inequality and its implications in graph theory.
