Generic identifiability of subnetworks in a linear dynamic network: the full measurement case
Identifiability conditions for single or multiple modules in a dynamic network specify under which conditions the considered modules can be uniquely recovered from the second-order statistical properties of the measured signals. Conditions for generic identifiability of multiple modules, i.e. a subnetwork, are developed for the situation that all node signals are measured and excitation of the network is provided by both measured excitation signals and unmeasured disturbance inputs. Additionally, the network model set is allowed to contain non-parametrized modules that are fixed, and e.g. reflect modules of which the dynamics are known to the user. The conditions take the form of path-based conditions on the graph of the network model set. Based on these conditions, synthesis results are formulated for allocating external excitation signals to achieve generic identifiability of particular subnetworks. If there are a sufficient number of measured external excitation signals, the formulated results give rise to a generalized indirect type of identification algorithm that requires only the measurement of a subset of the node signals in the network.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 iden…
Neural network identifiability for a family of sigmoidal nonlinearities
This paper addresses the following question of neural network identifiability: Does the input-output map realized by a feed-forward neural network with respect to a given nonlinearity uniquely specify the network archite…
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Motivated by theoretical problems in deep learning, we conjecture that post-composing a fixed number of pairwise distinct nonconstant polynomials with a generic polynomial of sufficiently large degree yields linearly ind…
Identifying circular orders for blobs in phylogenetic networks
Interest in the inference of evolutionary networks relating species or populations has grown with the increasing recognition of the importance of hybridization, gene flow and admixture, and the availability of large-scal…
Identifiability of dynamic networks: the essential rôle of dources and dinks
The paper [1] presented the first results on generic identifiability of dynamic networks with partial excitation and partial measurements, i.e. networks where not all nodes are excited or not all nodes are measured. One …
Allvalid