Lecture
Irreducible Matrices and Strong Connectivity
Related lectures (43)
Networked Control Systems: Properties and Connectivity
Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.
Algebraic Graph Theory: Matrices and Connectivity
Explores algebraic graph theory applied to networked control systems and consensus algorithms.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Linear Algebra: Matrices and Linear Applications
Covers matrices, linear applications, vector spaces, and bijective functions.
Consensus in Networked Control Systems
Explores consensus in networked control systems through graph weight design and matrix properties.
Linear Transformations: Matrices and Kernels
Covers linear transformations, matrices, kernels, and properties of invertible matrices.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Stochastic Block Model: Community Detection
Covers the Stochastic Block Model for community detection.
Linear Algebra: Matrix Representation
Explores linear applications in R² and matrix representation, including basis, operations, and geometric interpretation of transformations.
Networked Control Systems: Consensus Algorithms in Digraphs
Explores consensus algorithms in digraphs, focusing on scenarios where the digraph is not strongly connected.