Maximizing Boosted Influence Spread with Edge Addition in Online Social Networks

Abstract

Influence maximization with application to viral marketing is a well-studied problem of finding a small number of influential users in a social network to maximize the spread of influence under certain influence cascade models. However, almost all previous studies have focused on node-level mining, where they consider identifying nodes as the initial seeders to achieve the desired outcomes. In this article, instead of targeting nodes, we investigate a new boosted influence maximization problem from the edge-level perspective, which asks for finding an edge set that is added to the network to maximize the increased influence spread of a given seed set. We show that the problem is NP-hard and the influence spread function no longer exhibits the property of submodularity, which impose more challenging on the problem. Therefore, we devise a restricted form that is submodular and propose a greedy algorithm with approximate guarantee to solve the problem. However, because of its poor computational efficiency, we further propose an improved greedy algorithm that integrates several effective optimization strategies to significantly speed up the edge selection without sacrificing its accuracy. Extensive experiments over real-world available social networks of different sizes demonstrate the effectiveness and efficiency of the proposed methods. CCS Concepts: • Information systems → Data mining; Web applications; • Theory of computation → Design and analysis of algorithms;

Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches

“…Constantfactor approximation algorithms were developed in Demaine and Zadimoghaddam (2010) for the problem of adding k shortcut edges to the graph in order to minimize its diameter. Yu et al (2020) studied the problem of finding an edge set that is added to the network to maximize the influence spread of a given vertex set, showing that the problem is NP-hard and proposing a greedy algorithm to solve it. A game that models the creation of a network by selfish agents that benefit from shortest paths to all destinations is analyzed in Fabrikant et al (2003), considering that the agents pay for the links they establish.…”

“…Yu et al. (2020) studied the problem of finding an edge set that is added to the network to maximize the influence spread of a given vertex set, showing that the problem is NP‐hard and proposing a greedy algorithm to solve it. A game that models the creation of a network by selfish agents that benefit from shortest paths to all destinations is analyzed in Fabrikant et al.…”