Distributed estimation of algebraic connectivity of directed networks
From MaRDI portal
Publication:2434459
DOI10.1016/j.sysconle.2013.03.002zbMath1279.93015OpenAlexW2117285924MaRDI QIDQ2434459
Publication date: 5 February 2014
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2013.03.002
Applications of graph theory (05C90) Eigenvalue problems (93B60) Directed graphs (digraphs), tournaments (05C20) Large-scale systems (93A15)
Related Items
A dynamical approach to efficient eigenvalue estimation in general multiagent networks, Fast distributed algebraic connectivity estimation in large scale networks, The effect of reverse edges on convergence rate of directed weighted chain network, On predefined-time consensus protocols for dynamic networks, Continuous-time distributed Nash strategy over switching topologies with gain adaptation, Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs, Robust consensus control with guaranteed rate of convergence using second-order Hurwitz polynomials, Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The diameter and Laplacian eigenvalues of directed graphs
- Old and new results on algebraic connectivity of graphs
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Fast linear iterations for distributed averaging
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
- Algebraic connectivity of directed graphs
- Cooperative Control of Dynamical Systems
- A decentralized algorithm for spectral analysis
- On positive matrices
