2026-07-20T10:52:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2997 2024-03-06T10:33:42Z ddc:004 open_access

Tight bounds for rumor spreading in graphs of a given conductance Giakkoupis, George conductance rumor spreading We study the connection between the rate at which a rumor spreads throughout a graph and the conductance of the graph -- a standard measure of a graph's expansion properties. We show that for any n-node graph with conductance phi, the classical PUSH-PULL algorithm distributes a rumor to all nodes of the graph in O(phi^(-1) log(n)) rounds with high probability (w.h.p.). This bound improves a recent result of Chierichetti, Lattanzi, and Panconesi [STOC 2010], and it is tight in the sense that there exist graphs where Omega(phi^(-1)log(n)) rounds of the PUSH-PULL algorithm are required to distribute a rumor w.h.p. We also explore the PUSH and the PULL algorithms, and derive conditions that are both necessary and sufficient for the above upper bound to hold for those algorithms as well. An interesting finding is that every graph contains a node such that the PULL algorithm takes O(phi^(-1) log(n)) rounds w.h.p. to distribute a rumor started at that node. In contrast, there are graphs where the PUSH algorithm requires significantly more rounds for any start node. Schloss Dagstuhl – Leibniz-Zentrum für Informatik George Giakkoupis 2011 Is Part Of LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2011.57 urn:nbn:de:0030-drops-29977 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.57 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode