Distributed estimation of algebraic connectivity of directed networks

DOI10.1016/J.SYSCONLE.2013.03.002MaRDI QIDQ2434459zbMATH OpenOpenAlexFDO

Authors Chaoyong Li, Zhihua Qu

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

zbMATH Keywords

directed graphalgebraic connectivitypower iterationdistributed estimation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Large-scale systems (93A15) Eigenvalue problems (93B60)

Recommendations

• Algebraic connectivity estimation based on decentralized inverse power iteration
• Fast distributed algebraic connectivity estimation in large scale networks
• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs
• On algebraic connectivity of directed scale-free networks

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 3187885 (Why is no real title available?)
• A decentralized algorithm for spectral analysis
• A survey on distributed estimation and control applications using linear consensus algorithms
• Algebraic connectivity of directed graphs
• Cooperative Control of Dynamical Systems
• Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
• 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
• Graph theoretic methods in multiagent networks
• Nonlinear systems.
• Old and new results on algebraic connectivity of graphs
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• On positive matrices
• The diameter and Laplacian eigenvalues of directed graphs

Cited in

(14)

• The effect of reverse edges on convergence rate of directed weighted chain network
• Distributed accelerating of quantized second-order consensus with bounded input
• Algebraic connectivity estimation based on decentralized inverse power iteration
• Distributed Inference Over Directed Networks: Performance Limits and Optimal Design
• Continuous-time distributed Nash strategy over switching topologies with gain adaptation
• Estimation of Sparse Directional Connectivity With Expectation Maximization
• A dynamical approach to efficient eigenvalue estimation in general multiagent networks
• On algebraic connectivity of directed scale-free networks
• 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
• Robust consensus control with guaranteed rate of convergence using second-order Hurwitz polynomials
• Fast distributed algebraic connectivity estimation in large scale networks
• Distributed source-user estimation over directed graphs
• On predefined-time consensus protocols for dynamic networks

This page was built for publication: Distributed estimation of algebraic connectivity of directed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434459)