Rumor spreading in social networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 375-386

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC MECHANISM; HIGH PROBABILITY; IN-NETWORK; MOBILE NETWORKING; PREFERENTIAL ATTACHMENT MODEL; PREFERENTIAL ATTACHMENTS; SOCIAL NETWORKS;

INFORMATION DISSEMINATION; LINGUISTICS; TRANSLATION (LANGUAGES);

AD HOC NETWORKS;

EID: 70449103321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_31     Document Type: Conference Paper

References (20)

1. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286 (5439), 509-512 (1999)
2. Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the spread of viruses on the internet. In: SODA 2005, pp. 301-310 (2005)
3. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM 2005, pp. 1653-1664 (2005)
4. Bollobás, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Mathematics 1, 1-35 (2003)
5. Bollobás, B., Riordan, O.: Coupling Scale-Free and Classical Random Graphs. Internet Mathematics 1(2) (2003)
6. Bollobás, B., Riordan, O.: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1) (January 2004)
7. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures & Algorithms 18(3) (May 2001)
8. Cooper, C., Frieze, A.M.: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2), 269-290 (2007)
9. 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. In: PODC 1987, pp. 1-12 (1987)
10. Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, Cambridge (2009)
11. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. Random Struct. Algorithms 1(4), 447-460 (1990)
12. Fernholz, D., Ramachandran, V.: The diameter of sparse random graphs. Random Struct. Algorithms 31(4), 482-516 (2007)
13. Flaxman, A., Frieze, A.M., Fenner, T.I.: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics 2(1) (2005)
14. Flaxman, A., Frieze, A.M., Vera, J.: Adversarial deletion in a scale free random graph process. In: SODA 2005, pp. 287-292 (2005)
15. Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10, 57-77 (1985)
16. Mihail, M., Papadimitriou, C.H., Saberi, A.: On Certain Connectivity Properties of the Internet Topology. In: FOCS 2003, pp. 28-35 (2003)
17. Mosk-Aoyama, D., Shah, D.: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory 54(7)
18. Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics 47(1), 213-223 (1987)
19. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom Broadcasting. In: Proceedings of SODA 2008, pp. 773-781 (2008)
20. Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-tolerance. Springer, Heidelberg (2005)