Concept

Orientation (graph theory)

Related lectures (28)

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

Connectivity in Graph Theory

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

Causal Inference: Learning Graph Structures

Explores causal inference through learning graph structures for causal reasoning from observational data.

Anomalous Topological Networks: Theory and Experiment

Explores anomalous robustness in nonreciprocal topological networks, covering topological Floquet states, unitary scattering networks, and practical implementations.

Topological Sort and SCC

Explores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.

Graph Theory: Connectivity and Properties

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

Networked Control Systems: Laplacian Matrix and Consensus in Continuous Time

Explores the Laplacian matrix properties and consensus in continuous time.

Model Selection and Local Geometry

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

Bayesian Networks: Factorization and Sampling

Explains Bayesian Networks factorization and sampling methods using DAGs and Variable Elimination.

Laplacian Matrix: Properties and Examples

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

Knapsack Problem: Dynamic Programming

Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.

What is a Formal Proof?

Covers the concept of formal proof systems, their structure, and soundness.

Ising Model: 2D High Temperature Expansion

Explores the high-temperature expansion of the Ising model in 2D square lattice.

NoSQL Databases: Origins and Types

Covers the origins and types of NoSQL databases, focusing on MongoDB and CRUD operations.

Laplacian Matrix in Networked Control Systems

Explores the Laplacian matrix in electric and mechanical networks, consensus, and properties of Laplacian matrices in networked control systems.

Depth-First Search: Traversing and Sorting Graphs

Explores depth-first search, breadth-first search, graph representation, and topological sorting in graphs.

Cayley Graphs

Covers Cayley graphs, generators, group examples, and graph structures.

Linearity of Expectation

Covers Linearity of Expectation, Markov's inequality, random variables, and transitive tournaments.

Sparsest Cut and Concurrent Flow

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.

DFS Continuation: Topological Sort

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