Optimization-based structure identification of dynamical networks

Tao He, Xiliang Lu, Xiaoqun Wu, Jun-an Lu, Wei Xing Zheng

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

The topological structure of a dynamical network plays a pivotal part in its properties, dynamics and control. Thus, understanding and modeling the structure of a network will lead to a better knowledge of its evolutionary mechanisms and to a better cottoning on its dynamical and functional behaviors. However, in many practical situations, the topological structure of a dynamical network is usually unknown or uncertain. Thus, exploring the underlying topological structure of a dynamical network is of great value. In recent years, there has been a growing interest in structure identification of dynamical networks. As a result, various methods for identifying the network structure have been proposed. However, in most of the previous work, few of them were discussed in the perspective of optimization. In this paper, an optimization algorithm based on the projected conjugate gradient method is proposed to identify a network structure. It is straightforward and applicable to networks with or without observation noise. Furthermore, the proposed algorithm is applicable to dynamical networks with partially observed component variables for each multidimensional node, as well as small-scale networks with time-varying structures. Numerical experiments are conducted to illustrate the good performance and universality of the new algorithm.
Original languageEnglish
Pages (from-to)1038-1049
Number of pages12
JournalPhysica A: Statistical Mechanics and its Applications
Volume392
Issue number4
DOIs
Publication statusPublished - 2013

Keywords

  • dynamical networks
  • optimization problem
  • projected conjugate gradient method
  • structure identification

Fingerprint

Dive into the research topics of 'Optimization-based structure identification of dynamical networks'. Together they form a unique fingerprint.

Cite this