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
Sparsest Cut: Bourgain's Theorem
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
Untitled
Untitled
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Differential Forms Integration
Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Information Measures: Entropy and Information Theory
Explains how entropy measures uncertainty in a system based on possible outcomes.
Fundamental Groups
Explores fundamental groups, homotopy classes, and coverings in connected manifolds.
Harmonic Forms: Main Theorem
Explores harmonic forms on Riemann surfaces and the uniqueness of solutions to harmonic equations.
Cheeger's Inequality
Explores Cheeger's inequality and its implications in graph theory.
Multivariate Statistics: Normal Distribution
Covers the multivariate normal distribution, properties, and sampling methods.