Why rumors spread so quickly in social networks

Authors:
Benjamin Doerr;Mahmoud Fouz;Tobias Friedrich
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany and Saarland University, Saarbrücken, Germany;Rocket Internet, Dubai, U.A.E.;Saarland University, Saarbrücken, Germany and Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
Communications of the ACM
Year:
2012

Citing 16
Cited 3

Epidemic algorithms for replicated database maintenance

ACM SIGOPS Operating Systems Review
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process

Random Structures & Algorithms
Extracting Large-Scale Knowledge Bases from the Web

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph

Combinatorica
On the spread of viruses on the internet

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology

Journal of Computer and System Sciences - Special issue on FOCS 2003
Linked: How Everything Is Connected to Everything Else and What It Means

Linked: How Everything Is Connected to Everything Else and What It Means
Adversarial Deletion in a Scale-Free Random Graph Process

Combinatorics, Probability and Computing
Hamilton cycles in 3-out

Random Structures & Algorithms
Reliable broadcasting in random networks and the effect of density

INFOCOM'10 Proceedings of the 29th conference on Information communications
Rumor spreading in social networks

Theoretical Computer Science
Social networks spread rumors in sublogarithmic time

Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomized gossip algorithms

IEEE Transactions on Information Theory

Strong robustness of randomized rumor spreading protocols

Discrete Applied Mathematics
Possible and necessary winner problem in social polls

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
The effects of (social) media on revolutions: perspectives from egypt and the arab spring

HCI'13 Proceedings of the 15th international conference on Human-Computer Interaction: users and contexts of use - Volume Part III

Quantified Score

Hi-index	48.22

Visualization

Abstract

A few hubs with many connections share with many individuals with few connections.