Spectral identification of networks using sparse measurements
From MaRDI portal
Abstract: We propose a new method to recover global information about a network of interconnected dynamical systems based on observations made at a small number (possibly one) of its nodes. In contrast to classical identification of full graph topology, we focus on the identification of the spectral graph-theoretic properties of the network, a framework that we call spectral network identification. The main theoretical results connect the spectral properties of the network to the spectral properties of the dynamics, which are well-defined in the context of the so-called Koopman operator and can be extracted from data through the Dynamic Mode Decomposition algorithm. These results are obtained for networks of diffusively-coupled units that admit a stable equilibrium state. For large networks, a statistical approach is considered, which focuses on spectral moments of the network and is well-suited to the case of heterogeneous populations. Our framework provides efficient numerical methods to infer global information on the network from sparse local measurements at a few nodes. Numerical simulations show for instance the possibility of detecting the mean number of connections or the addition of a new vertex using measurements made at one single node, that need not be representative of the other nodes' properties.
Recommendations
- Identification of dynamical networks
- Inferring connectivity of interacting phase oscillators
- Topology identification of heterogeneous networks: identifiability and reconstruction
- Recovering network topologies via Taylor expansion and compressive sensing
- Model identification of a network as compressing sensing
Cites work
- A data-driven approximation of the koopman operator: extending dynamic mode decomposition
- Analysis of Fluid Flows via Spectral Properties of the Koopman Operator
- Can One Hear the Shape of a Drum?
- Collective dynamics of `small-world' networks
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
- Dynamic mode decomposition of numerical and experimental data
- Dynamic mode decomposition with control
- Eigenvalues, diameter, and mean distance in graphs
- Hearing the clusters of a graph: A distributed algorithm
- scientific article; zbMATH DE number 46563 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Inferring network topology from complex dynamics
- Isostables, isochrons, and Koopman spectrum for the action-angle representation of stable fixed point dynamics
- Necessary and Sufficient Conditions for Dynamical Structure Reconstruction of LTI Networks
- On dynamic mode decomposition: theory and applications
- Revealing networks from dynamics: an introduction
- Spectral analysis of nonlinear flows
- Spectral properties of dynamical systems, model reduction and decompositions
- Statistical mechanics of complex networks
- Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
Cited in
(14)- High-dimensional time series prediction using kernel-based koopman mode regression
- Koopman operator framework for time series modeling and analysis
- Koopman-based spectral clustering of directed and time-evolving graphs
- A dynamical approach to efficient eigenvalue estimation in general multiagent networks
- Koopman performance analysis of nonlinear consensus networks
- Relative tempo of distributed averaging on networks
- The role of sparsity in inverse problems for networks with nonlinear dynamics
- Sparse network identifiability via compressed sensing
- State detection from local measurements in network synchronisation processes
- Using global modeling to unveil hidden couplings in small network motifs
- Estimating the Frequency Coupling Matrix From Network Measurements
- Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data
- Blind Identification of Stochastic Block Models from Dynamical Observations
- Two methods to approximate the Koopman operator with a reservoir computer
This page was built for publication: Spectral identification of networks using sparse measurements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967812)
