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
Convergence of Random Walks
Graph Chatbot
Related lectures (54)
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Matrices and Networks
Explores the application of matrices and eigendecompositions in networks.
Handling Networks: Graph Theory
Covers the fundamentals of handling networks and centrality measures in graph theory.
Handling Networks: Graph Theory
Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Cheeger's Inequalities
Covers Cheeger's inequalities and the combinatorial properties of graphs.
Matroids: Matroid Intersection
Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.
Subgraphs vs Induced Subgraphs
Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
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.
Cheeger's Inequalities
Log in to Mediaspace to watch this video
Explores Cheeger's inequalities for random walks on graphs and their implications.
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.
Cheeger's Inequality
Log in to Mediaspace to watch this video
Explores Cheeger's inequality and its implications in graph theory.
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.
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.
Sparsest Cut: Bourgain's Theorem
Log in to Mediaspace to watch this video
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Embedding Graphs into Trees
Log in to Mediaspace to watch this video
Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.
Previous
Page 1 of 3
Next
