Total flooding time and rumor propagation on graphs

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 $3/2$ between them.