Diffusing information for mobile social networks under consideration of dynamic influence

Abstract

As the developments of new techniques, mobile social networks have been built wildly. To obtain and spread information over mobile social networks efficiently, the influence maximization problem is to find a seed nodes set with limited size such that it can influence as many nodes as possible. Previous works ignore the dynamic influence phenomenon of diffusing information on mobile social networks. In this article, we propose a new model to express the procedure of diffusing information under the existence of dynamic influence. Theoretical analysis shows that the influence maximization problem under new model is non-deterministic polynomial-time hard, and efficient approximation algorithm is proposed. Experimental studies on real data sets show that the new model can process dynamic influence well in the diffusing information procedure, and the proposed algorithms can solve the influence maximization problem on new model efficiently.

Sustainable Diffusion of Fashion Information on Mobile Friends-Based Social Network Service

“…A social network is defined as a complex network in which nodes indicate people or other entities in a social context and the links represent any type of relationship among them, like friendship, kinship, collaboration or others [67]. People are using more online social applications in mobile environments as the size and power of smart mobile devices increase and traditional social networks have transformed to be mobile social networks with more practical use [68]. Similarly, mobile social networks are defined as the networks where individuals with similar interests communicate and connect with each other through their mobile phones and/or tablets [69,70].…”