Rumor Spreading on Percolation Graphs
Probability
2011-10-06 v1 Discrete Mathematics
Abstract
We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph G_p. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + \epsilon)T rounds are needed to spread the rumor in the graph G_p when T = o(pd).
Keywords
Cite
@article{arxiv.1110.1044,
title = {Rumor Spreading on Percolation Graphs},
author = {Roberto I. Oliveira and Alan Prata},
journal= {arXiv preprint arXiv:1110.1044},
year = {2011}
}