A decentralized algorithm for spectral analysis
From MaRDI portal
Publication:5901077
DOI10.1145/1007352.1007438zbMath1192.68848OpenAlexW2158886595MaRDI QIDQ5901077
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007438
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Distributed algorithms (68W15)
Related Items (10)
Fast distributed algebraic connectivity estimation in large scale networks ⋮ Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ Step-by-step community detection in volume-regular graphs ⋮ Asynchronous privacy-preserving iterative computation on peer-to-peer networks ⋮ Graph clustering ⋮ Target control and source estimation metrics for dynamical networks ⋮ Analysis of randomized protocols for conflict-free distributed access ⋮ A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization ⋮ Distributed user profiling via spectral methods
This page was built for publication: A decentralized algorithm for spectral analysis
