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

DOI10.1109/TCNS.2016.2553366OpenAlexW2964116748MaRDI QIDQ4560063

George Michailidis, Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari

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)

Related Items (7)

An overview of structural systems theory ⋮ Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems ⋮ Input perturbations for adaptive control and learning ⋮ On adaptive linear-quadratic regulators ⋮ Finite time identification in unstable linear systems ⋮ Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes ⋮ Unnamed Item

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