DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes

Influence maximization (IM) is the fundamental study of social network analysis. The IM problem finds the top k nodes that have maximum influence in the network. Most of the studies in IM focus on maximizing the number of activated nodes in the static social network. But in real life, social networks are dynamic in nature. This work addresses the diversification of activated nodes in the dynamic social network. This work proposes an objective function that maximizes the number of communities by utilizing bridge nodes. We also propose a diffusion model that considers the role of inactive nodes in influencing a node. We prove the submodularity, and monotonicity of the objective function under the proposed diffusion model. This work analyzes the impact of different ratios of bridge nodes in the seed set on real-world and synthetic datasets. Further, we prove the NP-Hardness of the objective function under the proposed diffusion model. The experiments are conducted on various real-world and synthetic datasets with known and unknown community information. The proposed work experimentally shows that the objective function gives the maximum number of communities considering bridge nodes compared to the benchmark algorithms.