Concept
Chi (letter)
Related lectures (30)
Cheeger's Inequality
Explores Cheeger's inequality and its implications in graph theory.
Convergence of Random Walks
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Semi-Definite Programming
Covers semi-definite programming and optimization over positive semidefinite cones.
Convexity of Lovász Extension
Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.
Cheeger's Inequalities
Explores Cheeger's inequalities for random walks on graphs and their implications.
Stochastic Calculus: Lecture 1
Covers the essentials of probability, algebras, and conditional probability, including the Borel o-algebra and Poisson processes.
Information Theory: Source Coding
Covers source coding, typical sequences, stationarity, and efficient encoding in information theory.
Analysis of ARV
Covers the analysis of ARV, focusing on minimizing distances between points in cutis vis.
Number Theory: History and Concepts
Explores the history and concepts of Number Theory, including divisibility and congruence relations.