Social networks spread rumors in sublogarithmic time
From MaRDI portal
Publication:5419071
DOI10.1145/1993636.1993640zbMath1288.68112OpenAlexW2052605628MaRDI QIDQ5419071
Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993640
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18)
Related Items (19)
The Small Community Phenomenon in Networks: Models, Algorithms and Applications ⋮ Randomised broadcasting: memory vs. randomness ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ Rumors Spread Slowly in a Small-World Spatial Network ⋮ Push is Fast on Sparse Random Graphs ⋮ Rumor Spreading with No Dependence on Conductance ⋮ Membership(s) and compliance(s) with class-based graphs ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Faster rumor spreading with multiple calls ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Discovery Through Gossip ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Rumor-propagation model with consideration of refutation mechanism in homogeneous social networks ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Robustness of randomized rumour spreading ⋮ Accelerated information dissemination on networks with local and global edges
This page was built for publication: Social networks spread rumors in sublogarithmic time
