Don't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization

@inproceedings{Angell2017DontBG,
  title={Don't Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization},
  author={Rico Angell and Grant Robert Schoenebeck},
  booktitle={WINE},
  year={2017}
}
We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds — a central problem in the study of network cascades. The majority of existing work on this problem, formally referred to as the influence maximization problem, is designed for submodular cascades. Despite the empirical evidence that many cascades are non-submodular, little work has been done focusing on non-submodular influence maximization. 
The Importance of Communities for Learning to Influence
TLDR
A simple heuristic is designed that overcomes this negative result in practice by leveraging the strong community structure of social networks and obtains a constant factor approximation guarantee on graphs generated through the stochastic block model, traditionally used to model networks with community structure.
Maximizing the earned benefit in an incentivized social networking environment: a community-based approach
TLDR
Experimental results show that the incorporation of community structure helps the proposed methodology to achieve more benefit without much increase in computational burden.
A survey on influence maximization in a social network
TLDR
This paper presents a survey on the progress in and around SIM Problem, and discusses current research trends and future research directions as well.
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization
TLDR
This paper proves that the optimal seeding strategy in a stochastic hierarchical blockmodel is to put all the seeds in a single community, which matches the intuition that in a nonsubmodular cascade model placing seeds near each other creates synergy.
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
TLDR
This article provides a dynamic-programming-based polynomial time algorithm, which optimally computes a directed variant of the influence maximization problem on hierarchical blockmodel networks, and presents strong inapproximability results for a class of influence functions that are “almost” submodular, called 2-quasi-submodular.
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
TLDR
The concept of greedy adaptivity gap is proposed, which compares the performance of the adaptive greedy algorithm to its non-adaptive counterpart, and it is proved that in any submodular cascade, the adaptive greed algorithm always outputs a (1-1/e)-approximation to the expected number of adoptions in the optimal non- Adaptive seed choice.
Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap
TLDR
A suite of highly scalable local greedy heuristics for the influence maximization problem on both the linear threshold model and the weighted independent cascade model on undirected graphs that, in practice, find seed sets which on average obtain 97.52% of the performance of the much slower greedy algorithm for the linear thresholds.
CBIM-RSRW: An Community-Based Method for Influence Maximization in Social Network
TLDR
This work studies the influence maximization problem in social networks and improves the independent cascade model to realize the goal of different weights for different users, and the differentiation of influence probability and proposes a method called the reverse reachable index method based on random walk to select potential high-impact nodes from those communities.
Influence Maximization on Undirected Graphs
TLDR
A suite of highly scalable local greedy heuristics for the influence maximization problem on both the linear threshold model and the weighted independent cascade model on undirected graphs that, in practice, find seed sets that on average obtain 97.52% of the performance of the much slower greedy algorithm for the linear thresholds.
A Co\mbox{-}Operative Game Theoretic Approach for the Budgeted Influence Maximization Problem
TLDR
This paper proposes an iterative algorithm for finding seed nodes in a co-operative game where the users of the network are the players and for a group of users, the expected influence by them under the Maximum Influence Arborences diffusion model is its utility.
...
...

References

SHOWING 1-10 OF 49 REFERENCES
Time Constrained Influence Maximization in Social Networks
TLDR
It is shown that the problem is NP-hard, and the monotonicity and submodularity of the time constrained influence spread function is proved, and a greedy algorithm with performance guarantees is developed.
Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach
TLDR
Experiments using real-world social network graphs with scales ranging from thousands to millions of edges demonstrate the superior performance of the proposed algorithms with moderate computation costs.
Maximizing the Spread of Influence through a Social Network
TLDR
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Influence maximization: near-optimal time complexity meets practical efficiency
TLDR
TIM is presented, an algorithm that aims to bridge the theory and practice in influence maximization and outperforms the state-of-the-art solutions (with approximation guarantees) by up to four orders of magnitude in terms of running time.
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
  • Wei ChenYifei YuanLi Zhang
  • Computer Science
    2010 IEEE International Conference on Data Mining
  • 2010
TLDR
This paper proposes the first scalable influence maximization algorithm tailored for the linear threshold model, which is scalable to networks with millions of nodes and edges, is orders of magnitude faster than the greedy approximation algorithm proposed by Kempe et al. and its optimized versions, and performs consistently among the best algorithms.
Competitive Influence Maximization in Social Networks
TLDR
A natural and mathematically tractable model for the diffusion of multiple innovations in a network, and a (1-1/e) approximation algorithm for computing the best response to an opponent's strategy are given.
Efficient influence maximization in social networks
TLDR
Based on the results, it is believed that fine-tuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time.
Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process
TLDR
Time-critical influence maximization under the time-delayed IC model maintains desired properties such as submodularity, which allows a greedy algorithm to achieve an approximation ratio of 1-1/e, to circumvent the NP-hardness of the problem.
Adaptive Seeding in Social Networks
TLDR
This paper introduces a new framework which is a two-stage stochastic optimization model designed to leverage the potential that typically lies in neighboring nodes of arbitrary samples of social networks, and provides a constant factor approximation to the optimal adaptive policy in the Triggering model.
Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond
TLDR
It is shown that the problem is NP-hard, and the monotonicity and submodularity of the time constrained influence spread function is proved, and a greedy algorithm is developed based on this, which is developed to improve the algorithm scalability.
...
...