Model identification of a network as compressing sensing
From MaRDI portal
Abstract: 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 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 solution that "better" satisfies the constraints according to the criterion of approximation. Applications starting from real data and numerical simulations are provided.
Recommendations
- Modeling the topology of a dynamical network via Wiener filtering approach
- Compressive sensing-based topology identification of multilayer networks
- Sparse network identifiability via compressed sensing
- Identification of dynamical networks
- Recovering network topologies via Taylor expansion and compressive sensing
Cites work
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.679
- A Bayesian approach to sparse dynamic network identification
- A modeling approach to multivariate analysis and clusterization theory
- An adaptive routing strategy for packet delivery in complex networks
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Decoding by Linear Programming
- Effects of the network structure and coupling strength on the noise-induced response delay of a neuronal network
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast unfolding of communities in large networks
- Graph theory
- Introduction to Econophysics
- Iteratively reweighted least squares minimization for sparse recovery
- Matching pursuits with time-frequency dictionaries
- Modeling the topology of a dynamical network via Wiener filtering approach
- Orthogonal least squares methods and their application to non-linear system identification
- Statistical analysis of network data. Methods and models
Cited in
(12)- Sparse network identifiability via compressed sensing
- A distributed solution to the network reconstruction problem
- A novel topology identification method based on compressive sensing for multidimensional networks
- Compressive sensing-based topology identification of multilayer networks
- Topology identification of complex delayed dynamical networks with multiple response systems
- Modeling the topology of a dynamical network via Wiener filtering approach
- Spectral identification of networks using sparse measurements
- Mixed \(\ell_2\) and \(\ell_1\)-norm regularization for adaptive detrending with ARMA modeling
- Physics informed topology learning in networks of linear dynamical systems
- An innovative degraded adhesion model for railway vehicles: development and experimental validation
- Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model
- Recovering sparse networks: basis adaptation and stability under extensions
This page was built for publication: Model identification of a network as compressing sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434442)
