Please use this identifier to cite or link to this item:
|Title:||Total Flooding Time And Rumor Propagation On Graphs|
|Abstract:||We study the discrete time version of the flooding time problem as a model of rumor propagation where each site in the graph has initially a distinct piece of information; we are interested in the number of "conversations" before the entire graph knows all pieces of information. For the complete graph we compare the ratio between the expected propagation time for all pieces of information and the corresponding time for a single piece of information, obtaining the asymptotic ratio 3 / 2 between them.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.