skip to main content
10.1145/1400863.1400870acmconferencesArticle/Chapter ViewAbstractPublication PagesdialmConference Proceedingsconference-collections
research-article

Gossiping (via mobile?) in social networks

Published: 18 August 2008 Publication History

Abstract

The study of information dissemination in social networks is an important endeavour, encompassing a variety of questions ranging from the purely technological to the spread of viruses and the diffusion of ideas in human communities. In order to gain insight into these and other related questions, research has proceeded on two fronts. On the one hand, empirical studies have produced a precious data mining activity that has been able to enucleate several important properties of social networks. The advent of the web has made possible sociological studies on a scale that is unprecedented. While Milgram's famous studies on six degrees of separation involved a thousand people, modern replicas with LiveJournal, Email or Instant Messenger involve up to hundreds of millions of people, possibly heralding a new era in the social sciences [11,13,12,10]. A second front of scientific investigation concerns sophisticated mathematical modeling. A lot of activity has been devoted to developing and studying stochastic generative models for social networks that are capable to reproduce some of their salient features. In particular, the so-called preferential attachment model (henceforth PA model), intuitively introduced by Barabasi and Alberts [1] and later precisely formalized and analized by Bollobas et al. [7], is a good representation of social networks in many respects. In this model nodes arrive one after the other. Roughly speaking, when a new node arrives, m nodes are chosen randomly as neighbours, with probability proportional to their degree. The model exhibits the so-called rich-get-richer effect -- if a node has high degree now it is likely to enjoy an even higher degree in the future.
The PA model has been the object of a great deal of rigorous study by a number of authors [2,3,4,6,7,8,9]. It is known that its degree distribution follows a power-law, that its diameter is small (i.e. Θ(log n / log log n), for m ≥ 2), and that its cover time is Θ(n log n). These are all properties enjoyed by social networks. Social networks are likely to play an important role in networking and especially mobile networking in the near future. The advent of high quality mobile devices is expected to turn them into the preferred mode of accessing of the Web-- another momentous development with wide-ranging implications at the technological and societal level. Not only established social networks will be accessed via mobile devices, but new, genuinely mobile applications are likely to sprout. Thus, it seems worthwhile to study how fundamental primitives of information dissemination behave in social networks. This might bring a better understanding at various levels. From a purely networking point of view it might be possible to take advantage of the special structure of social networks and come up with simple and yet highly performing protocols. Gossiping is one of the most fundamental information diffusion primitives. Its simple, basic character makes it useful as a protocol and interesting theoretically, for one can hope to gain insight on more complex phenomena by studying it. This question can be tackled at the experimental level for instance by simulating it on various snapshots of real social networks [14].

References

[1]
. L. Barabási, R. Albert, "Emergence of Scaling in Random Networks", Science 1999, Vol. 286. no. 5439, pp. 509--512.
[2]
. Berger, C. Borgs, J. T. Chaser, A. Saberi, "On the spread of viruses on the internet", SODA 2005: 301--310.
[3]
. P. Boyd, A. Ghosh, B. Prob, D. Shah, "Gossip algorithms: design, analysis and applications", INFOCOM 2005: 1653--1664.
[4]
. Bollobás, O. Riordan, "Robustness and vulnerability of scale-free random graphs", Internet Mathematics 1 (2003), 1--35.
[5]
. Bollobás, O. Riordan, "Coupling Scale-Free and Classical Random Graphs", Internet Mathematics 1(2): (2003).
[6]
. Bollobás, Oliver Riordan, "Coupling Scale-Free and Classical Random Graphs", Internet Mathematics Vol. 1, No. 2: 215--225.
[7]
. Bollobás, O. Riordan, "The Diameter of a Scale-Free Random Graph", Combinatorica, Volume 24, Issue 1 (January 2004).
[8]
B. Bollobás, O. Riordan, J. Spencer, G. Tusnády, "The degree sequence of a scale-free random graph process", Random Structures & Algorithms, Volume 18, Issue 3 (May 2001).
[9]
. Cooper, A. M. Frieze, "The cover time of the preferential attachment graph", J. Comb. Theory, Ser. B 97(2): 269-290 (2007).
[10]
. 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", PODC 1987: 1--12.
[11]
. Flaxman, A. M. Frieze, J. Vera, "Adversarial deletion in a scale free random graph process", SODA 2005: 287--292.
[12]
. Frieze, G. Grimmett, "The shortest-path problem for graphs with random arc-lengths", Discrete Applied Mathematics, 10:57--77, 1985.
[13]
. Feige, D. Peleg, P. Raghavan, E. Upfal, "Randomized Broadcast in Networks", Random Struct. Algorithms 1(4): 447-460 (1990).
[14]
. Fernholz, V. Ramachandran, "The diameter of sparse random graphs", Random Struct. Algorithms 31(4): 482-516 (2007).
[15]
. Mihail, C. H. Papadimitriou, A. Saberi, "On Certain Connectivity Properties of the Internet Topology", FOCS 2003:28-35.
[16]
. Pittel, "On spreading a rumor", SIAM Journal on Applied Mathematics, 47(1):213--223, 1987.
[17]
. Sauerwald, "On Mixing and Edge Expansion Properties in Randomized Broadcasting", ISAAC 2007: 196-207.
[18]
ure Leskovec, Eric Horvitz. Planetary-Scale Views on a Large Instant-Messaging Network.World Wide Web (WWW), 2008.
[19]
.Travers, S. Milgram. An Experimental Study of the Small World Problem. Sociometry, vol. 32 (4), 425--443, 1969
[20]
iben-Nowell, Novak, Kumar, Raghavan, Tomkins. Geographic routing in social networks.Proceedings of the National Academy of Science, 2005
[21]
odds, Muhamad and Watts. An Experimental Study of Search in Global Social Networks.Science, 301, 827--829, 2003
[22]
Lind, da Silva, Andrade, Herrmann.Spreading gossip in social networks. http://arxiv.org/abs/0705.3224v1

Cited By

View all

Index Terms

  1. Gossiping (via mobile?) in social networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    DIALM-POMC '08: Proceedings of the fifth international workshop on Foundations of mobile computing
    August 2008
    100 pages
    ISBN:9781605582443
    DOI:10.1145/1400863
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 August 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. gossiping
    2. social networks

    Qualifiers

    • Research-article

    Conference

    PODC '08

    Acceptance Rates

    DIALM-POMC '08 Paper Acceptance Rate 10 of 35 submissions, 29%;
    Overall Acceptance Rate 21 of 68 submissions, 31%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 24 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media