Extended methods for influence maximization in dynamic networks

The process of rumor spreading among people can be represented as information diffusion in social network. The scale of rumor spread changes greatly depending on starting nodes. If we can select nodes that contribute to large-scale diffusion, the nodes are expected to be important for viral marketing. Given a network and the size of the starting nodes, the problem of selecting nodes for maximizing information diffusion is called influence maximization problem.

We propose three new approximation methods (Dynamic Degree Discount, Dynamic CI, and Dynamic RIS) for influence maximization problem in dynamic networks. These methods are the extensions of previous methods for static networks to dynamic networks.

When compared with the previous methods, MC Greedy and Osawa, our proposed methods were found better than the previous methods: Although the performance of MC greedy was better than the three methods, it was computationally expensive and intractable for large-scale networks. The computational time of our proposed methods was more than 10 times faster than MC greedy, so they can be computed in realistic time even for large-scale dynamic networks. When compared with Osawa, the performances of these three methods were almost the same as Osawa, but they were approximately 7.8 times faster than Osawa.

Based on these facts, the proposed methods are suitable for influence maximization in dynamic networks. Finding the strategies of choosing a suitable method for a given dynamic network is practically important. It is a challenging open question and is left for our future work. The problem of adjusting the parameters for Dynamic CI and Dynamic RIS is also left for our future work.