Achieving consensus on networks with antagonistic interactions

Consensus protocols achieve an agreement among agents thanks to the collaborative efforts of all agents, expresses by a (connected) communication graph with nonnegative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement in presence of antagonistic interactions, modeled as negative weights on the communication graph? The answer to this question is affirmative: on signed networks all agents can converge to a consensus value which is the same for all except for the sign. Necessary and sufficient conditions are obtained to describe the cases when this is possible.

[1]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[2]  Stefano Ermon,et al.  Trust Estimation in autonomic networks: a statistical mechanics approach , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[3]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[4]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[5]  John S. Baras,et al.  Trust Evaluation in Anarchy: A Case Study on Autonomous Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Richard A. Brualdi,et al.  Matrices of Sign-Solvable Linear Systems , 1995 .

[7]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[8]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[9]  J. Kleinberg,et al.  Networks, Crowds, and Markets , 2010 .

[10]  K. Binder,et al.  Spin glasses: Experimental facts, theoretical concepts, and open questions , 1986 .

[11]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[12]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[13]  Wei Ren,et al.  Information consensus in multivehicle cooperative control , 2007, IEEE Control Systems.

[14]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[15]  Frank Harary,et al.  A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..

[16]  Frank Harary,et al.  A matrix criterion for structural balance , 1960 .

[17]  Eduardo D. Sontag,et al.  Monotone and near-monotone biochemical networks , 2007, Systems and Synthetic Biology.

[18]  Claudio Altafini,et al.  Monotonicity, frustration, and ordered response: an analysis of the energy landscape of perturbed large-scale biological networks , 2010, BMC Systems Biology.

[19]  Stephen P. Boyd.  Convex optimization of graph Laplacian eigenvalues , 2006 .

[20]  Mikolaj Morzy,et al.  Signed Graphs , 2014, Encyclopedia of Social Network Analysis and Mining.

[21]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[22]  Yaoping Hou,et al.  On the Laplacian Eigenvalues of Signed Graphs , 2003 .