Maximizing rumor containment in social networks with constrained time

Lidan Fan, Weili Wu, Xuming Zhai, Kai Xing, Wonjun Lee, Ding Zhu Du

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The spread of rumor or misinformation in social networks may cause bad effects among the public. Thus, it is necessary to find effective strategies to control the spread of rumor. Specifically, in our paper, we consider such a setting: initially, a subset of nodes is chosen as the set of protectors, and the influence of protector diffuses competitively with the diffusion of rumor. However, in real world, we generally have limited budget (limited number of protectors) and time to fight with rumor. Therefore, we study the problem of maximizing rumor containment within a fixed number of initial protectors and a given time deadline. Generalizing two seminal models in the field—the Independent Cascade (IC) model and the Linear Threshold (LT) model—we propose two new models of competitive influence diffusion in social networks with the following three factors: a time deadline for information diffusion, random time delay of information exchange and personal interests regarding the acceptance of information. Under these two models, we show that the optimization problems are NP-hard. Furthermore, we prove that the objective functions are submodular. As a result, the greedy algorithm is used as constant-factor approximation algorithms with performance guarantee $$1-\frac{1}{e}$$1-1e for the two optimization problems.

Original languageEnglish
Article number214
Pages (from-to)1-10
Number of pages10
JournalSocial Network Analysis and Mining
Volume4
Issue number1
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

rumor
social network
Approximation algorithms
information exchange
Computational complexity
Time delay
guarantee
budget
acceptance
time
cause
performance

Keywords

  • Influence diffusion
  • Personal interests
  • Rumor containment
  • Time deadline
  • Time delay

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction
  • Information Systems
  • Communication
  • Media Technology

Cite this

Maximizing rumor containment in social networks with constrained time. / Fan, Lidan; Wu, Weili; Zhai, Xuming; Xing, Kai; Lee, Wonjun; Du, Ding Zhu.

In: Social Network Analysis and Mining, Vol. 4, No. 1, 214, 01.01.2014, p. 1-10.

Research output: Contribution to journalArticle

Fan, Lidan ; Wu, Weili ; Zhai, Xuming ; Xing, Kai ; Lee, Wonjun ; Du, Ding Zhu. / Maximizing rumor containment in social networks with constrained time. In: Social Network Analysis and Mining. 2014 ; Vol. 4, No. 1. pp. 1-10.
@article{9c55e1684920453a8c0fa053d556d66f,
title = "Maximizing rumor containment in social networks with constrained time",
abstract = "The spread of rumor or misinformation in social networks may cause bad effects among the public. Thus, it is necessary to find effective strategies to control the spread of rumor. Specifically, in our paper, we consider such a setting: initially, a subset of nodes is chosen as the set of protectors, and the influence of protector diffuses competitively with the diffusion of rumor. However, in real world, we generally have limited budget (limited number of protectors) and time to fight with rumor. Therefore, we study the problem of maximizing rumor containment within a fixed number of initial protectors and a given time deadline. Generalizing two seminal models in the field—the Independent Cascade (IC) model and the Linear Threshold (LT) model—we propose two new models of competitive influence diffusion in social networks with the following three factors: a time deadline for information diffusion, random time delay of information exchange and personal interests regarding the acceptance of information. Under these two models, we show that the optimization problems are NP-hard. Furthermore, we prove that the objective functions are submodular. As a result, the greedy algorithm is used as constant-factor approximation algorithms with performance guarantee $$1-\frac{1}{e}$$1-1e for the two optimization problems.",
keywords = "Influence diffusion, Personal interests, Rumor containment, Time deadline, Time delay",
author = "Lidan Fan and Weili Wu and Xuming Zhai and Kai Xing and Wonjun Lee and Du, {Ding Zhu}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s13278-014-0214-4",
language = "English",
volume = "4",
pages = "1--10",
journal = "Social Network Analysis and Mining",
issn = "1869-5450",
publisher = "Springer Wien",
number = "1",

}

TY - JOUR

T1 - Maximizing rumor containment in social networks with constrained time

AU - Fan, Lidan

AU - Wu, Weili

AU - Zhai, Xuming

AU - Xing, Kai

AU - Lee, Wonjun

AU - Du, Ding Zhu

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The spread of rumor or misinformation in social networks may cause bad effects among the public. Thus, it is necessary to find effective strategies to control the spread of rumor. Specifically, in our paper, we consider such a setting: initially, a subset of nodes is chosen as the set of protectors, and the influence of protector diffuses competitively with the diffusion of rumor. However, in real world, we generally have limited budget (limited number of protectors) and time to fight with rumor. Therefore, we study the problem of maximizing rumor containment within a fixed number of initial protectors and a given time deadline. Generalizing two seminal models in the field—the Independent Cascade (IC) model and the Linear Threshold (LT) model—we propose two new models of competitive influence diffusion in social networks with the following three factors: a time deadline for information diffusion, random time delay of information exchange and personal interests regarding the acceptance of information. Under these two models, we show that the optimization problems are NP-hard. Furthermore, we prove that the objective functions are submodular. As a result, the greedy algorithm is used as constant-factor approximation algorithms with performance guarantee $$1-\frac{1}{e}$$1-1e for the two optimization problems.

AB - The spread of rumor or misinformation in social networks may cause bad effects among the public. Thus, it is necessary to find effective strategies to control the spread of rumor. Specifically, in our paper, we consider such a setting: initially, a subset of nodes is chosen as the set of protectors, and the influence of protector diffuses competitively with the diffusion of rumor. However, in real world, we generally have limited budget (limited number of protectors) and time to fight with rumor. Therefore, we study the problem of maximizing rumor containment within a fixed number of initial protectors and a given time deadline. Generalizing two seminal models in the field—the Independent Cascade (IC) model and the Linear Threshold (LT) model—we propose two new models of competitive influence diffusion in social networks with the following three factors: a time deadline for information diffusion, random time delay of information exchange and personal interests regarding the acceptance of information. Under these two models, we show that the optimization problems are NP-hard. Furthermore, we prove that the objective functions are submodular. As a result, the greedy algorithm is used as constant-factor approximation algorithms with performance guarantee $$1-\frac{1}{e}$$1-1e for the two optimization problems.

KW - Influence diffusion

KW - Personal interests

KW - Rumor containment

KW - Time deadline

KW - Time delay

UR - http://www.scopus.com/inward/record.url?scp=84925789611&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925789611&partnerID=8YFLogxK

U2 - 10.1007/s13278-014-0214-4

DO - 10.1007/s13278-014-0214-4

M3 - Article

AN - SCOPUS:84925789611

VL - 4

SP - 1

EP - 10

JO - Social Network Analysis and Mining

JF - Social Network Analysis and Mining

SN - 1869-5450

IS - 1

M1 - 214

ER -