Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Directed graph

Related lectures (30)

Covers the concept of the exponential family and discusses forward and backward maps, expensive computations, parameters, functions, and convexity.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Explores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Explores the properties of undirected and directed graphs, emphasizing connectivity and network topology modeling.

Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

Explores the Laplacian matrix and consensus in networked control systems.

Explores Laplacian matrices of graphs, graph-digraph association, and physical system examples.

Explores collaborative training in decentralized ML and causal influence structure discovery.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Covers the concept of affine transformations in functions, including shifting and compressing functions.

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Explores the Laplacian matrix properties and consensus in continuous time.

Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.

Explores the design of graph weights for consensus and applications in sensor networks.

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Covers the analysis of functions, composition, and mathematical induction.

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.