Excitation allocation for generic identifiability of linear dynamic networks with fixed modules

Identifiability of linear dynamic networks requires the presence of a sufficient number of external excitation signals. The problem of allocating a minimal number of external signals for guaranteeing generic network identifiability in the full measurement case has been recently addressed in the literature. Here we will extend that work by...

Task-Aware Connectivity Learning for Incoming Nodes Over Growing Graphs

Data processing over graphs is usually done on graphs of fixed size. However, graphs often grow with new nodes arriving over time. Knowing the connectivity information of these nodes, and thus, the expanded graph is crucial for processing data over the expanded graph. In its absence, its inference and the subsequent data processing become...