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
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Proceedings of the forty-first annual ACM symposium on Theory of computing
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Cellular traffic offloading through opportunistic communications: a case study
Proceedings of the 5th ACM workshop on Challenged networks
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Rumor spreading in social networks
Theoretical Computer Science
Expansion properties of large social graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
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
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
| Hi-index | 0.02 |
We show that if a connected graph with n nodes has conductance &phis; then rumour spreading, also known as randomized broadcast, successfully broadcasts a message within O(log4 n/&phis;6) many steps, with high probability, using the PUSH-PULL strategy. An interesting feature of our approach is that it draws a connection between rumour spreading and the spectral sparsification procedure of Spielman and Teng [23].