Rumor Spreading on Random Regular Graphs and Expanders

@inproceedings{Fountoulakis2010RumorSO,
title={Rumor Spreading on Random Regular Graphs and Expanders},
author={Nikolaos Fountoulakis and Konstantinos Panagiotou},
booktitle={APPROX-RANDOM},
year={2010}
}

Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some piece of information. In each round, every one of the informed nodes chooses independently a neighbor uniformly at random and transmits the message to it. In this paper we consider random networks where each vertex has degree d ≥ 3, i.e., the underlying graph is… CONTINUE READING