Influence-Based Community Partition With Sandwich Method for Social Networks

Community partition is an important problem in many areas, such as biology networks and social networks. The objective of this problem is to analyze the relationships among data via the network topology. In this article, we consider the community partition problem under the independent cascade (IC) model in social networks. We formulate the problem as a combinatorial optimization problem that aims at partitioning a given social network into disjoint $m$ communities. The objective is to maximize the sum of influence propagation of a social network through maximizing it within each community. The existing work shows that the influence maximization for community partition problem (IMCPP) is NP-hard. We first…

• NN
  National Natural Science Foundation of China

  Award: 62006089
• BA
  Basic and Applied Basic Research Foundation of Guangdong Province

  Award: 2021A1515110321