A Graph-Theoretic Condition for Global Identifiability of Weighted Consensus Networks

DOI10.1109/TAC.2015.2438425MaRDI QIDQ2980681zbMATH OpenWikidataFDO

Authors Seyedbehzad Nabavi, Aranya Chakrabortty

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2015.2438425

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) System identification (93B30)

Cited in

(4)

• Indiscernible topological variations in DAE networks
• Network topology identification under the multi-agent agreement protocol
• Sufficient and Necessary Graphical Conditions for MISO Identification in Networks With Observational Data
• An internal model approach to (optimal) frequency regulation in power grids with time-varying voltages

This page was built for publication: A Graph-Theoretic Condition for Global Identifiability of Weighted Consensus Networks

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