Hui Chen
ABSTRACT
In the study of online collaboration, one of the important aspects to optimize information propagation among users is to improve the rate of the propagation besides extending the propagation range, e.g., to deliver the advertisements to given target customers in shortest time or to inform a community in limited time. Due to the global optimization requirement, it is often challenging to optimize the propagation rate on a social network efficiently. Concerning the transition probability on each interpersonal relationship, we define information propagation as a random walk on a weighted directed graph, and indicate the propagation rate with the convergence rate of the random walk. Based on spectral graph theory, we further connect the convergence rate with the second smallest eigenvalue of the graph. Finally, by increasing the , a semi-definite programming model is proposed to globally optimize the information propagation rate more easily. Experimental results on real social network shows that the proposed solution can optimize the information propagation rate and further benefit the effectiveness of different typical influence diffusion models.
- Charu C Aggarwal. 2011. An introduction to social network data analytics. In Social network data analytics. Springer, 1–15.Google Scholar
- Suman Banerjee, Mamata Jenamani, and Dilip Kumar Pratihar. 2020. A survey on influence maximization in a social network. Knowledge and Information Systems 62, 9 (2020), 3417–3455.Google ScholarDigital Library
- Frank M Bass. 1969. A new product growth for model consumer durables. Management science 15, 5 (1969), 215–227.Google Scholar
- Stephen Boyd. 2006. Convex optimization of graph Laplacian eigenvalues. In Proceedings of the International Congress of Mathematicians, Vol. 3.Citeseer, 1311–1319.Google Scholar
- Jacqueline Johnson Brown and Peter H Reingen. 1987. Social ties and word-of-mouth referral behavior. Journal of Consumer research 14, 3 (1987), 350–362.Google ScholarCross Ref
- Alexandra Carpentier and Michal Valko. 2016. Revealing graph bandits for maximizing local influence. In Artificial Intelligence and Statistics. PMLR, 10–18.Google Scholar
- Xuanhao Chen, Liwei Deng, Yan Zhao, Xiaofang Zhou, and Kai Zheng. 2021. Community-based influence maximization in location-based social network. World Wide Web 24, 6 (2021), 1903–1928.Google ScholarDigital Library
- Fan Chung. 2005. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics 9, 1 (2005), 1–19.Google ScholarCross Ref
- Fan Chung. 2006. The diameter and Laplacian eigenvalues of directed graphs. the electronic journal of combinatorics (2006), N4–N4.Google Scholar
- Fan RK Chung and Fan Chung Graham. 1997. Spectral graph theory. Number 92. American Mathematical Soc.Google Scholar
- Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 57–66.Google ScholarDigital Library
- Miroslav Fiedler. 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2 (1973), 298–305.Google Scholar
- Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12, 3 (2001), 211–223.Google Scholar
- Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review 9, 3 (2001), 1–18.Google Scholar
- Mark Granovetter. 1978. Threshold models of collective behavior. American journal of sociology 83, 6 (1978), 1420–1443.Google Scholar
- Jonathan L Gross and Jay Yellen. 2003. Handbook of graph theory. CRC press.Google Scholar
- Nesrine Hafiene, Wafa Karoui, and Lotfi Ben Romdhane. 2020. Influential nodes detection in dynamic social networks: a survey. Expert Systems with Applications 159 (2020), 113642.Google ScholarCross Ref
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 137–146.Google ScholarDigital Library
- Siyu Lei, Silviu Maniu, Luyi Mo, Reynold Cheng, and Pierre Senellart. 2015. Online influence maximization. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 645–654.Google ScholarDigital Library
- Lingfei Li, Yezheng Liu, Qing Zhou, Wei Yang, and Jiahang Yuan. 2020. Targeted influence maximization under a multifactor-based information propagation model. Information Sciences 519 (2020), 124–140.Google ScholarDigital Library
- Wenxin Liang, Chengguang Shen, Xiao Li, Ryo Nishide, Ian Piumarta, and Hideyuki Takada. 2019. Influence maximization in signed social networks with opinion formation. IEEE Access 7 (2019), 68837–68852.Google ScholarCross Ref
- Su-Chen Lin, Shou-De Lin, and Ming-Syan Chen. 2015. A learning-based framework to handle multi-round multi-party influence maximization on social networks. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 695–704.Google ScholarDigital Library
- Vijay Mahajan, Eitan Muller, and Frank M Bass. 1990. New product diffusion models in marketing: A review and directions for research. Journal of marketing 54, 1 (1990), 1–26.Google ScholarCross Ref
- Matthew Richardson, Rakesh Agrawal, and Pedro Domingos. 2003. Trust management for the semantic web. In International semantic Web conference. Springer, 351–368.Google Scholar
- Matthew Richardson and Pedro Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 61–70.Google ScholarDigital Library
- Bryan Wilder, Amulya Yadav, Nicole Immorlica, Eric Rice, and Milind Tambe. 2017. Uncharted but not Uninfluenced: Influence Maximization with an Uncertain Network.. In AAMAS, Vol. 17. 1305–1313.Google Scholar
- Amulya Yadav, Hau Chan, Albert Xin Jiang, Haifeng Xu, Eric Rice, and Milind Tambe. 2016. Using Social Networks to Aid Homeless Shelters: Dynamic Influence Maximization under Uncertainty.. In AAMAS, Vol. 16. 740–748Google Scholar
Index Terms
- The Semi-definite Programming Model for Optimizing Information Propagation Rate on Social Network Based on the Spectral Graph Theory
Recommendations
Inferring Information Propagation over Online Social Networks: Edge Asymmetry and Flow Tendency
HPCC-CSS-ICESS '15: Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and SystemsInferring the underlying information propagation over online social networks is important because it leads to new insights and enables forecasting, as well as influencing information propagation. In this paper, we analyze propagation processes in online ...
Information propagation model based on hybrid social factors of opportunity, trust and motivation
AbstractThe propagation of information in the network is a complex dynamic process. Establishing an accurate information propagation model around common social factors benefits a lot from its evolution simulation for identifying the valuable ...
Information propagation in online social networks based on user behavior
ICICA'12: Proceedings of the Third international conference on Information Computing and ApplicationsAlong with the development of Internet and Web2.0, online social networks (OSNs) are becoming an important information propagation platform. Therefore, it is of great significance to study the information propagation rules in OSNs. An information ...
Comments