Abstract
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc and mobile networking. Rumor spreading is one of the basic mechanisms for information dissemination in networks, its relevance stemming from its simplicity of implementation and effectiveness. In this paper, we study the performance of rumor spreading in the classic preferential attachment model of Bollobás et al. which is considered to be a valuable model for social networks. We prove that, in these networks: (a) The standard PUSH-PULL strategy delivers the message to all nodes within O(log2 n) rounds with high probability; (b) by themselves, PUSH and PULL require polynomially many rounds. (These results are under the assumption that m, the number of new links added with each new node is at least 2. If m = 1 the graph is disconnected with high probability, so no rumor spreading strategy can work.) Our analysis is based on a careful study of some new properties of preferential attachment graphs which could be of independent interest.
This research was partially supported by the ENEA project Cresco, by the Italian Ministry of University and Research under Cofin 2006 grant Web Ram and by the Italian-Israelian FIRB project (RBIN047MH9-000).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)
Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the spread of viruses on the internet. In: SODA 2005, pp. 301–310 (2005)
Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM 2005, pp. 1653–1664 (2005)
Bollobás, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Mathematics 1, 1–35 (2003)
Bollobás, B., Riordan, O.: Coupling Scale-Free and Classical Random Graphs. Internet Mathematics 1(2) (2003)
Bollobás, B., Riordan, O.: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1) (January 2004)
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)
Cooper, C., Frieze, A.M.: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2), 269–290 (2007)
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)
Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, Cambridge (2009)
Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. Random Struct. Algorithms 1(4), 447–460 (1990)
Fernholz, D., Ramachandran, V.: The diameter of sparse random graphs. Random Struct. Algorithms 31(4), 482–516 (2007)
Flaxman, A., Frieze, A.M., Fenner, T.I.: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics 2(1) (2005)
Flaxman, A., Frieze, A.M., Vera, J.: Adversarial deletion in a scale free random graph process. In: SODA 2005, pp. 287–292 (2005)
Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10, 57–77 (1985)
Mihail, M., Papadimitriou, C.H., Saberi, A.: On Certain Connectivity Properties of the Internet Topology. In: FOCS 2003, pp. 28–35 (2003)
Mosk-Aoyama, D., Shah, D.: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory 54(7)
Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics 47(1), 213–223 (1987)
Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom Broadcasting. In: Proceedings of SODA 2008, pp. 773–781 (2008)
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-tolerance. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chierichetti, F., Lattanzi, S., Panconesi, A. (2009). Rumor Spreading in Social Networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)