Rumor Spreading and Conductance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of the ACM (JACM) Year : 2018

Rumor Spreading and Conductance


In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance φ then, with high probability, PUSH-PULL will deliver the message to all nodes in the graph within O(log n/φ) many communication rounds. This bound is best possible. We also give an alternative proof that the completion time of PUSH-PULL is bounded by a polynomial in log n/φ, based on graph sparsification. Although the resulting asymptotic bound is not optimal, this proof shows an interesting and, at the outset, unexpected connection between rumor spreading and graph sparsification. Finally, we show that if the degrees of the two endpoints of each edge in the network differ by at most a constant factor, then both PUSH and PULL alone attain the optimal completion time of O(log n/φ), with high probability.
Fichier principal
Vignette du fichier
jacm2018RSconductance.pdf (430.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01942162 , version 1 (03-12-2018)



Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi. Rumor Spreading and Conductance. Journal of the ACM (JACM), 2018, 65 (4), pp.17:1-17:21. ⟨10.1145/3173043⟩. ⟨hal-01942162⟩
76 View
363 Download



Gmail Facebook X LinkedIn More