Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability

DOI10.1109/TCNS.2016.2553366OpenAlexW2964116748MaRDI QIDQ4560063FDOQ4560063

Authors: Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, George Michailidis 

Publication date: 4 December 2018

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08019

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Controllability (93B05) Networked control (93B70)

Cited In (8)

• Finite time identification in unstable linear systems
• Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
• An overview of structural systems theory
• Controllability and matchings in random bipartite graphs
• Input perturbations for adaptive control and learning
• On adaptive linear-quadratic regulators
• Title not available (Why is that?)
• Derivative-free methods for policy optimization: guarantees for linear quadratic systems

This page was built for publication: Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560063)