Lecture
Graph Theory Fundamentals
Related lectures (41)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Statistical Analysis of Network Data
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
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.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Graph Algorithms: Modeling and Representation
Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.
Networks: Structure and Properties
Explores the structure and properties of networks, including dating and protein networks, small-world effect, hubs, and scale-free property.