Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Total Flooding Time and Rumor Propagation on Graphs

Full text
Author(s):
Camargo, Darcy ; Popov, Serguei
Total Authors: 2
Document type: Journal article
Source: Journal of Statistical Physics; v. 166, n. 6, p. 1558-1571, MAR 2017.
Web of Science Citations: 0
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. (AU)

FAPESP's process: 13/23081-6 - Percolation and random walks in dependent environments
Grantee:Darcy Gabriel Augusto de Camargo Cunha
Support type: Scholarships in Brazil - Doctorate (Direct)