Lectures related to Tree (graph theory)

Depth-First Search: Traversing and Sorting Graphs

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

Edge Elimination and Orientation in Graphs

Covers edge elimination and orientation in graphs, including first order tests and logical orientation.

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Renormalization: AQFT

Covers the concept of renormalization in Algebraic Quantum Field Theory.

Networked Control Systems: Laplacian Flow and Heat Equation

Explores Laplacian flow, heat equation analogies, and microgrid networked controllers.

Sparsest Cut and Concurrent Flow

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

Networked Control Systems: Laplacian Operators and Microgrids

Explores Laplacian operators on graphs and the model of DC microgrids.

Probability & Stochastic Processes

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.