A decentralized algorithm for spectral analysis

DOI10.1016/j.jcss.2007.04.014zbMath1131.68074OpenAlexW2023401026MaRDI QIDQ5920385

David Kempe, Frank McSherry

Publication date: 30 November 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.04.014

zbMATH Keywords

eigenvectorsMarkov chainspectral analysislarge networksdecentralized algorithm

Mathematics Subject Classification ID

Inference from stochastic processes and spectral analysis (62M15) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (17)

A dynamical approach to efficient eigenvalue estimation in general multiagent networks ⋮ Distributed control for large-scale systems with adaptive event-triggering ⋮ Mixing local and global information for community detection in large networks ⋮ A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints ⋮ Distributed estimation of algebraic connectivity of directed networks ⋮ Hearing the clusters of a graph: A distributed algorithm ⋮ Performance-oriented communication topology design for distributed control of interconnected systems ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ Eigenvector Computation and Community Detection in Asynchronous Gossip Models ⋮ Distributed adaptive control of linear multi-agent systems with event-triggered communications ⋮ Unnamed Item ⋮ Cooperative control with distributed gain adaptation and connectivity estimation for directed networks ⋮ Decentralized estimation and control of graph connectivity for mobile sensor 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 ⋮ Algebraic Connectivity Estimation Based on Decentralized Inverse Power Iteration ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization

Uses Software

• Chord

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the perturbation of LU and Cholesky factors
• Authoritative sources in a hyperlinked environment
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On clusterings
• Fastest Mixing Markov Chain on a Graph
• Spectral analysis of data
• Perturbation theory for pseudo-inverses

This page was built for publication: A decentralized algorithm for spectral analysis