A review of two decades of correlations, hierarchies, networks and clustering in financial markets
We review the state of the art of clustering financial time series and the study of their
correlations alongside other interaction networks. The aim of the review is to gather in one …
correlations alongside other interaction networks. The aim of the review is to gather in one …
On the problem of reconstructing an unknown topology via locality properties of the wiener filter
Determining interrelatedness structure of various entities from multiple time series data is of
significant interest to many areas. Knowledge of such a structure can aid in identifying cause …
significant interest to many areas. Knowledge of such a structure can aid in identifying cause …
Topology identification of directed dynamical networks via power spectral analysis
We address the problem of identifying the topology of an unknown weighted, directed
network of LTI systems stimulated by wide-sense stationary noises of unknown power …
network of LTI systems stimulated by wide-sense stationary noises of unknown power …
Identification of network components in presence of unobserved nodes
The paper tackles the problem of identifying an individual transfer function in a network of
linear dynamical systems in the presence of loops under the assumptions that (i) only a …
linear dynamical systems in the presence of loops under the assumptions that (i) only a …
Data-driven network resource allocation for controlling spreading processes
We propose a mathematical framework, based on conic geometric programming, to control a
susceptible-infected-susceptible viral spreading process taking place in a directed contact …
susceptible-infected-susceptible viral spreading process taking place in a directed contact …
Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs
In this article, the optimal sample complexity of learning the underlying interactions or
dependencies of a Linear Dynamical System (LDS) over a Directed Acyclic Graph (DAG) is …
dependencies of a Linear Dynamical System (LDS) over a Directed Acyclic Graph (DAG) is …
Model identification of a network as compressing sensing
In many applications, it is of interest to derive information about the topology and the internal
connections of multiple dynamical systems interacting together. Examples can be found in …
connections of multiple dynamical systems interacting together. Examples can be found in …
Robust boosting for learning from few examples
L Wolf, I Martin - 2005 IEEE Computer Society Conference on …, 2005 - ieeexplore.ieee.org
We present and analyze a novel regularization technique based on enhancing our dataset
with corrupted copies of our original data. The motivation is that since the learning algorithm …
with corrupted copies of our original data. The motivation is that since the learning algorithm …
Graph-theoretic identification of dynamic networks
S Jahandari - 2022 - search.proquest.com
In this dissertation we take a graph-theoretic approach to address different aspects of
identification of dynamic networks. We consider a class of networks where each node is …
identification of dynamic networks. We consider a class of networks where each node is …
Reconstruction of directed networks from consensus dynamics
This paper addresses the problem of identifying the topology of an unknown, weighted,
directed network running a consensus dynamics. We propose a methodology to reconstruct …
directed network running a consensus dynamics. We propose a methodology to reconstruct …