On Dynamic Top-k Influence Maximization

Hao Wang, Nana Pan, Leong Hou U, Bohan Zhan, Zhiguo Gong

Abstract: This paper studies the top-k influence maximization problem together with network dynamics. We propose an incremental update framework that takes advantage of smoothness of network changes. Experiments show that the proposed method outperforms the straightforward solution by a wide margin.