A dynamical approach to efficient eigenvalue estimation in general multiagent networks
From MaRDI portal
Abstract: We propose a method to efficiently estimate the eigenvalues of any arbitrary (potentially weighted and/or directed) network of interacting dynamical agents from dynamical observations. These observations are discrete, temporal measurements about the evolution of the outputs of a subset of agents (potentially one) during a finite time horizon; notably, we do not require knowledge of which agents are contributing to our measurements. We propose an efficient algorithm to exactly recover the (potentially complex) eigenvalues corresponding to network modes that are observable from the output measurements. The length of the sequence of measurements required by our method to generate a full reconstruction of the observable eigenvalue spectrum is, at most, twice the number of agents in the network, but smaller in practice. The proposed technique can be applied to networks of multiagent systems with arbitrary dynamics in both continuous- and discrete-time. Finally, we illustrate our results with numerical simulations.
Recommendations
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Estimating modes of a complex dynamical network from impulse response data: structural and graph-theoretic characterizations
- Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
- Spectral identification of networks using sparse measurements
- Eigenvector-based intergroup connection of low rank for hierarchical multi-agent dynamical systems
Cites work
- A decentralized algorithm for spectral analysis
- A multivariate generalization of Prony's method
- Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
- Bounds on the spectral radius of digraphs from subgraph counts
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Decentralised minimum-time consensus
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
- Distributed estimation of algebraic connectivity of directed networks
- Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
- Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
- Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs
- Emergence of Scaling in Random Networks
- Graph theoretic methods in multiagent networks
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (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?)
- scientific article; zbMATH DE number 3197115 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Linear systems theory
- Measure-theoretic bounds on the spectral radius of graphs from walks
- Parameter estimation for exponential sums by approximate prony method
- Spectral identification of networks using sparse measurements
- Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
- Synchronization in complex oscillator networks and smart grids
Cited in
(5)- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Eigenvector-based intergroup connection of low rank for hierarchical multi-agent dynamical systems
- Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data
- Estimating modes of a complex dynamical network from impulse response data: structural and graph-theoretic characterizations
- Dynamic periodic event-triggered control of stochastic complex networks with time-varying delays
This page was built for publication: A dynamical approach to efficient eigenvalue estimation in general multiagent networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125529)
