Influence Maximization with Trust Relationship in Social Networks

With the wide usage of many electronic devices such as the mobile telephones, the social activities in the mobile terminal have increased greatly. The influence maximization problem is to find a small set of nodes in a mobile social network such that they can make to maximize the spread of influence under the certain models. Existing methods of influence maximization only consider information dissemination, without considering the effectiveness of the transmission probabilities between nodes. We need to ensure the effectiveness of the transmission probabilities to achieve the maximal influence in real applications. We design a new propagation model and propose an effective greedy algorithm for this model. On this basis, we further improve the algorithmic efficiency with dynamic pruning strategy and propose a new estimation technique to accelerate influence evaluation. We demonstrate the effectiveness and efficiency of our algorithms on the two real social networks.