Total flooding time and rumor propagation on graphs
Serguei Popov, Darcy Camargo
ARTIGO
Inglês
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...
Ver mais
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.
Ver menos
FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP
2013/23081-6
fechado
Total flooding time and rumor propagation on graphs
Serguei Popov, Darcy Camargo
Total flooding time and rumor propagation on graphs
Serguei Popov, Darcy Camargo
Fontes
|
Journal of statistical physics Vol. 166, no. 6 (Mar., 2017), p. 1558-1571 |