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\) is a set of edges with size m, and \(w : E \rightarrow [0,1]\) is the set of all w(u, v) which is the weight of edge (u, v).
Independent Cascade (IC) and Linear Threshold (LT) Models
The IC and LT models [1] are two basic models of influence diffusion in social networks, and there are two vertex stages: inactive and active. The...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: ACM KDD ’03, Washington, DC, pp 137–146
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–1306
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math Program 14(1):265–294
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–471
Kiefer L (1953) Sequential minimax search for a maximum. In: Proceedings of the American mathematical society, pp 502–206
Domingos P, Richardson M (2001) Mining the network value of customers. In: ACM KDD ’01, San Francisco, pp 57–66
Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: ACM KDD ’02, Edmonton, pp 61–70
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–628
Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. In: ACM WWW ’08, Beijing, pp 189–198
Arthur D, Motwani R, Sharma A, Xu Y (2009) Pricing strategies for viral marketing on social networks. In: CoRR. abs/0902.3485
Lu W, Lakshmanan LVS (2012) Profit maximization over social networks. In: IEEE ICDM ’12, Brussels
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Zhu, Y., Wu, W. (2016). Influence and Profit. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_624
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_624
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering