Concept
Graph theory
Related lectures (417)
Max Sum Diversification
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Message passing in graphical models
Explains message passing in graphical models and the matching problem in graph theory.
Graph Theory: Path Weighted by Amplitude
Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.
Dense Graphs: From Theory to Applications
Explores the transition from sparse to dense graphs and their real-world applications.
Sparsest Cut: Leighton-Rao Algorithm
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Belief Propagation on Graphs
Explores belief propagation on graphs, emphasizing normalization, recursive relations, and iterative computation of the partition function.
Facebook Social Graph: Structure and Small-World Phenomenon
Examines the Facebook social graph structure, small-world phenomenon, four degrees of separation, and user homophily.