Community-based rumor blocking maximization in social networks: algorithms and analysis
This paper studies the competitive independent cascade model based on the independent cascade diffusion in social network analysis. Given a network with \(m\) disjoint communities \(S=\{S_1,\cdots,S_m\}\) and budget \(b\), where a budget allocation is \(x=(x_1,\cdots,x_m)\) with \(\sum x_i=b\). The problem under consideration is to choose optimal node set \(D\) such that we can protect nodes from being infected by rumors as much as possible, where \(|D\cap S_i|\le x_i\) for any \(S_i\subseteq S\). The paper proposes a budget allocation algorithm using sub-modular function maximization over integer lattices, which gives an \(1-1/e\) approximation guarantee and the objective function is shown to be monotone and diminishing return sub-modular. A speedup algorithm is introduced. It ensures the performance but has lower time complexity. Simulations results have been presented to illustrate the theoretical results.
- Community-based rumor blocking maximization in social networks
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- General rumor blocking: an efficient random algorithm with martingale approach
- Minimum budget for misinformation blocking in online social networks
- Centralized and decentralized rumor blocking problems
- Containment of rumor spread by selecting immune nodes in social networks
- Rumor correction maximization problem in social networks
- Community-based rumor blocking maximization in social networks
- Blocking adversarial influence in social networks
- Multi-attribute based influence maximization in social networks: algorithms and analysis
- Multi-attribute based influence maximization in social networks
- Minimum budget for misinformation blocking in online social networks
- General rumor blocking: an efficient random algorithm with martingale approach
- Centralized and decentralized rumor blocking problems
- Identifying structural hole spanners to maximally block information propagation
- Optimal containment of misinformation in social media: a scenario-based approach
- Social network analysis and applications: A review of the broad research aspects of social network structure
- Misinformation influence minimization problem based on group disbanded in social networks
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
- Negative influence blocking maximization with uncertain sources under the independent cascade model
- Profit maximization for multiple products in community-based social networks
- Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period
- A distributed algorithm for rumor blocking on social networks
- Blocking rumor by cut
- New trends in influence maximization models
This page was built for publication: Community-based rumor blocking maximization in social networks: algorithms and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202013)
