Optimization Problems in Online Social Networks

  • Jie Wang
  • You Li
  • Benyuan Liu
  • Guanling Chen
  • Jun-Hong Cui
Reference work entry


This chapter introduces and elaborates four major issues in online social networks. First, it describes the problem of maximizing the spread of influence in social networks and the problem of computing the spread. It shows that the problem of maximizing influence is NP-hard and the problem of computing the spread is #P-hard. It also presents a number of algorithms for finding approximations to the problem of influence maximization. Second, it describes the problem of detecting network communities and presents a few heuristic algorithms. In particular, it introduces and elaborates a new algorithm that uses random walkers to find communities effectively and efficiently. Third, it discusses how to collect data from online social networks and it presents the recent work on data collection. Forth, it discusses how to measure influence (friendship) in online social networks and elaborates the recent results on the location-based three-layer friendship modeling.


Online Social Network Complementary Cumulative Distribution Function Social Graph Influence Maximization Linear Threshold 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The author “Jie Wang” was supported in part by the NSF under grants CNS-0958477 and CNS-1018422. The author “You Li” was supported in part by the NSF under grant CNS-1018422. The author “Jun-Hong Cui” was supported in part by the US Department of Education under Grants P200A100141 and P200A090342. The author “Benyuan Liu” was supported in part by the NSF under grant CNS-0953620. The author “Guanling Chen” was supported in part by the NSF under grant IIS-0917112.

