Rumor Spreading in Random Evolving Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Random Structures and Algorithms Year : 2016

Rumor Spreading in Random Evolving Graphs


We analyze randomized broadcast in dynamic networks modeled as edge-Markovian evolving graphs. We prove that, for the practically relevant case in which the birth rate p = \Omega (1 / n), and the dead rate q is constant, randomized broadcast completes w.h.p. in O(log n) time steps. Our result provides the first formal argument demonstrating the robustness of the “push” protocol against network changes.
Fichier principal
Vignette du fichier
rsa2016.pdf (308.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01390133 , version 1 (14-11-2016)



Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, et al.. Rumor Spreading in Random Evolving Graphs. Random Structures and Algorithms, 2016, 48 (2), pp.290-312. ⟨10.1002/rsa.20586⟩. ⟨hal-01390133⟩
229 View
244 Download



Gmail Facebook X LinkedIn More