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

Concept

Regular graph

Related lectures (32)

Linear Algebra: Diagonalization

Explores the diagonalization of matrices and the conditions for exact diagonalization, with examples demonstrating the process.

Linear Algebra: Canonical Basis

Explores the canonical basis in linear algebra, focusing on matrix representation, diagonalizability, and characteristic polynomials.

Bethe Free Entropy

Covers the computation of Bethe free entropy and the interpretation of messages between variables and factors.

Introduction to Categories

Introduces the concept of categories essential for understanding group theory.

Causal Inference & Directed Graphs

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

Nonlinear Dimension Reduction Methods

Explores nonlinear dimension reduction methods preserving neighborhoods in lower-dimensional spaces.

Epidemics and Bootstrap Percolation in Square Lattice

Explores epidemics spread models and Bootstrap Percolation in square lattice networks, focusing on the Kolmogorov equation and probability generating functions.

Directed Graphs: Introduction and Categories

Covers the fundamental notion of composition in directed graphs and provides examples of their representation.

Networks: Paths and Components MOOC: Optimization: principles and algorithms - Network and discrete optimization

Explores simple paths, connectivity, equivalence classes, and connected components in directed graphs.

Shortest Paths: Negative Weights & Applications

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

Networks: Definitions MOOC: Optimization: principles and algorithms - Network and discrete optimization

Covers the concept of networks, graphs, subgraphs, directed graphs, and indegree in network theory.

DFS Continuation: Topological Sort

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

Max Flav-Min Cut in Directed Graphs

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

Model Selection and Local Geometry

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

Categories: Functors, and Natural Transformations

Introduces categories, concrete examples, opposite categories, and isomorphisms, leading to groupoids.

Flow Networks: Understanding Flows and Cuts in Algorithms

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Independence Polynomial of Dependency Graph Log in to Mediaspace to watch this video

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Pseudorandomness: Expander Mixing Lemma Log in to Mediaspace to watch this video

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.

Bipartite Graphs: Independent Sets Log in to Mediaspace to watch this video

Explores bipartite graphs, independent sets, Shearer's Lemma, labeled graphs, and entropy analysis.

Ecological Vision: Computational Agent Design Log in to Mediaspace to watch this video

Explores ecological vision and computational agent design in the context of visual perception and behavior.