Recommended Reading

  1. 1.
    Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, H. Jeong, Analysis of topological characteristics of huge online social networking services, in Proceedings of the International World Wide Web Conference (WWW), Banff, 2007Google Scholar
  2. 2.
    L. Becchetti, C. Castillo, D. Donato, A. Fazzone, A comparison of sampling techniques for web graph characterization, in Workshop on Link Analysis: Dynamics and Static of Large Networks (LinkKDD), Philadelphia, 2006Google Scholar
  3. 3.
    F. Benevenuto, T. Rodrigues, M. Cha, V. Almeida, Characterizing user behavior in online social networks, in Proceedings of the ACM SIGCOMM Internet Measurement Conference (IMC), Chicago, 2009Google Scholar
  4. 4.
    R.S. Burt, Positions in networks. Soc. Forces 55, 93–122 (1976)MathSciNetGoogle Scholar
  5. 5.
    J. Caverlee, S. Webb, A large-scale study of MySpace: observations and implications for online social networks, in Proceeding of International Conference on Weblogs and Social Media, Seattle, 2008Google Scholar
  6. 6.
    W. Chen, Y. Wang, S. Yang, Efficient influence maximization in social networks, in KDD, Paris, 2009Google Scholar
  7. 7.
    W. Chen, C. Wang, Y. Wang, Scalable influence maximization for prevalent viral marketing in large scale social networks, in KDD, Washington, DC, 2010Google Scholar
  8. 8.
    W. Chen, Y. Yuan, L. Zhang, Scalable influence maximization in social networks under the linear threshold model, in ICDM, Sydney, 2010Google Scholar
  9. 9.
    T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms (MIT, Cambridge, 2009)MATHGoogle Scholar
  10. 10.
    P. Domingos, M. Richardson, Mining the network value of customers, in KDD, San Diego, 2001Google Scholar
  11. 11.
    W. Gauvin, B. Ribeiro, B. Liu, D. Towsley, J. Wang, Measurement and gender-specific analysis of user publishing characteristics on MySpace. IEEE Netw. 24(5), 38–43 (2010)CrossRefGoogle Scholar
  12. 12.
    W. Gauvin, Providing anonymity for online social network users. Ph.D. Dissertation, Department of Computer Science, University of Massachusetts Lowell, 2011Google Scholar
  13. 13.
    M. Girvan, M.E.J. Newman, Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    M. Gjoka, M. Kurant, C.T. Butts, A. Markopoulou, Walking in Facebook: a case study of unbiased sampling of OSNs, in Proceedings of the IEEE INFOCOM, San Diego, 2010Google Scholar
  15. 15.
    C. Gkantsidis, M. Mihail, A. Saberi, Random walks in peer-to-peer networks, in Proceedings of the IEEE INFOCOM, Hong Kong, 2004Google Scholar
  16. 16.
    J. Goldenberg, B. Libai, E. Muller. Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12(3), 211–223 (2001)CrossRefGoogle Scholar
  17. 17.
    J. Goldenberg, B. Libai, E. Muller, Using complex systems analysis to advance marketing theory development. Acad. Mark. Sci. Rev. 9, 1–19 (2001)Google Scholar
  18. 18.
    W.K. Hastings, Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1), 97–109 (1970)CrossRefMATHGoogle Scholar
  19. 19.
    M.R. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, On near-uniform URL sampling, in Proceedings of the International World Wide Web Conference (WWW), Amsterdam, 2000Google Scholar
  20. 20.
    D. Kempe, J.M. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in KDD, Washington, DC, 2003Google Scholar
  21. 21.
    D. Kempe, J.M. Kleinberg, E. Tardos, Influential nodes in a diffusion model for social networks, in ICALP, Lisbon, 2005Google Scholar
  22. 22.
    B. Krishnamurthy, P. Gill, M. Arlitt, A few chirps about Twitter, in Proceedings of the First Workshop on Online Social Networks (WOSN), Seattle, 2008Google Scholar
  23. 23.
    M. Kumura, K. Saito, Tractable models for information diffusion in social networks, in ECML PKDD, Berlin, 2006Google Scholar
  24. 24.
    M. Kurant, A. Markopoulou, P. Thiran, On the bias of BFS (Breadth-First-Search) sampling, in Proceedings of the 22nd International Teletraffic Congress (ITC’22), Amsterdam, 2010Google Scholar
  25. 25.
    S.H. Lee, P.-J. Kim, H. Jeong, Statistical properties of sampled networks. Phys. Rev. E 73, 102–109 (2006)Google Scholar
  26. 26.
    J. Leskovec, A. Krause, C. Guestrin, C. Faloustos, J. VanBriesen, N.S. Glance, Cost-effective outbreak detection in networks, in KDD, San Jose, 2007Google Scholar
  27. 27.
    N. Li, G. Chen, Multi-layer friendship modeling for location-based mobile social networks, in MobiQuitous, Toronto, 2009Google Scholar
  28. 28.
    Y. Li, Z. Fang, J. Wang, An efficient random-walk algorithm for finding network communities. Technical report, Department of Computer Science, University of Massachusetts, Lowell, 2012Google Scholar
  29. 29.
    L. Lovasz, Random walks on graphs, a survey. Combinatorics 2, 1–46 (1993)MathSciNetGoogle Scholar
  30. 30.
    N. Metropolis, M. Rosenbluth, A. Rosenbluth, A. Teller, E. Teller, Equations of state Calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)CrossRefGoogle Scholar
  31. 31.
    A. Mislove, M. Marcon, K.P. Gummadi, P. Druschel, B. Bhattacharjee, Measurement and analysis of online social networks, in Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07), San Diego, 2007Google Scholar
  32. 32.
    R. Narayanm, Y. Narahari, A shapley value based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8,(1), 130–147 (2011)CrossRefGoogle Scholar
  33. 33.
    G. Nemhauser, L. Wolsey, M. Fisher, An analysis of the approximations for maximizing submodular set functions. Math. Program. 14, 265–294 (1978)MathSciNetCrossRefMATHGoogle Scholar
  34. 34.
    M.E.J. Newman, Detecting community structure in networks. Eur. Phys. J. B 38, 321–330 (2004)CrossRefGoogle Scholar
  35. 35.
    M.E.J. Newman, Modularity and community structure in networks. Technical report, physics/0602124, 2006Google Scholar
  36. 36.
    A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, D. Stutzbach, Respondent-driven sampling for characterizing unstructured overlays, in Proceedings of the IEEE Infocom Mini-Conference, Rio de Janeiro, 2009Google Scholar
  37. 37.
    B. Ribeiro, D. Towsley, Estimating and sampling graphs with multidimensional random walks, in Proceeding of ACM SIGCOMM Internet Measurement Conference (IMC), Melbourne 2010Google Scholar
  38. 38.
    M. Richardson, P. Domingos, Mining knowledge-sharing sites for viral marketing, in Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining, Edmonton, 2002Google Scholar
  39. 39.
    D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, W. Willinger, On unbiased sampling for unstructured peer-to-peer networks, in Proceeding of ACM SIGCOMM Internet Measurement Conference (IMC), Rio de Janeriro, 2006Google Scholar
  40. 40.
    L.G. Valiant, The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)MathSciNetCrossRefMATHGoogle Scholar
  41. 41.
    C. Wilson, B. Boe, A. Sala, K. Puttaswamy, B. Zhao, User interactions in social networks and their implications, in Proceedings of the EuroSys, Nuremberg, 2009Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Jie Wang
    • 1
  • You Li
    • 1
  • Benyuan Liu
    • 1
  • Guanling Chen
    • 1
  • Jun-Hong Cui
    • 2
  1. 1.Department of Computer ScienceUniversity of MassachusettsLowellUSA
  2. 2.Department of Computer Science and EngineeringUniversity of ConnecticutStorrsUSA

Personalised recommendations