Affiliation:
1. École Polytechnique, Palaiseau, France
2. Friedrich-Schiller-Universität Jena, Germany
3. University of Cambridge, United Kingdom
Abstract
We propose and analyze a quasirandom analogue of the classical push model for disseminating information in networks (“randomized rumor spreading”). In the classical model, in each round, each informed vertex chooses a neighbor at random and informs it, if it was not informed before. It is known that this simple protocol succeeds in spreading a rumor from one vertex to all others within
O
(log
n
) rounds on complete graphs, hypercubes, random regular graphs, Erdős-Rényi random graphs, and Ramanujan graphs with probability 1 −
o
(1). In the quasirandom model, we assume that each vertex has a (cyclic) list of its neighbors. Once informed, it starts at a random position on the list, but from then on informs its neighbors in the order of the list. Surprisingly, irrespective of the orders of the lists, the above-mentioned bounds still hold. In some cases, even better bounds than for the classical model can be shown.
Funder
German Academic Exchange Service
Deutsche Forschungsgemeinschaft
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Messy Broadcasting in Grid;Algorithms;2024-07-12
2. On Reconstructing the Patient Zero from Sensor Measurements;2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS);2023-07
3. Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts;Studia Logica;2023-01-30
4. Everyone Knows that Everyone Knows;Logic, Epistemology, and the Unity of Science;2021
5. Revisiting Asynchronous Rumor Spreading in the Blockchain Era;2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS);2019-12