Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Foundations and Trends® in Networking
Network computing capacity for the reverse butterfly network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Computing along routes via gossiping
IEEE Transactions on Signal Processing
Distributed averaging via lifted Markov chains
IEEE Transactions on Information Theory
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Epidemic-based information dissemination in wireless mobile sensor networks
IEEE/ACM Transactions on Networking (TON)
Rumor spreading in social networks
Theoretical Computer Science
Asynchronous peer-to-peer data mining with stochastic gradient descent
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fully Distributed Algorithms for Convex Optimization Problems
SIAM Journal on Optimization
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 754.90 |
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in this context. Known iterative algorithms for averaging can be used to compute the normalized values of such functions, but these algorithms do not extend, in general, to the computation of the actual values of separable functions. The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions. The running time of the algorithm is shown to depend on the running time of a minimum computation algorithm used as a subroutine. Using a randomized gossip mechanism for minimum computation as the subroutine yields a complete fully distributed algorithm for computing separable functions. For a class of graphs with small spectral gap, such as grid graphs, the time used by the algorithm to compute averages is of a smaller order than the time required by a known iterative averaging scheme.