Towards Information Diffusion in Mobile Social Networks

Towards Information Diffusion in Mobile Social Networks

Abstract— Towards Information Diffusion in Mobile Social Networks. The emerging of mobile social networks opens opportunities for viral marketing. However, before fully utilizing mobile social networks as a platform for viral marketing, many challenges have to be addressed. In this paper, we address the < Final Year Projects 2016 > of identifying a small number of individuals through whom the information can be diffused to the network as soon as possible, referred to as the diffusion minimization problem. Diffusion minimization under the probabilistic diffusion model can be formulated as an asymmetric k center problem which is NP-hard, and the best known approximation algorithm for the asymmetric k-center problem has approximation ratio of log * n and time complexity O(n 5). Clearly, the performance and the time complexity of the approximation algorithm are not satisfiable in large-scale mobile social networks.