A Community-Aware Framework for Social Influence Maximization

We consider the problem of Influence Maximization (IM), the task of selecting k seed nodes in a social network such that the expected number of nodes influenced is maximized. We propose a community-aware divide-and-conquer framework that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence maximization problem for each community, and (iii) selecting the final set of seed nodes using a novel progressive budgeting scheme.Our experiments on real-world social networks show that the proposed framework outperforms the standard methods in terms of run-time and the heuristic methods in terms of influence. We also study the effect of the community structure on the performance of the proposed framework. Our experiments show that the community structures with higher modularity lead the proposed framework to perform better in terms of run-time and influence.

Automated summary

We propose a novel approach to the Influence Maximization problem that takes into account the community structure of social networks. Our experiments show that our approach outperforms standard methods in terms of run-time and heuristic methods in terms of influence. We also find that higher modularity in community structures leads to better performance of our approach in terms of run-time and influence.