Selecting Seeds for Competitive Influence Spread Maximization in Social Networks

Community-based influence maximization in social networks under a competitive linear threshold model

“…First, both the INCIM and IPA algorithms use the idea of communities to find influential nodes and like LDAG have reasonable running times and find good quality nodes. Second, though the High-Degree and greedy approximation algorithms are now almost 15 years old and may thus appear to be obsolete, they are still very commonly used in comparisons involving recently-proposed approaches to competitive and non-competitive influence maximization [11][12][13]38,39] .…”

“…This is called competitive influence maximization ( CIM ). Recently, several works have tried to solve the CIM problem [6][7][8][9][10][11][12][13] by proposing new propagation models which are extensions of Linear Threshold and Independent Cascade models [1] or the Distancebased and Wave-propagation models [14] .…”