Please use this identifier to cite or link to this item:
Type: Artigo
Title: Total Flooding Time And Rumor Propagation On Graphs
Author: Camargo
Darcy; Popov
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.
Subject: Rumor Propagation
Flooding Time
Complete Graph
First-passage Percolation
Coupon Collector
Editor: Springer
New York
Rights: fechado
Identifier DOI: 10.1007/s10955-017-1731-0
Date Issue: 2017
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000395515500010.pdf466.83 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.