Opinion dynamics in social networks with stubborn agents: An issue-based perspective

被引:77
作者
Tian, Ye [1 ]
Wang, Long [2 ]
机构
[1] Xidian Univ, Sch Mechanoelect Engn, Ctr Complex Syst, Xian 710071, Shaanxi, Peoples R China
[2] Peking Univ, Coll Engn, Ctr Syst & Control, Beijing 100871, Peoples R China
基金
美国国家科学基金会;
关键词
Opinion dynamics; Issue sequences; Path-dependence; Convergence; Confidence bound; TIME MULTIAGENT SYSTEMS; CONSENSUS PROBLEMS; SWITCHING TOPOLOGY; DECISION-MAKING; COORDINATION; EQUILIBRIUM; LEADERSHIP; EVOLUTION; POWER;
D O I
10.1016/j.automatica.2018.06.041
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Classic models on opinion dynamics usually focus on a group of agents forming their opinions interactively over a single issue. Yet generally agreement cannot be achieved over a single issue when agents are not completely open to interpersonal influence. In this paper, opinion formation in social networks with stubborn agents is considered over issue sequences. The social network with stubborn agents is described by the Friedkin-Johnsen (F-J) model where agents are stubborn to their initial opinions. Firstly, we propose a sufficient and necessary condition in terms of network topology for convergence of the F-J model over a single issue. Secondly, opinion formation of the F-J model is investigated over issue sequences. Our analysis establishes connections between the interpersonal influence network and the network describing the relationship of agents' initial opinions for successive issues. Taking advantage of these connections, we derive the sufficient and necessary condition for the F-J model to achieve opinion consensus and form clusters over issue sequences, respectively. Finally, we consider a more general scenario where each agent has bounded confidence in forming its initial opinion. By analyzing the evolution of agents' ultimate opinions for each issue over issue sequences, we prove that the connectivity of the state-dependent network is preserved in this setting. Then the conditions for agents to achieve opinion consensus over issue sequences are established. Simulation examples are provided to illustrate the effectiveness of our theoretical results. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:213 / 223
页数:11
相关论文
共 51 条
[1]   Spread of (mis)information in social networks [J].
Acemoglu, Daron ;
Ozdaglar, Asuman ;
ParandehGheibi, Ali .
GAMES AND ECONOMIC BEHAVIOR, 2010, 70 (02) :194-227
[2]   Consensus Problems on Networks With Antagonistic Interactions [J].
Altafini, Claudio .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (04) :935-946
[3]  
[Anonymous], ARXIV160903465V1
[4]  
[Anonymous], NY TIMES
[5]  
[Anonymous], 2014, Matrix analysis
[6]   How Bad is Forming Your Own Opinion? [J].
Bindel, David ;
Kleinberg, Jon ;
Oren, Sigal .
2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, :57-66
[7]   On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity [J].
Blondel, Vincent D. ;
Hendrickx, Julien M. ;
Tsitsiklis, John N. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2009, 54 (11) :2586-2597
[8]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[9]  
Brualdi R.A., 1991, ENCY MATH ITS APPL, V39
[10]   Effective leadership and decision-making in animal groups on the move [J].
Couzin, ID ;
Krause, J ;
Franks, NR ;
Levin, SA .
NATURE, 2005, 433 (7025) :513-516