Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization

• Published in: IEEE transactions on automatic control Vol. 61; no. 6; pp. 1524 - 1536
• Main Authors: Proskurnikov, Anton V., Matveev, Alexey S., Ming Cao
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: agents; Algorithms; clustering; Competition; consensus; Convergence; Couplings; Dynamics; Graphs; Heuristic algorithms; Network topology; Networks; Opinion dynamics; Protocol (computers); Protocols; Social network services; Social networks; Topology; consensus; Agents; opinion dynamics; clustering
• ISSN: 0018-9286; 1558-2523
• DOI: 10.1109/TAC.2015.2471655

Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.