A global identifiability condition for consensus networks on tree graphs

  title={A global identifiability condition for consensus networks on tree graphs},
  author={Seyedbehzad Nabavi and Aranya Chakrabortty and Pramod P. Khargonekar},
  journal={2015 American Control Conference (ACC)},
In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph G is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical… 
A Graph-Theoretic Condition for Global Identifiability of Weighted Consensus Networks
A sensor placement algorithm is proposed that guarantees identifiability of the edge-weights of a class of linear network dynamic systems exhibiting continuous-time weighted consensus protocols.
Dynamical Structure Function and Granger Causality: Similarities and differences
The relationships between various representations of causal dynamical networks and their identifiability conditions in LTI systems are summarized and the uniqueness of parametric representations is addressed, which is essential in network inference.
Online and statistical learning in networks
A distributed online algorithm with a logarithmic regret with respect to the best global arm is developed, and generalize the results to the case that availability of arms varies over time.
Measurement-Based Methods for Model Reduction, Identification, and Distributed Optimization of Power Systems.
Introduction Introduction Mathematical modeling of dynamic equivalents of large-scale electric power systems has seen some 40 years of long and rich research history. Chow and Kokotovic established


Reconstruction of directed networks from consensus dynamics
A methodology to reconstruct the network topology from the dynamic response when the system is stimulated by a wide-sense stationary noise of unknown power spectral density is proposed and it is established that in the special cases of undirected and purely unidirectional networks, the reconstruction does not need grounding.
Network Identification via Node Knockout
This paper proposes a node-knockout procedure for the complete characterization of the interaction geometry in consensus-type networks, and provides an example for the utility of such a network identification process in the context of fault detection for networked systems.
Digraphs with Distinguishable Dynamics under the Multi-Agent Agreement Protocol
A powerful extension of the all-minors matrix tree theorem in algebraic graph theory is proved which relates the minors of the transformed Laplacian of a directed graph to the number and length of the shortest paths between its vertices.
Link-failure detection in network synchronization processes
This work characterize Maximum A-Posteriori (MAP) detection of the link failure, for both the case that the monitor has information about the network's initial state and the random-initial-condition case.
A Sieve Method for Consensus-type Network Tomography
Under the assumption of controllability and observability of the corresponding steered-and-observed network, the proposed procedure identifies a number of important features of the network using the spectrum of the graph Laplacian.
Network reconstruction of dynamical polytrees with unobserved nodes
  • D. Materassi, M. Salapaka
  • Mathematics, Computer Science
    2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
  • 2012
It is proven that the topology can be consistently reconstructed, as long the degree of each latent node is at least three with outdegree of at least two.
Topology identification for dynamic equivalent models of large power system networks
Two algorithms to identify the equivalent topology of reduced-order models of power systems using measurements of phase angles and frequencies available from Phasor Measurement Units (PMUs) are proposed.
Structural identifiability of linear compartmental systems
  • J. M. Hof
  • Computer Science, Mathematics
    IEEE Trans. Autom. Control.
  • 1998
In this paper tests for the structural identifiability of linear compartmental systems are proposed, based on the similarity transformation approach, and new contributions in the theory are the conditions for structural identIFiability of structured positive linear systems.
Identifiability of linear and nonlinear dynamical systems
This short paper considers the identification of dynamical systems from input-output data. The problem of parameter identifiability for such systems is approached by considering whether system