Skip to main content

Learning the News in Social Networks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7153)

Abstract

In social media such as facebook, the most popular desire is to learn the news about other people. In this paper, we study the following problem related to information propagation: Suppose that there is a set U of N users in a social network. They meet online from time to time and share information they know about themselves and the other users in the network. Whenever a group g ⊂ U of users meet, they want to know who has the latest information about every user in U. A naive solution to this problem is to use timestamps. However, there are drawbacks to this scheme including the burden on the users to maintain reliable timestamps and the fact that the timestamps grow unbounded over time. It is natural to ask if it is possible to learn the latest information without using timestamps. We present an efficient method which removes the need to timestamp user information (news). Instead, only the meetings of the groups have to be indexed. Furthermore, we show that this indexing can be performed using a finite set of labels so that each user stores at most O(N 2 logN) bits of information. We also show that this bound can be improved in some cases if we have further information on the topology of the network.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cori, R., Metivier, Y.: Asynchronous Mappings and Asynchronous Cellular Automata. Information and Computation 106, 159–202 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Cori, R., Sopena, E.: Some Combinatorial Aspects of Time-stamp Systems. European Journal of Combinatorics 14, 95–102 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Dolev, D., Shavit, N.: Bounded Concurrent Time-stamps are Constructible. In: Proc. of 21th Annual ACM Symposium on Theory of Computing, pp. 454–466 (1989)

    Google Scholar 

  4. Dwork, C., Waarts, O.: Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Time-stamps are Comprehensible. In: Proc. of 24th Annual ACM Symposium on Theory of Computing, pp. 655–666 (1992)

    Google Scholar 

  5. Fan, W., Geerts, F., Wijsen, J.: Determining the Currency of Data. In: Proc. of the 30th ACM Symposium on Principles of Database Systems, pp. 71–82 (2011)

    Google Scholar 

  6. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18, 319–349 (1988)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Israeli, A., Li, M.: Bounded time-stamps. In: Proc. of 28th IEEE Conference on Foundations of Computer Science, pp. 371–382 (1987)

    Google Scholar 

  8. Lind, P.G., da Silva, L.R., Andrade Jr, J.S., Herrmann, H.J.: Spreading Gossip in Social Networks. Phys. Rev. E 76(3) (2007)

    Google Scholar 

  9. Mukund, M., Sohoni, M.: Keeping Track of the Latest Gossip in a Distributed System. Distributed Computing 10(3), 137–148 (1997)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajagopalan, K., Srinivasan, V., Thomo, A. (2012). Learning the News in Social Networks. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28472-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28471-7

  • Online ISBN: 978-3-642-28472-4

  • eBook Packages: Computer ScienceComputer Science (R0)