Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Consensus in Networked Control Systems
Graph Chatbot
Related lectures (29)
Previous
Page 3 of 3
Next
Spectral Graph Theory: Introduction
Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Time-Varying Consensus Algorithms
Explores time-varying consensus algorithms in networked control systems and the Laplacian matrix's role in achieving average consensus.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Statistical Analysis of Network Data
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Networked Control Systems: Challenges and Opportunities
Explores challenges and opportunities in networked control systems, covering LTI systems, delays, packet drops, and consensus.
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.
Pseudorandomness: Expander Mixing Lemma
Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.