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
Sparsest Cut: ARV Theorem
Graph Chatbot
Related lectures (59)
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.
Mapping Functions and Surjections
Explores mapping functions, surjections, injective and surjective functions, and bijective functions.
Cartesian Product and Induction
Introduces Cartesian product and induction for proofs using integers and sets.
Polynomial Identity Testing
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Differential Forms Integration
Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.
Composition of Applications in Mathematics
Explores the composition of applications in mathematics and the importance of understanding their properties.
Functions: Definitions and Notations
Covers the generalities of functions, including the definition of an application between sets and the uniqueness of elements in the image set.
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Local Homeomorphisms and Coverings
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.
Generalization Error
Explores generalization error in machine learning, focusing on data distribution and hypothesis impact.
Matroids: Matroid Intersection
Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.
Concept of Proof in Mathematics
Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
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.
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.
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.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
Previous
Page 1 of 3
Next
