SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Communication complexity of quasirandom rumor spreading
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Rumor spreading in social networks
Theoretical Computer Science
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Random walks, electric networks and the transience class problem of sandpiles
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
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second 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
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Asynchronous rumor spreading in preferential attachment graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
Towards combating rumors in social networks: Models and metrics
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
| Hi-index | 0.00 |
We show that if a connected graph with $n$ nodes has conductance φ then rumour spreading, also known as randomized broadcast, successfully broadcasts a message within ~O(φ-1 • log n), many rounds with high probability, regardless of the source, by using the PUSH-PULL strategy. The ~O(••) notation hides a polylog φ-1 factor. This result is almost tight since there exists graph of n nodes, and conductance φ, with diameter Ω(φ-1 • log n). If, in addition, the network satisfies some kind of uniformity condition on the degrees, our analysis implies that both both PUSH and PULL, by themselves, successfully broadcast the message to every node in the same number of rounds.