title: Spreading to localized targets in complex networks.
abstract: As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.
authors.affiliation: School of Systems Science, Beijing Normal University, Beijing 100875, P. R. China.
authors.forename: Ye
authors.initials: Y
authors.lastname: Sun
authors.affiliation: School of Systems Science, Beijing Normal University, Beijing 100875, P. R. China.
authors.forename: Long
authors.initials: L
authors.lastname: Ma
authors.affiliation: School of Systems Science, Beijing Normal University, Beijing 100875, P. R. China.
authors.forename: An
authors.initials: A
authors.lastname: Zeng
authors.affiliation: School of Systems Science, Beijing Normal University, Beijing 100875, P. R. China.
authors.forename: Wen-Xu
authors.initials: WX
authors.lastname: Wang