Social networks spread rumors in sublogarithmic time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 21-30

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

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

randomized algorithms; rumor spreading; social network

Indexed keywords

COMPUTATION THEORY;

BROADCAST TIME; DOUBLE CONTACTS; HIGH PROBABILITY; PHONE CALLS; PREFERENTIAL ATTACHMENT MODEL; PUSH PULL; RANDOMIZED ALGORITHMS; RUMOR SPREADING;

SOCIAL NETWORKING (ONLINE);

EID: 79959760477     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993640     Document Type: Conference Paper

References (27)

1. A.-L. Barabáasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
2. N. Berger, C. Borgs, J. T. Chayes, and A. Saberi. On the spread of viruses on the internet. In 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 301-310, 2005.
3. B. Bollobáas and O. Riordan. Robustness and vulnerability of scale-free random graphs. Internet Mathemat- ics, 1:1-35, 2003.
4. B. Bollobáas and O. Riordan. Coupling scale-free and classical random graphs. Internet Mathematics, 1:215-225, 2003.
5. B. Bollobáas and O. Riordan. The diameter of a scalefree random graph. Combinatorica, 24:5-34, 2004.
6. B. Bollobáas, O. Riordan, J. Spencer, and G. Tusnády. The degree sequence of a scale-free random graph process. Rand. Struct. & Algo., 18:279-290, 2001.
7. Business Insider. Facebook has more than 600 million users, Goldman tells clients, Jan. 2011. http://read. bi/eIuu3L.
8. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumor spreading in social networks. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 375-386. Springer, 2009.
9. 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.
10. C. Cooper and A. M. Frieze. Crawling on web graphs. In 34th ACM Symposium on Theory of Computing (STOC), pages 419-427, 2002.
11. C. Cooper and A. M. Frieze. The cover time of the preferential attachment graph. Journal of Combinatorial Theory, Series B, 97:269-290, 2007.
12. A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. E. Sturgis, D. C. Swinehart, and D. B. Terry. Epidemic algorithms for replicated database maintenance. Operating Systems Review, 22: 8-32, 1988.
13. 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.
14. 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.
15. R. Elsässer and T. Sauerwald. On the power of memory in randomized broadcasting. In 19th ACM-SIAM Symposium on Discrete Algorithms, pages 218-227, 2008.
16. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1:447-460, 1990.
17. A. D. Flaxman, A. M. Frieze, and J. Vera. Adversarial deletion in a scale-free random graph process. Combinatorics, Probability & Computing, 16:261-270, 2007.
18. N. Fountoulakis and K. Panagiotou. Rumor spreading on random regular graphs and expanders. In 14th Inter. Workshop on Randomization and Comput. (RANDOM), volume 6302 of LNCS, pages 560-573, 2010.
19. A. M. Frieze and G. R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
20. A. M. Frieze and M. Molloy. Broadcasting in random graphs. Discrete Applied Mathematics, 54:77-79, 1994.
21. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. In ACM Inter. Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 148-159, 2003.
22. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In 41st IEEE Sym- posium on Foundations of Computer Science (FOCS), pages 565-574, 2000.
23. J. Krums. Twitter message, 2009. http://twitpic. com/135xa.
24. 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.
25. M. Mihail, C. Papadimitriou, and A. Saberi. On certain connectivity properties of the internet topology. J. Comput. Syst. Sci., 72:239-251, 2006.
26. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47:213-223, 1987.
27. T. Sauerwald. On mixing and edge expansion properties in randomized broadcasting. Algorithmica, 56:51-88, 2010.