Cited By
View all- Xu WZhang Z(2024)Linear Opinion Dynamics Model With Higher Order InteractionsIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.332414411:3(3627-3636)Online publication date: Jun-2024
A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation
Pages 3593 - 3602
Abstract
In this paper, we study the opinion maximization problem for the leader-follower DeGroot model of opinion dynamics in a social network modelled by a directed graph with n nodes, where a small number of nodes are competing leader nodes with binary opposing opinions 0 or 1, and the rest are follower nodes. We address the problem of maximizing the overall opinion by adding k ⇐ n new edges, where each edge is incident to a 1-leader and a follower. We prove that the objective function is monotone and submodular, and then propose a deterministic greedy algorithm with an approximation ratio (1-1 over e) and O(n3) running time. We then develop a fast sampling algorithm based on l-truncated absorbing random walks and sample-materialization techniques, which has sublinear time complexity O(kn1/2 log3/2 n/ε3) for any error parameter ε > 0. We provide extensive experiments on real networks to evaluate the performance of our algorithms. The results show that for undirected graphs our fast sampling algorithm outperforms the state-of-the-art method in terms of efficiency and effectiveness. While for directed graphs our fast sampling algorithm is as effective as our deterministic greedy algorithm, both of which are much better than the baseline strategies. Moreover, our fast algorithm is scalable to large directed graphs with over 41 million nodes.
Supplementary Material
A 2min video.
- Download
- 1.73 MB
References
[1]
Rediet Abebe, Jon Kleinberg, David Parkes, and Charalampos E Tsourakakis. 2018. Opinion dynamics with varying susceptibility to persuasion. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1089--1098.
[2]
Claudio Altafini. 2013. Consensus problems on networks with antagonistic interactions. IEEE Trans. Automat. Control, Vol. 58, 4 (2013), 935--946.
[3]
Victor Amelkin and Ambuj K Singh. 2019. Fighting opinion control in social networks via link recommendation. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 677--685.
[4]
Bassam Bamieh, Mihailo R Jovanovic, Partha Mitra, and Stacy Patterson. 2012. Coherence in large-scale networks: Dimension-dependent limitations of local feedback. IEEE Trans. Automat. Control, Vol. 57, 9 (2012), 2235--2249.
[5]
David Bindel, Jon Kleinberg, and Sigal Oren. 2011. How bad is forming your own opinion?. In Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. 57--66.
[6]
David Bindel, Jon Kleinberg, and Sigal Oren. 2015. How bad is forming your own opinion? Games and Economic Behavior, Vol. 92 (2015), 248--265.
[7]
Massimo Bini, Paolo Frasca, Chiara Ravazzi, and Fabrizio Dabbene. 2022. Graph structure-based Heuristics for Optimal Targeting in Social Networks. IEEE Transactions on Control of Network Systems, Vol. 9, 3 (2022), 1189--1201.
[8]
T-H. Hubert Chan, Zhibin Liang, and Mauro Sozio. 2019. Revisiting opinion dynamics with varying susceptibility to persuasion via non-convex local search. In Proceedings of the World Wide Web Conference. ACM, 173--183.
[9]
Xi Chen, Jefrey Lijffijt, and Tijl De Bie. 2018. Quantifying and minimizing risk of conflict in social networks. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1197--1205.
[10]
Michael B Cohen, Rasmus Kyng, Gary L Miller, Jakub W Pachocki, Richard Peng, Anup B Rao, and Shen Chen Xu. 2014. Solving SDD linear systems in nearly m log1/2 n time. In Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing. ACM, 343--352.
[11]
Pranav Dandekar, Ashish Goel, and David T Lee. 2013. Biased assimilation, homophily, and the dynamics of polarization. Proceedings of the National Academy of Sciences, Vol. 110, 15 (2013), 5791--5796.
[12]
Morris H. Degroot. 1974. Reaching a consensus. J. Amer. Statist. Assoc., Vol. 69, 345 (1974), 118--121.
[13]
Yucheng Dong, Min Zhan, Gang Kou, Zhaogang Ding, and Haiming Liang. 2018. A survey on the fusion process in opinion dynamics. Information Fusion, Vol. 43 (2018), 57--65.
[14]
Noah E Friedkin and Eugene C Johnsen. 1990. Social influence and opinions. Journal of Mathematical Sociology, Vol. 15, 3--4 (1990), 193--206.
[15]
Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, and Michael Mathioudakis. 2017. Reducing controversy by connecting opposing views. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, 81--90.
[16]
Aristides Gionis, Evimaria Terzi, and Panayiotis Tsaparas. 2013. Opinion maximization in social networks. In Proceedings of the 2013 SIAM International Conference on Data Mining. SIAM, 387--395.
[17]
Hossein Hassani, Roozbeh Razavi-Far, Mehrdad Saif, Francisco Chiclana, Ondrej Krejcar, and Enrique Herrera-Viedma. 2022. Classical dynamic consensus and opinion dynamics models: A survey of recent trends and methodologies. Information Fusion, Vol. 88 (2022), 22--40.
[18]
Wassily Hoeffding. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., Vol. 58, 301 (1963), 13--30.
[19]
David Scott Hunter and Tauhid Zaman. 2022. Optimizing opinions with stubborn agents. Operations Research, Vol. 70, 4 (2022), 2119--2137.
[20]
Peng Jia, Anahita MirTabatabaei, Noah E Friedkin, and Francesco Bullo. 2015. Opinion dynamics and the evolution of social power in influence networks. SIAM Rev., Vol. 57, 3 (2015), 367--397.
[21]
John G Kemeny and James Laurie Snell. 1976. Finite Markov Chains. Springer, New York.
[22]
Heidi Ledford. 2020. How Facebook, Twitter and other data troves are revolutionizing social science. Nature, Vol. 582, 7812 (2020), 328--330.
[23]
Jure Leskovec and Rok Sosivc. 2016. SNAP: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technolog, Vol. 8, 1 (2016), 1.
[24]
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, and Hong Cheng. 2014. Random-walk domination in large graphs. In Proceedings of IEEE 30th International Conference on Data Engineering (ICDE). IEEE, 736--747.
[25]
Vassio Luca, Fagnani Fabio, Frasca Paolo, and Ozdaglar Asuman. 2014. Message passing optimization of harmonic influence centrality. IEEE Transactions on Control of Network Systems, Vol. 1, 1 (2014), 109--120.
[26]
Erika Mackin and Stacy Patterson. 2019. Maximizing diversity of opinion in social networks. In Proceedings of 2019 American Control Conference. IEEE, 2728--2734.
[27]
Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, and Akira Tanaka. 2021. A projected gradient method for opinion optimization with limited changes of susceptibility to persuasion. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1274--1283.
[28]
Carl D Meyer, Jr. 1973. Generalized inversion of modified matrices. SIAM J. Appl. Math., Vol. 24, 3 (1973), 315--323.
[29]
Cameron Musco, Christopher Musco, and Charalampos E Tsourakakis. 2018. Minimizing polarization and disagreement in social networks. In Proceedings of the 2018 World Wide Web Conference. ACM, 369--378.
[30]
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, Vol. 14, 1 (1978), 265--294.
[31]
Hossein Noorazar, Kevin R Vixie, Arghavan Talebanpour, and Yunfeng Hu. 2020. From classical to modern opinion dynamics. International Journal of Modern Physics C, Vol. 31, 07 (2020), 2050101.
[32]
Maya Okawa and Tomoharu Iwata. 2022. Predicting opinion dynamics via sociologically-informed neural networks. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 1306--1316.
[33]
Ryan Rossi and Nesreen Ahmed. 2015. The network data repository with interactive graph analytics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI, 4292--4293.
[34]
Purnamrita Sarkar and Andrew W. Moore. 2007. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In UAI 2007, Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence. AUAI Press, 335--343.
[35]
Daniel A. Spielman and Shang-Hua Teng. 2014. Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl., Vol. 35, 3 (2014), 835--885.
[36]
Sijing Tu and Stefan Neumann. 2022. A viral marketing-based model for opinion dynamics in online social Networks. In Proceedings of the ACM Web Conference 2022. ACM, 1570--1578.
[37]
Lin Xiao, Stephen Boyd, and Seung-Jean Kim. 2007. Distributed average consensus with least-mean-square deviation. J. Parallel Distrib. Comput., Vol. 67, 1 (2007), 33--46.
[38]
Pinghua Xu, Wenbin Hu, Jia Wu, and Weiwei Liu. 2020. Opinion maximization in social trust networks. In Proceedings of the 29th International Joint Conference on Artificial Intelligence. 1251--1257.
[39]
Wanyue Xu, Qi Bao, and Zhongzhi Zhang. 2021. Fast evaluation for relevant quantities of opinion dynamics. In Proceedings of the Web Conference 2021. ACM, 2037--2045.
[40]
Yuhao Yi, Timothy Castiglia, and Stacy Patterson. 2021. Shifting opinions in a social network through leader selection. IEEE Transactions on Control of Network Systems, Vol. 8, 3 (2021), 1116--1127.
[41]
Ercan Yildiz, Asuman Ozdaglar, Daron Acemoglu, Amin Saberi, and Anna Scaglione. 2013. Binary opinion dynamics with stubborn agents. ACM Transactions on Economics and Computation, Vol. 1, 4 (2013), 1--30.
[42]
Zuobai Zhang, Wanyue Xu, Zhongzhi Zhang, and Guanrong Chen. 2020. Opinion dynamics incorporating higher-order interactions. In 20th IEEE International Conference on Data Mining. IEEE, 1430--1435.
[43]
Xiaotian Zhou and Zhongzhi Zhang. 2021. Maximizing influence of leaders in social networks. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, 2400--2408.
[44]
Liwang Zhu, Qi Bao, and Zhongzhi Zhang. 2021. Minimizing polarization and disagreement in social networks via link recommendation. In Advances in Neural Information Processing Systems. 2072--2084.
Index Terms
- A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation
Recommendations
Opinion Maximization in Social Networks via Leader Selection
WWW '23: Proceedings of the ACM Web Conference 2023We study a leader selection problem for the DeGroot model of opinion dynamics in a social network with n nodes and m edges, in the presence of s0 = O(1) leaders with opinion 0. Concretely, we consider the problem of maximizing the average opinion in ...
Estimating the number of connected components in sublinear time
We present an algorithm that estimates the number of connected components of a graph over n vertices within an additive error of @en in (sublinear) time O(1@e^2log(1@e)). A connected component C is the maximal subset of nodes of an undirected graph G ...
Distributed edge connectivity in sublinear time
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingWe present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time ...
Comments
Information & Contributors
Information
Published In
August 2023
5996 pages
ISBN:9798400701030
DOI:10.1145/3580305
- General Chairs:
- Ambuj Singh,
- Yizhou Sun,
- Program Chairs:
- Leman Akoglu,
- Dimitrios Gunopulos,
- Xifeng Yan,
- Ravi Kumar,
- Fatma Ozcan,
- Jieping Ye
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 August 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Shanghai Municipal Science and Technology Major Project
- National Natural Science Foundation of China
Conference
KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
August 6 - 10, 2023
CA, Long Beach, USA
Acceptance Rates
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 512Total Downloads
- Downloads (Last 12 months)390
- Downloads (Last 6 weeks)13
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
Cited By
View all- Xu WZhang Z(2024)Linear Opinion Dynamics Model With Higher Order InteractionsIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.332414411:3(3627-3636)Online publication date: Jun-2024
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
Access Granted