Skip to main content
SpringerLink
Log in

Brief Announcement: Detecting Users’ Connectivity on Online Social Networks

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7596))

Included in the following conference series:

  • 686 Accesses

Abstract

We present a heuristic algorithm which leverages the topological properties of social networks to efficiently detect a small subgraph on an OSN which connects a group of target users, particularly from the perspective of a third-party analyst.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

References

  1. Adamic, L., Adar, E.: How to search a social network. Social Networks 27(3), 187–203 (2005)

    Article  Google Scholar 

  2. Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physical Review E 64(4) (2001)

    Google Scholar 

  3. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica 15(2), 141–145 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6(1), 29–123 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Richardson, M., Agrawal, R., Domingos, P.: Trust Management for the Semantic Web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 351–368. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in facebook. In: Proceedings of WOSN (August 2009)

    Google Scholar 

  7. Wilson, C., Boe, B., Sala, A., Puttaswamy, K.P., Zhao, B.Y.: User interactions in social networks and their implications. In: Proceedings of EuroSys (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, University of Texas at Arlington, USA

    Na Li & Sajal K. Das

  2. Computer Science Department, George Washington University, USA

    Nan Zhang

Authors
  1. Na Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sajal K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, 699 South Mill Avenue, 85281, Tempe, AZ, USA

    Andréa W. Richa

  2. Department of Computer Science, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Christian Scheideler

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, N., Das, S.K., Zhang, N. (2012). Brief Announcement: Detecting Users’ Connectivity on Online Social Networks. In: Richa, A.W., Scheideler, C. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2012. Lecture Notes in Computer Science, vol 7596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33536-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33536-5_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33535-8

  • Online ISBN: 978-3-642-33536-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation