Complex influence propagation based on trust-aware dynamic linear threshold models

Applied Network Science

Table 1 Summary of related work based on optimization problem, basic diffusion model (DM), competitive diffusion (C), non-progressivity (NP), time-aware activation (TA), delayed propagation (DP), trust/distrust relations (TD)

Ref.	Problem	DM	C	NP	TA	DP	TD
(Budak et al. 2011)	Rumor blocking	IC	✓
(Tong et al. 2017)	Rumor blocking	IC	✓
(He et al. 2012)	Rumor blocking	LT	✓
(Fan et al. 2013)	Rumor blocking	distrib.	✓
(Chen et al. 2011)	Positive influ. max.	IC	✓
(Lou et al. 2014)	Active time max.	IC		✓
(Fazli et al. 2014)	PTS min.	LT		✓
(Chen and He 2015)	Positive influ. max.	Voter	✓				✓
(Talluri et al. 2015)	Positive influ. max.	LT	✓				✓
(Weng et al. 2016)	Positive influ. max.	LT	✓				✓
(Liu et al. 2012)	Time-constrain. influ. max.	IC				✓
(Chen et al. 2012)	Time-constrain. influ. max.	IC				✓
(Mohamadi-Baghmolaei et al. 2015)	Positive influ. max.	IC	✓	✓		✓	✓
(Litou et al. 2016)	Rumor blocking	LT	✓	✓	✓
(Lu et al. 2015)	Positive influ. max.	IC	✓