A dynamical approach to efficient eigenvalue estimation in general multiagent networks
From MaRDI portal
Publication:2125529
DOI10.1016/j.automatica.2022.110234zbMath1485.93201arXiv2007.05340OpenAlexW4220939760MaRDI QIDQ2125529
Mikhail Hayhoe, Victor M. Preciado, Francisco Barreras
Publication date: 14 April 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.05340
Laplacian matrixperiodic controlsparse estimationeigenvalue estimationspectral identificationmultiagent networks
Discrete-time control/observation systems (93C55) Eigenvalue problems (93B60) Multi-agent systems (93A16) Networked control (93B70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decentralised minimum-time consensus
- Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
- A multivariate generalization of Prony's method
- Parameter estimation for exponential sums by approximate prony method
- Laplacian matrices of graphs: A survey
- Measure-theoretic bounds on the spectral radius of graphs from walks
- Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs
- Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
- Distributed estimation of algebraic connectivity of directed networks
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Spectral Identification of Networks Using Sparse Measurements
- Emergence of Scaling in Random Networks
- Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
- Consensus and Cooperation in Networked Multi-Agent Systems
- Bounds on the Spectral Radius of Digraphs from Subgraph Counts
- Synchronization in complex oscillator networks and smart grids
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
- Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
- A decentralized algorithm for spectral analysis
This page was built for publication: A dynamical approach to efficient eigenvalue estimation in general multiagent networks