0000000000342003

AUTHOR

Donatello Materassi

showing 4 related works from this author

Reduced complexity models in the identification of dynamical networks: Links with sparsification problems

2009

In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…

Approximation theoryMathematical optimizationSettore ING-INF/04 - AutomaticaDynamical systems theoryComputational complexity theoryNode (networking)A priori and a posteriorisparsification compressing sensing estimation networksNetwork topologyGreedy algorithmTopology (chemistry)MathematicsProceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
researchProduct

Relations between structure and estimators in networks of dynamical systems

2011

The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …

Discrete mathematicsTheoretical computer scienceDirected graphStrength of a graphSettore ING-INF/04 - AutomaticaLeast squares approximation Network topology Random variables Stochastic processes TopologyGraph (abstract data type)Graph propertyNull graphRandom geometric graphComplement graphConnectivityMathematicsIEEE Conference on Decision and Control and European Control Conference
researchProduct

OLS Identification of network topologies

2011

Abstract In many applications, it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function where a set of parameters are used to operate a trade-off between accuracy and complexity in the final model. The problem of reducing the complexity is addressed by fixing a certain degree of sparsity and finding the…

Mathematical optimizationtopologyDynamical systems theoryNode (networking)Topology (electrical circuits)topology networks identificationFunction (mathematics)Network topologySet (abstract data type)Identification (information)Settore ING-INF/04 - Automaticatopology; networks; identificationnetworksidentificationA priori and a posterioriMathematicsIFAC Proceedings Volumes
researchProduct

Model Identification of a Network as Compressing Sensing

2013

In many applications, it is important to derive information about the topology and the internal connections of dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology, and unveiling an unknown structure as the estimate of a "sparse Wiener filter". A geometric interpretation of the problem in a pre-Hilbert space for wide-sense stochastic processes is provided. We cast the problem as the optimization of a cost function where a set of parameters are used t…

IdentificationReduced modelTheoretical computer scienceGeneral Computer ScienceDynamical systems theoryComputer scienceNetworkTopology (electrical circuits)Dynamical Systems (math.DS)Systems and Control (eess.SY)Set (abstract data type)symbols.namesakeFOS: MathematicsFOS: Electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringMathematics - Dynamical SystemsMathematics - Optimization and ControlMathematics - General TopologySparsificationMechanical EngineeringWiener filterSystem identificationGeneral Topology (math.GN)Function (mathematics)Compressive sensingIdentification (information)Compressed sensingControl and Systems EngineeringOptimization and Control (math.OC)symbolsIdentification; Sparsification; Reduced models; Networks; Compressive sensingComputer Science - Systems and Control
researchProduct