arXiv subjects

Eduardo Mapurunga

Publications and source records attributed to Eduardo Mapurunga.

7 recordsLinked to original sources

arXiv2026

Optimal excitation and measurement patterns for networks with tree topology

In this work we evaluate the excitation and measurement patterns (EMP) for networks with tree topology. We investigate guidelines for the selection of the minimal EMPs, i.e. those with the least number of excited and measured nodes combined, for which the accuracy obtained, in terms of the trace of the asymptotic covariance matrix, is optimal. We introduce the concept of partial information matrix as a means to systematically obtain the information matrix for any dynamic network. For a specific tree class, called cross, we show that the accuracy of a particular module depends on the magnitude of the parameters to be estimated. Furthermore, when all factors are equal, it is best to excite. %we show that for small magnitudes of this parameter, it is best to excite. We extend a topological condition for branches under which the accuracy of a particular module of the network is independent of the other parameters from the tree. We provide a numerical analysis showing that our guidelines could be used as a selection tool for minimal EMPs for tree networks.

physics.soc-ph↗

arXiv2024

Extending identifiability results from isolated networks to embedded networks

This paper deals with the design of Excitation and Measurement Patterns (EMPs) for the identification of dynamical networks, when the objective is to identify only a subnetwork embedded in a larger network. Recent results have shown how to construct EMPs that guarantee identifiability for a range of networks with specific graph topologies, such as trees, loops, or Directed Acyclic Graphs (DAGs). However, an EMP that is valid for the identification of a subnetwork taken in isolation may no longer be valid when that subnetwork is embedded in a larger network. Our main contribution is to exhibit conditions under which it does remain valid, and to propose ways to enhance such EMP when these conditions are not satisfied.

eess.SY↗

arXiv2022

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 key contribution of that paper was to establish a set of necessary conditions on the excitation and measurement pattern (EMP) that guarantee generic identifiability. In a nutshell, these conditions established that all sources must be excited and all sinks measured, and that all other nodes must be either excited or measured. In the present paper, we show that two other types of nodes, which are defined by the local topology of the network, play an essential rôle in the search for a valid EMP, i.e. one that guarantees generic identifiability. We have called these nodes dources and dinks. We show that a network is generically identifiable only if, in addition to the above mentioned conditions, all dources are excited and all dinks are measured. We also show that sources and dources are the only nodes in a network that always need to be excited, and that sinks and dinks are the only nodes that need to be measured for an EMP to be valid.

eess.SY↗

arXiv2022

Excitation and Measurement Patterns for the Identifiability of Directed Acyclic Graphs

This paper deals with the design of Excitation and Measurement Patterns (EMP) for the identification of a class of dynamical networks whose topology has the structure of a Directed Acyclic Graph (DAG). In addition to the by now well known condition that the identifiabiltiy of any dynamical network requires that the sources be excited, the sinks be measured, and all other nodes be either excited or measured, we show that for DAGs two other types of nodes have special excitation and measurement requirements. Armed with this result, we propose a systematic procedure for the design of EMPs that guarantee identifiability of a network with DAG topology.

eess.SY↗

arXiv2021

Necessary and sufficient conditions for the identifiability of isolated loops

This Letter provides necessary and sufficient conditions on the excitation and measurement pattern (EMP) that guarantee identifiability of a dynamical network that has the structure of a loop. The conditions are extremely simple in their formulation, and they can be checked by visual inspection. They allow one to easily characterize all EMPs that make the loop network identifiable.

eess.SY↗

arXiv2021

Optimal excitation and measurement pattern for cascade networks

This work deals with accuracy analysis of dynamical systems interconnected in a cascade structure. For a cascade network there are a number of experimental settings for which the dynamic systems within the network can be identified. We study the problem of choosing which excitation and measurement pattern delivers the most accurate parameter estimates for the whole network. The optimal experiment is based on the accuracy assessed through the asymptotic covariance matrix of the prediction error method, while the cost criterion is the number of excitations and measurements. We develop theoretical results under the assumptions that all dynamic systems are equal and with equal signal-to-noise ratio throughout the network. We show that there are experimental settings which result in equal overall precision and that there is an excitation and measurement pattern that yields more accurate results than others. From these results a guideline based on the topology of the network emerges for the choice of the experimental setting. We provide numerical results which attest that the principles behind this guideline are also valid for more general situations.

eess.SY↗

arXiv2020

Optimal allocation of excitation and measurement for identification of dynamic networks

In this paper, the problem of choosing the best allocation of excitations and measurements for the identification of a dynamic network is formally stated and analyzed. The best choice will be one that achieves the most accurate identification with the least costly experiment. Accuracy is assessed by the trace of the asymptotic covariance matrix of the parameters estimates, whereas the cost criterion is the number of excitations and measurements. Analytical and numerical results are presented for two classes of dynamic networks in state space form: branches and cycles. From these results, a number of guidelines for the choice emerge, which are based either on the topology of the network or on the relative magnitude of the modules being identified. An example is given to illustrate that these guidelines can to some extent be applied to networks of more generic topology.

math.OC↗