The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Parallel Algorithms for Matrix Computations
Parallel Algorithms for Matrix Computations
Global Information from Local Observation
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Spectral Partitioning of Random Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Fastest Mixing Markov Chain on a Graph
SIAM Review
Matrix approximation and projective clustering via volume sampling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
A tutorial on spectral clustering
Statistics and Computing
Asynchronous distributed averaging on communication networks
IEEE/ACM Transactions on Networking (TON)
Foundations and Trends® in Networking
Accelerated distributed average consensus via localized node state prediction
IEEE Transactions on Signal Processing
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Optimization and analysis of distributed averaging with memory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimization and analysis of distributed averaging with short node memory
IEEE Transactions on Signal Processing
Distributed averaging via lifted Markov chains
IEEE Transactions on Information Theory
Peer-to-peer web search: euphoria, achievements, disillusionment, and future opportunities
From active data management to event-based systems and more
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Distributed social graph embedding
Proceedings of the 20th ACM international conference on Information and knowledge management
Local clustering of large graphs by approximate fiedler vectors
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Computer Science Review
Hi-index | 0.07 |
In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However, traditional centralized approaches for computing eigenvectors struggle with at least two obstacles: the data may be difficult to obtain (both due to technical reasons and because of privacy concerns), and the sheer size of the networks makes the computation expensive. A decentralized, distributed algorithm addresses both of these obstacles: it utilizes the computational power of all nodes in the network and their ability to communicate, thus speeding up the computation with the network size. And as each node knows its incident edges, the data collection problem is avoided as well.Our main result is a simple decentralized algorithm for computing the top k eigenvectors of a symmetric weighted adjacency matrix, and a proof that it converges essentially in O(τMIXlog2 n) rounds of communication and computation, where τMIX is the mixing time of a random walk on the network. An additional contribution of our work is a decentralized way of actually detecting convergence, and diagnosing the current error. Our protocol scales well, in that the amount of computation performed at any node in any one round, and the sizes of messages sent, depend polynomially on k, but not on the (typically much larger) number n of nodes.