Investigates the class of epidemic algorithms that are commonly used for the lazy
transmission of updates to distributed copies of a database. These algorithms use a simple …

We propose a new protocol for the fundamental problem of disseminating a piece of information
to all members of a group of n players. It builds upon the classical randomized rumor …

… In this paper we analyze the running time of randomized rumor spreading in a dynamic
setting, given by a sequence of graphs G1,G2,... with the same vertex set of size n, but possibly …

In this paper, we provide a detailed comparison between a fully randomized protocol for
rumor spreading on a complete graph and a quasirandom protocol introduced by Doerr, …

… We develop a simple and generic method to analyze randomized rumor spreading processes
in fully connected networks. In contrast to all previous works, which heavily exploit the …

… Abstract We present a tight analysis of the basic randomized rumor spreading process in
complete graphs introduced by Frieze and Grimmett (1985), where in each round of the …

… The problem of randomized rumor spreading was introduced in [13], where the runtime of the
… Randomized rumor spreading in the setting where players correspond to nodes in a graph (…

… We develop a simple and generic method to analyze randomized rumor spreading processes
in fully connected networks. In contrast to all previous works, which heavily exploit the …

… In this work, we propose a quasirandom analogue of the randomized rumor-spreading
algorithm. In this quasirandom model, every vertex is equipped with a cyclic list of its neighbors. If …

… Randomized rumor spreading is an important primitive for information dissemination in
networks and has numerous applications in network science, ranging from spreading information …