Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
Combinatorics, Probability and Computing
The Diameter of a Scale-Free Random Graph
Combinatorica
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of 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
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
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
IEEE Transactions on Information 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
| Hi-index | 0.00 |
We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barabási and Albert) in time $O(\sqrt{\log n})$ to all but a lower order fraction of the nodes with high probability. This is significantly faster than what synchronized protocols can achieve; an obvious lower bound for these is the average distance, which is known to be Θ(logn/loglogn).