The String of Diamonds Is Tight for Rumor Spreading

Authors Omer Angel, Abbas Mehrabian, Yuval Peres

Thumbnail PDF


  • Filesize: 486 kB
  • 9 pages

Document Identifiers

Author Details

Omer Angel
Abbas Mehrabian
Yuval Peres

Cite AsGet BibTex

Omer Angel, Abbas Mehrabian, and Yuval Peres. The String of Diamonds Is Tight for Rumor Spreading. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 26:1-26:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


For a rumor spreading protocol, the spread time is defined as the first time that everyone learns the rumor. We compare the synchronous push&pull rumor spreading protocol with its asynchronous variant, and show that for any n-vertex graph and any starting vertex, the ratio between their expected spread times is bounded by O(n^{1/3} log^{2/3} n). This improves the O(sqrt n) upper bound of Giakkoupis, Nazari, and Woelfel (in Proceedings of ACM Symposium on Principles of Distributed Computing, 2016). Our bound is tight up to a factor of O(log n), as illustrated by the string of diamonds graph.
  • randomized rumor spreading
  • push&pull protocol
  • asynchronous time model
  • string of diamonds


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, and Nick Wormald. On the push&pull protocol for rumor spreading. SIAM Journal on Discrete Mathematics, 31(2):647-668, 2017. Available in (conference version in PODC'15). URL:
  2. A. Auffinger, M. Damron, and J. Hanson. 50 years of first passage percolation. arXiv, 1511.03262 [math.PR], 2016. Google Scholar
  3. Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. Randomized gossip algorithms. IEEE Trans. Inform. Theory, 52(6):2508-2530, 2006. URL:
  4. Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC'87, pages 1-12, New York, NY, USA, 1987. ACM. URL:
  5. B. Doerr, M. Fouz, and T. Friedrich. Experimental analysis of rumor spreading in social networks. In Design and analysis of algorithms, volume 7659 of Lecture Notes in Comput. Sci., pages 159-173. Springer, Heidelberg, 2012. URL:
  6. R. Durrett. Stochastic growth models: recent results and open problems. In Mathematical approaches to problems in resource management and epidemiology (Ithaca, NY, 1987), volume 81 of Lecture Notes in Biomath., pages 308-312. Springer, Berlin, 1989. URL:
  7. Uriel Feige, David Peleg, Prabhakar Raghavan, and Eli Upfal. Randomized broadcast in networks. Random Structures Algorithms, 1(4):447-460, 1990. URL:
  8. G. Giakkoupis, Y. Nazari, and P. Woelfel. How asynchrony affects rumor spreading time. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC'16, pages 185-194, New York, NY, USA, 2016. ACM. URL:
  9. J. M. Hammersley and D. J. A. Welsh. First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory, pages 61-110. Springer Berlin Heidelberg, Berlin, Heidelberg, 1965. Google Scholar
  10. S. Janson. Tail bounds for sums of geometric and exponential variables. Available in URL:
  11. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 565-574, 2000. URL:
  12. D. Richardson. Random growth in a tessellation. Proc. Cambridge Philos. Soc., 74:515-528, 1973. Google Scholar