A Network-Flow Based Influence Propagation Model for Social Networks

Due to its popularity, influence propagation model has been recently exploited in several social network applications. However, there are some limitations in applying the model to the social network, in which negative information is propagated. In this paper, we present an effective information propagation model to overcome these limitations. Our minimum cost flow model effectively propagates influences to neighbouring nodes with minimum costs in each path of the social network. The model removes noise associated with social network marketing information and propagates influences without overlapping in information nodes.