Abstract :
Because of the social network has the characteristics of convenient and strong interactivity, information spreading on the social network can at a faster speed. It also makes a lot of false and illegal information spreading uncontrolled. We regard these false and illegal information as rumors. In order to control the rumor transmission in social networks, it is important to find rumor source node. A lot of previous works have studied how to find rumor source node, but most of them based on a conception that the graphs are only unweighted, neglecting the fact that weight plays an important role in graphs. In this paper, we give a weighted rumor centrality algorithm in order to find source node in the network. Specifically, we first give a edge weight definition in the network, and then we give a definition about the node average weight. The last, we confirm the node that have the maximum likelihood monitor as the source node on the weighted networks. Experiments on weighted scale-free networks prove the property of the algorithm.
