Rumor spreading in social networks

Theoretical Computer Science

Volumn 412, Issue 24, 2011, Pages 2602-2610

  Chierichetti, Flavio ^a   Lattanzi, Silvio ^b   Panconesi, Alessandro ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Preferential attachment; Rumour spreading

Indexed keywords

INFORMATION DISSEMINATION; SOCIAL NETWORKING (ONLINE);

BASIC MECHANISM; HIGH PROBABILITY; IN NETWORKS; MOBILE NETWORKING; PREFERENTIAL ATTACHMENT MODEL; PREFERENTIAL ATTACHMENTS; RUMOR SPREADING; RUMOUR SPREADING;

MOBILE AD HOC NETWORKS;

EID: 84950170865     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.11.001     Document Type: Article

References (23)

1. A.L. Barabsi, and R. Albert Emergence of scaling in random networks Science 286 5439 1999 509 512
2. N. Berger, C. Borgs, J.T. Chayes, A. Saberi, On the spread of viruses on the internet, in: Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2005, pp. 301310. (Pubitemid 40851385)
3. S.P. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Gossip algorithms: design, analysis and applications, in: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, pp. 16531664. (Pubitemid 41390681)
4. B. Bollobs, and O. Riordan Robustness and vulnerability of scale-free random graphs Internet Mathematics 1 1 2003 1 35
5. B. Bollobs, and O. Riordan Coupling scale-free and classical random graphs Internet Mathematics 1 2 2003 215 225
6. B. Bollobs, and O. Riordan The diameter of a scale-free random graph Combinatorica 24 1 2004 5 34 (Pubitemid 38706499)
7. B. Bollobs, O. Riordan, J. Spencer, and G. Tusndy The degree sequence of a scale-free random graph process Random Structures & Algorithms 18 3 2001 279 290
8. C. Cooper, and A.M. Frieze The cover time of the preferential attachment graph Journal of Combinatorial Theory. Series B 97 2 2007 269 290
9. Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, Almost tight bounds for rumour spreading with conductance, in: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010.
10. Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, Rumour spreading and graph conductance, in: Proceedings of the 21st ACMSIAM Symposium on Discrete Algorithms, SODA 2010.
11. A.J. Demers, D.H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H.E. Sturgis, D.C. Swinehart, D.B. Terry, Epidemic algorithms for replicated database maintenance, in: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 1987, pp. 112.
12. B. Doerr, T. Friedrich, T. Sauerwald, Quasirandom rumor spreading, in: Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2008, pp. 773781.
13. D. Dubhashi, and A. Panconesi Concentration of Measure for the Analysis of Randomised Algorithms 2009 Cambridge University Press
14. U. Feige, D. Peleg, P. Raghavan, and E. Upfal Randomized broadcast in networks Random Structures & Algorithms 1 4 1990 447 460
15. D. Fernholz, and V. Ramachandran The diameter of sparse random graphs Random Structures & Algorithms 31 4 2007 482 516
16. A. Flaxman, A.M. Frieze, and T.I. Fenner High degree vertices and eigenvalues in the preferential attachment graph Internet Mathematics 2 1 2005 1 19
17. A. Flaxman, A.M. Frieze, J. Vera, Adversarial deletion in a scale free random graph process, in: Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2005, pp. 287292. (Pubitemid 40851383)
18. A. Frieze, and G. Grimmett The shortest-path problem for graphs with random arc-lengths Discrete Applied Mathematics 10 1987 57 77
19. J. Hromkovic, R. Klasing, A. Pelc, and P. Ruzicka Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-tolerance 2005 Springer-Verlag
20. N. Johnson, and S. Kotz Urn Models and Their Applications: An Approach to Modern Discrete Probability Theory 1977 Wiley New York
21. M. Mihail, C.H. Papadimitriou, A. Saberi, On certain connectivity properties of the internet topology, in: Proceedings of the 44th Symposium on Foundations of Computer Science, FOCS 2003, pp. 2835.
22. D. Mosk-Aoyama, and D. Shah Fast distributed algorithms for computing separable functions IEEE Transactions on Information Theory 54 7 2008 2997 3007
23. B. Pittel On spreading a rumor SIAM Journal on Applied Mathematics 47 1 1987 213 223