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: Graph Theory and Stochastic Matrices
Graph Chatbot
Related lectures (42)
Networked Control Systems: Properties and Connectivity
Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Networked Control Systems: Opportunities
Explores coordination in networked control systems, graph theory, and consensus algorithms.
Matrices and Networks
Explores the application of matrices and eigendecompositions in networks.
Consensus in Networked Control Systems
Explores consensus in networked control systems through graph weight design and matrix properties.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Graph Representation and Traversal
Introduces graph theory basics, graph representation methods, and traversal algorithms like BFS and DFS.
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Laplacian Matrix: Properties and Examples
Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.
Networked Control Systems: Properties of Laplacian Matrices
Explores Laplacian matrix properties in networked control systems and their relation to graph theory.
Algebraic Graph Theory: Matrices and Connectivity
Explores algebraic graph theory applied to networked control systems and consensus algorithms.
Matrix Tree Theorem
Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.
Graph Theory Fundamentals
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.
Networked Control Systems: Laplacian Matrix and Consensus
Explores the Laplacian matrix and consensus in networked control systems.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Log in to Mediaspace to watch this video
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Convergence of Random Walks
Log in to Mediaspace to watch this video
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Previous
Page 1 of 3
Next
