2026-07-20T05:07:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3441 2024-03-06T10:34:11Z ddc:004 open_access

Low Randomness Rumor Spreading via Hashing Giakkoupis, George Sauerwald, Thomas Sun, He Woelfel, Philipp Parallel and Distributed Computing Randomness Rumor Spreading We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple push-based protocols, in which nodes choose the neighbor they send the information to in each round using pairwise independent hash functions, or a pseudo-random generator, respectively. For several well-studied topologies our algorithms use exponentially fewer random bits than previous protocols. For example, in complete graphs, expanders, and random graphs only a polylogarithmic number of random bits are needed in total to spread the rumor in O(log n) rounds with high probability. Previous explicit algorithms require Omega(n) random bits to achieve the same round complexity. For complete graphs, the amount of randomness used by our hashing-based algorithm is within an O(log n)-factor of the theoretical minimum determined by [Giakkoupis and Woelfel, 2011]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik George Giakkoupis and Thomas Sauerwald and He Sun and Philipp Woelfel 2012 Is Part Of LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2012.314 urn:nbn:de:0030-drops-34417 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.314 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode