Abstract
The information diffusion model is a very important factor in study of the influence maximization problem. This paper contains two notes. The first one is a simplified proof of Kempe–Kleinberg–Tadös conjecture on general threshold mode1 of social influence. The second one is on the verification of a condition in definition of general cascade model.
Similar content being viewed by others
References
Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. WINE, 306–311
Ding-Zhu Du, Ko Ker-I, Hu Xiaodong (2012) Desin and analysis of approximation algorithms. Springer, Berlin
Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. KDD, 137–146
Lu Zaixin, Zhang Wei, Wu Weili, Fu Bin, Du Ding-Zhu (2011) Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: ICDCS workshops, pp. 160–165
Mossel E, Roch S (2007) On the submodularity of influence in social networks. STOC, 128–134
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions. Math Progr 14(1):265–294
Wang Ailian, Weili Wu, Cui Lei (2016) On Bharathi–Kempe–Salek conjecture on influence maximization in arborescence. J Comb Optim 31(4):1678–1684
Zaixin Lu, Zhang Zhao, Weili Wu (2017) Solution of Bharathi–Kempe–Salek conjecture on influence maximization in arborescence. J Comb Optim 33(2):803–808
Acknowledgements
Weili Wu is supported in part by NSFC Grant 61472272 and Shanxi Province science research project under Grant No. 20130313030-1. Hongwei Du is supported in part by NSFC grant 61370216. Huijuan Wang is supported in part by NSFC Grant 11501316. Zhenhua Duan and Cong Tian are supported in part by NSFC Grant 61420106004.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, W., Du, H., Wang, H. et al. On general threshold and general cascade models of social influence. J Comb Optim 35, 209–215 (2018). https://doi.org/10.1007/s10878-017-0165-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-017-0165-6