Answers are grounded in this paper and cite their sources.
We consider the following advertisement problem in online social networks (OSNs). Given a fixed advertisement investment, e.g., a number of free samples that can be given away to a small number of users, a company needs to determine the probability that users in the OSN will eventually purchase the product. In this paper, we model OSNs as scale-free graphs (either with or without high clustering coefficient). We employ various influence mechanisms that govern the influence spreading in such large-scale OSNs and use the local mean field (LMF) technique to analyze these online social networks wherein states of nodes can be changed by various influence mechanisms. We extend our model for advertising with multiple rating levels. Extensive simulations are carried out to validate our models, which can provide insight on designing efficient advertising strategies in online social networks.
No takes yet. Share an insight, caveat, or question.
Li et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: