Total flooding time and rumor propagation on graphs
Probability
2019-05-28 v1
Abstract
We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be described as a flooding time problem with multiple liquids. For the complete graph we compare the ratio between the expected propagation time for all informations and the corresponding time for a single information, obtaining the asymptotic ratio between them.
Cite
@article{arxiv.1601.07164,
title = {Total flooding time and rumor propagation on graphs},
author = {Darcy Camargo and Serguei Popov},
journal= {arXiv preprint arXiv:1601.07164},
year = {2019}
}
Comments
13 pages, 1 figure