Lecture
Probabilistic Methods in Combinatorics
Related lectures (34)
Pseudorandomness: Theory and Applications
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Martingales: More Theory
Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.
Reformulating Problems: Tools and Intuition
Focuses on open problems and the importance of reformulating problems with better tools and intuition.
Building Ramanujan Graphs
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Ramanujan Graphs: Generating Functions and Expander Graphs
Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.
Percolation Theory: FKG Inequality
Explores the FKG inequality in percolation theory and the reverse FKG theorem.
Hertz Theory: Real Area of Contact
Explores Hertz theory for contact problems and the Tabor measurement method.
Linear Programming: Extreme Points
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.