Social Networks Spread Rumors in Sublogarithmic Time

Electronic Notes in Discrete Mathematics

Volumn 38, Issue , 2011, Pages 303-308

  Doerr, Benjamin ^a   Fouz, Mahmoud ^b   Friedrich, Tobias ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Preferential attachment; Randomized algorithms; Rumor spreading

Indexed keywords

EID: 82955192520     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2011.09.050     Document Type: Article

References (15)

1. Barabási A.-L., Albert R. Emergence of scaling in random networks. Science 1999, 286:509-512.
2. Bollobás B., Riordan O. Robustness and vulnerability of scale-free random graphs. Internet Mathematics 2003, 1:1-35.
3. Bollobás B., Riordan O. The diameter of a scale-free random graph. Combinatorica 2004, 24:5-34.
4. Bollobás B., Riordan O., Spencer J., Tusnády G. The degree sequence of a scale-free random graph process. Random Structures & Algorithms 2001, 18:279-290.
5. Chierichetti F., Lattanzi S., Panconesi A. Rumor spreading in social networks. 36th International Colloquium on Automata, Languages and Programming (ICALP) 2009, 375-386. Springer.
6. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds for rumour spreading with conductance. In 42nd ACM Symposium on Theory of Computing (STOC), pages 399-408, 2010.
7. C. Cooper and A. M. Frieze. Crawling on web graphs. In 34th ACM Symposium on Theory of Computing (STOC), pages 419-427, 2002.
8. Demers A.J., Greene D.H., Hauser C., Irish W., Larson J., Shenker S., Sturgis H.E., Swinehart D.C., Terry D.B. Epidemic algorithms for replicated database maintenance. Operating Systems Review 1988, 22:8-32.
9. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In 36th Inter. Colloq. on Automata, Languages and Programming (ICALP), pages 366-377, 2009.
10. B. Doerr, M. Fouz, and T. Friedrich. Social networks spread rumors in sublogarithmic time. In 43rd ACM Symposium on Theory of Computing (STOC), 2011. To appear.
11. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 148-157, 2006.
12. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. In ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 148-159, 2003.
13. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 565-574, 2000.
14. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In 17th International conference on World Wide Web (WWW), pages 695-704, 2008.
15. Mihail M., Papadimitriou C., Saberi A. On certain connectivity properties of the internet topology. Journal of Computer and System Sciences 2006, 72:239-251.