Fast distributed algebraic connectivity estimation in large scale networks

DOI10.1016/J.JFRANKLIN.2017.05.021MaRDI QIDQ1661221zbMATH OpenOpenAlexFDO

Authors Eduardo Montijano, J. I. Montijano, Carlos Sagues

Publication date 16 August 2018

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2017.05.021

zbMATH Keywords

distributed algebraic connectivity estimationlarge scale networksundirected communication graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Software, source code, etc. for problems pertaining to systems and control theory (93-04) Decentralized systems (93A14) Large-scale systems (93A15) Algebraic methods (93B25) Estimation and detection in stochastic control theory (93E10)

Recommendations

• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Distributed estimation of algebraic connectivity of directed networks
• Algebraic connectivity estimation based on decentralized inverse power iteration
• Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs
• Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems

Cites work

• A decentralized algorithm for spectral analysis
• Chebyshev Polynomials in Distributed Consensus Applications
• Decentralized estimation and control of graph connectivity for mobile sensor networks
• Decentralized estimation of Laplacian eigenvalues in multi-agent systems
• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Distributed Estimation and Control of Algebraic Connectivity Over Random Graphs
• Distributed estimation of algebraic connectivity of directed networks
• Fast linear iterations for distributed averaging
• Hearing the clusters of a graph: A distributed algorithm
• scientific article; zbMATH DE number 3720254 (Why is no real title available?)
• scientific article; zbMATH DE number 1862742 (Why is no real title available?)
• Optimization and Analysis of Distributed Averaging With Short Node Memory
• Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks

Cited in

(8)

• On algebraic connectivity of directed scale-free networks
• On predefined-time consensus protocols for dynamic 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
• Distributed estimation of algebraic connectivity of directed networks
• Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
• Algebraic connectivity estimation based on decentralized inverse power iteration
• Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems

This page was built for publication: Fast distributed algebraic connectivity estimation in large scale networks

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