SOCN Course Network Identification – 2026

Home » SOCN Course Network Identification – 2026

Identification in dynamic networks

VUB Brussels, March 4-6, 2026

Lecturer:

  • Prof. Paul Van den Hof, TU/e, Eindhoven
  • Date of the course:  4 – 6 March 2026.
  • VUB, Brussels, Belgium.

MATLAB App and Toolbox

Most methods presented in this course have been implemented  in the MATLAB App and Toolbox SYSDYNET with graphical and interactive user interface. It can be downloaded from www.sysdynet.net. Please check to work with release Beta 0.4.0 (2025), available from xxx, x 2025 onwards.

Paul van den Hof

Summary

In many areas of science and technology, the complexity of dynamic systems that are being considered, grows beyond the level of single systems. Current challenges move to the monitoring, diagnostics, control and optimization of interconnected systems, represented as dynamic networks. In control and optimization this has led to the development of decentralized and distributed algorithms for control/optimization, as e.g. present in multi-agent systems. From the modelling perspective, data-driven modelling challenges lie in the processing of high-dimensional data, exploiting the ubiquitous availability of sensor data, and turning measurement data into dynamic and structured information on the causal relationships between the different nodes (sensor signals) in the network. As a further generalization of the closed-loop identification problem, network identification problems have to face and exploit the structure of the interconnections between different components in the network.

In this course we will highlight the main developments and challenges in this area. Besides setting up a modelling framework for both directed (transfer function based) and non-directed (equation based) networks, we will address problems of local identification of a particular part of the network, including the selection of the appropriate signals to be measured, and the selection of excitation signals. The concept of network identifiability is highlighted and the role of structural properties of the network, in terms of its topology/graph, is given strong attention. It is also shown how classical closed-loop identification methods need to be generalized to be able to cope with the new situations, leading to a variation of appropriate algorithms. Examples will be shown through the MATLAB App and Toolbox SYSDYNET that will be made available to the attendees.

The schedule below is only tentative.


Wednesday March 4, 2026

09:30 – 12:30:

13:50 – 16:30

Thursday March 5, 2026

09:30 – 12:30

13:50 – 16:30

Friday March 6, 2026

09:30 – 12:30

13:50 – 16:30

Background material

Closed-loop identification:

Dynamic networks:

Network identifiability analysis:

  • H.H.M. Weerts, P.M.J. Van den Hof and A.G. Dankers (2018). Identifiability of linear dynamic networks. Automatica, Vol. 89, pp. 247-258, March 2018.
  • J. M. Hendrickx, M. Gevers and A.S. Bazanella (2019). Identifiability of dynamical networks with partial node measurements. IEEE Trans. Automatic Control, Vol. 64, no. 6, pp. 2240-2253.

Network identifiability synthesis:

Algorithms for full network identification:

Single module identification:

Data-informativity

Single module identifiability:

Relation with diffusively coupled physical networks: