Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Networked Control Systems: Properties and Connectivity
Graph Chatbot
Related lectures (40)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Networked Control Systems: Graph Theory and Stochastic Matrices
Explores graph theory, stochastic matrices, consensus algorithms, and spectral properties in networked control systems.
Networked Control Systems: Opportunities
Explores coordination in networked control systems, graph theory, and consensus algorithms.
Irreducible Matrices and Strong Connectivity
Explores irreducible matrices and strong connectivity in networked control systems, emphasizing the importance of adjacency matrices and graph structures.
Matrices and Networks
Explores the application of matrices and eigendecompositions in networks.
Networked Control Systems: Laplacian Matrix and Consensus
Explores the Laplacian matrix and consensus in networked control systems.
Laplacian Matrix: Properties and Examples
Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Consensus in Networked Control Systems
Explores consensus in networked control systems through graph weight design and matrix properties.
Graph Representation and Traversal
Introduces graph theory basics, graph representation methods, and traversal algorithms like BFS and DFS.
Networked Control Systems: Challenges and Opportunities
Explores challenges and opportunities in networked control systems, covering LTI systems, delays, packet drops, and consensus.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Matrix Tree Theorem
Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Consensus Algorithms: Weight Assignment and Applications
Explores the design of graph weights for consensus and applications in sensor networks.
Algebraic Graph Theory: Matrices and Connectivity
Explores algebraic graph theory applied to networked control systems and consensus algorithms.
Networked Control Systems: Laplacian Flow and Heat Equation
Explores Laplacian flow, heat equation analogies, and microgrid networked controllers.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Graphs: BFS
Log in to Mediaspace to watch this video
Introduces elementary graph algorithms, focusing on Breadth-First Search and Depth-First Search.
Graphical Models: Probability Distributions and Factor Graphs
Log in to Mediaspace to watch this video
Covers graphical models for probability distributions and factor graphs representation.
Previous
Page 1 of 2
Next
