Concept

Regular graph

Related lectures (32)

Independence Polynomial of Dependency Graph

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

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.

Pseudorandomness: Expander Mixing Lemma

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

Bipartite Graphs: Independent Sets

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

Bethe Free Entropy

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

Ecological Vision: Computational Agent Design

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

Introduction to Categories

Introduces the concept of categories essential for understanding group theory.

Introduction to Category Theory

Covers the introduction to categories, including definitions and examples.

Causal Inference & Directed Graphs

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

Eigenvalues and Sequences

Discusses finding d-regular graphs with specific eigenvalue properties and the existence of Ramasugan sequences for d-opt prime numbers.

Graphs and Networks: Basics and Applications

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Group Theory: Definition and Examples

Covers the definition of a group, properties of symmetries, and group operations.

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.

Geometric Rotations in 2D

Covers the geometric definition of rotations in 2D and analytical expressions for rotations using matrices.

Integer Programming and Network Flows

Covers the fundamentals of integer programming and network flows in directed graphs.

Network Flows Meets Simplex

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Directed Graphs: Introduction and Categories

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

Flow Networks: Strongly Connected Components

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.