Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Influence and Profit

  • Yuqing ZhuEmail author
  • Weili Wu
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_624

Years and Authors of Summarized Original Work

  • 2003; Kempe, Kleinberg, Tardos

  • 2013; Zhu, Lu, Bi, Wu, Jiang, Li

Problem Definition

A social network is a graph of relationships and interactions within a set of individuals. Information can spread within a social network by “word-of-mouth” effects. In other words, information diffuses from individuals to individuals in a social network through the connections between them, and if some information is spread by some initial individuals, many individuals may believe in it due to information diffusion. A social network is denoted as G=(V, E, w), where V is a set of vertexes with size n, \(E \subseteq V \times V\)

Keywords

Data mining Influence Profit Social networks Viral marketing 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: ACM KDD ’03, Washington, DC, pp 137–146Google Scholar
  2. 2.
    Zhu Y, Lu Z, Bi Y, Wu W, Jiang Y, Li D (2013) Influene and profit: two sizes of the coin. In: IEEE ICDM ’13, Dallas, 1301–1306Google Scholar
  3. 3.
    Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math Program 14(1):265–294MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Feige U, Mirrokni VS, Vondrák J (2007) Maximizing non-monotone submodular functions. In: IEEE symposium on foundations of computer science (FOCS’07), Providence, pp 461–471Google Scholar
  5. 5.
    Kiefer L (1953) Sequential minimax search for a maximum. In: Proceedings of the American mathematical society, pp 502–206zbMATHGoogle Scholar
  6. 6.
    Domingos P, Richardson M (2001) Mining the network value of customers. In: ACM KDD ’01, San Francisco, pp 57–66Google Scholar
  7. 7.
    Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: ACM KDD ’02, Edmonton, pp 61–70Google Scholar
  8. 8.
    Kleinberg R, Leighton T (2003) The value of knowing a demand curve: bounds on regret for online posted-price auctions. In: IEEE FOCS ’03, Cambridge, pp 594–628Google Scholar
  9. 9.
    Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. In: ACM WWW ’08, Beijing, pp 189–198Google Scholar
  10. 10.
    Arthur D, Motwani R, Sharma A, Xu Y (2009) Pricing strategies for viral marketing on social networks. In: CoRR. abs/0902.3485Google Scholar
  11. 11.
    Lu W, Lakshmanan LVS (2012) Profit maximization over social networks. In: IEEE ICDM ’12, BrusselsGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceCalifornia State UniversityLos AngelesUSA
  2. 2.Department of Computer ScienceThe University of Texas at DallasTXUSA
  3. 3.College of Computer Science and TechnologyTaiyuan University of TechnologyTaiyuanChina
  4. 4.Department of Computer ScienceCalifornia State UniversityLos AngelesUSA
  5. 5.Department of Computer ScienceThe University of Texas at DallasTXUSA