Topology Identification of Directed Dynamical Networks via Power Spectral Analysis Academic Article uri icon


  • © 2014 IEEE. We address the problem of identifying the topology of an unknown weighted, directed network of LTI systems stimulated by wide-sense stationary noises of unknown power spectral densities. We propose several reconstruction algorithms by measuring the cross-power spectral densities of the network response to the input noises. The measurements are based on a series of node-knockout experiments where at each round the knocked out node broadcasts zero state without being eliminated from the network. Our first algorithm reconstructs the Boolean structure (i.e., existence and directions of links) of a directed network from a series of dynamical responses. Moreover, we propose a second algorithm to recover the exact structure of the network (including edge weights), as well as the power spectral density of the input noises, when an eigenvalue-eigenvector pair of the connectivity matrix is known (for example, Laplacian connectivity matrices). Finally, for the particular cases of nonreciprocal networks (i.e., networks with no directed edges pointing in opposite directions) and undirected networks, we propose specialized algorithms that result in a lower computational cost.

author list (cited authors)

  • Shahrampour, S., & Preciado, V. M.

citation count

  • 50

publication date

  • July 2015