Paper Info
Title
Polarizability, Consensusability and Neutralizability of Opinion Dynamics on Coopetitive Networks
Abstract
Opinion dynamics on social networks with coopetitive (cooperative-competitive) interactions may result in polarity, consensus or neutrality under different opinion protocols. The antecedent of protocol design is to study the accessibility problem: whether or not there exist admissible control rules to polarize, consensus, or neutralize individual opinions in a large population. From an operational perspective, this technical note is aimed at the investigation of polarizability, consensusability, and neutralizability of opinion dynamics in question. Particular emphasis is on the joint impact of the dynamical properties of individuals and the interaction topology among them on polarizability, consensusability, and neutralizability, respectively. Sufficient and/or necessary conditions for those accessibility problems are provided by using powerful tools from spectral analysis and algebraic graph theory. To characterize the individual diversity in real life, we further investigate the solvability of opinion formation problems in heterogeneous systems with non- identical dynamics. Accordingly, sufficient and/or necessary criteria to examine heterogeneous network polarizability, consensu
Year
DOI
Venue
2019
10.1109/tac.2018.2879599
IEEE Transactions on Automatic Control
Keywords
Field
DocType
Protocols,Graph theory,Linear systems,Laplace equations,Social network services,Manganese,Eigenvalues and eigenfunctions
Graph theory,Population,Mathematical optimization,Social network,Linear system,Polarizability,Heterogeneous network,Algebraic graph theory,Mathematics,Neutrality
Journal
Volume
Issue
ISSN
64
8
0018-9286
Citations 
PageRank 
References 
2
0.38
0
Authors
4
Name
Order
Citations
PageRank
Fangzhou Liu112510.67
Dong Xue252.79
Sandra Hirche3961106.36
Martin Buss49621.34