Fast distributed algebraic connectivity estimation in large scale networks
DOI10.1016/j.jfranklin.2017.05.021zbMath1395.93064OpenAlexW2619888827MaRDI QIDQ1661221
Juan I. Montijano, Eduardo 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
Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Estimation and detection in stochastic control theory (93E10) Decentralized systems (93A14) Algebraic methods (93B25) Large-scale systems (93A15) Software, source code, etc. for problems pertaining to systems and control theory (93-04)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hearing the clusters of a graph: A distributed algorithm
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- 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
- Fast linear iterations for distributed averaging
- Optimization and Analysis of Distributed Averaging With Short Node Memory
- Chebyshev Polynomials in Distributed Consensus Applications
- Distributed Estimation and Control of Algebraic Connectivity Over Random Graphs
- Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
- A decentralized algorithm for spectral analysis
This page was built for publication: Fast distributed algebraic connectivity estimation in large scale networks
