Quasirandom Rumor Spreading
ACM Transactions on Algorithms
MetadataShow full item record
Doerr, B., Friedrich, T., & Sauerwald, T. (2014). Quasirandom Rumor Spreading. ACM Transactions on Algorithms, 11 (2), 1-35. https://doi.org/10.1145/2650185
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, Erdos-R enyi random graph 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.
External DOI: https://doi.org/10.1145/2650185
This record's URL: https://www.repository.cam.ac.uk/handle/1810/287347