This works explores and illustrates recent results developed by the author in field of dynamical network analysis. The considered approach is blind, i.e., no a priori assumptions on the interconnected systems are available. Moreover, the perspective is that of a simple "observer" who can perform no kind of test on the network in order to study the related response, that is no action or forcing input aimed to reveal particular responses of the system can be performed. In such a scenario a frequency based method of investigation is developed to obtain useful insights on the network. The information thus derived can be fruitfully exploited to build acyclic graphical models, which can be seen as extension of Bayesian Networks or Markov Chains. Moreover, it is shown that the topology of polytree linear networks can be exactly identified via the same mathematical tools. In this respect, it is worth observing that important real systems, such as all the transportation networks, fit this class.

A frequency approach to topological identification and graphical modeling / Innocenti, Giacomo. - ELETTRONICO. - (2011), pp. 0-0. (Intervento presentato al convegno Automatica.it - Convegno Annuale dei Docenti e Ricercatori Italiani in Automatica tenutosi a Pisa, Italia nel 2011).

A frequency approach to topological identification and graphical modeling

INNOCENTI, GIACOMO
2011

Abstract

This works explores and illustrates recent results developed by the author in field of dynamical network analysis. The considered approach is blind, i.e., no a priori assumptions on the interconnected systems are available. Moreover, the perspective is that of a simple "observer" who can perform no kind of test on the network in order to study the related response, that is no action or forcing input aimed to reveal particular responses of the system can be performed. In such a scenario a frequency based method of investigation is developed to obtain useful insights on the network. The information thus derived can be fruitfully exploited to build acyclic graphical models, which can be seen as extension of Bayesian Networks or Markov Chains. Moreover, it is shown that the topology of polytree linear networks can be exactly identified via the same mathematical tools. In this respect, it is worth observing that important real systems, such as all the transportation networks, fit this class.
2011
arXiv.org
Automatica.it - Convegno Annuale dei Docenti e Ricercatori Italiani in Automatica
Pisa, Italia
2011
Innocenti, Giacomo
File in questo prodotto:
File Dimensione Formato  
Automatica_it2011_arXiv.pdf

Accesso chiuso

Descrizione: Pre-print
Tipologia: Altro
Licenza: Tutti i diritti riservati
Dimensione 1.2 MB
Formato Adobe PDF
1.2 MB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/806505
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact