The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Consensus Problems on Networks With Antagonistic Interactions
Abstract
In a consensus protocol an agreement among agents is achieved thanks to the collaborative efforts of all agents, expresses by a communication graph with nonnegative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement also 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 agents except for the sign. Necessary and sufficient conditions are obtained to describe cases in which this is possible. These conditions have strong analogies with the theory of monotone systems. Linear and nonlinear Laplacian feedback designs are proposed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 5×
“When instead is structurally balanced , as the agreement subspace is nontrivial, just like in the case of nonnegative weights, see [38].”
BackgroundInfluentialHorn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Spin glasses: Experimental facts, theoretical concepts, and open questions
Binder, K., & Young, A. P. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.801 · Cited by 5,177
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 3×
“In the consensus literature [36], [38], [40], this property is normally referred to as “balanced” tout-court (see [14], though).”
BackgroundStructural balance: a generalization of Heider's theory.
Cartwright, D., & Harary, F. (1956) · Psychological Review · doi:10.1037/h0046049 · Cited by 2,525
Opinion Dynamics and Bounded Confidence Models, Analysis and Simulation
Hegselmann, R., & Krause, U. (2002) · RePEc: Research Papers in Economics · Cited by 2,366
Monotone Dynamical Systems: An Introduction to the Theory of Competitive and Cooperative Systems
Smith, H. (2008) · Mathematical Surveys and Monographs · doi:10.1090/surv/041 · Cited by 2,294
Networks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Consensus protocols for networks of dynamic agents
Saber, R. O., & Murray, R. M. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1239709 · Cited by 901
Local Control Strategies for Groups of Mobile Autonomous Agents
Lin, Z., Broucke, M., & Francis, B. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825639 · Cited by 850
Stability of continuous-time distributed consensus algorithms
Moreau, L. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1429377 · Cited by 732
Zaslavsky, T. (1982) · Discrete Applied Mathematics · doi:10.1016/0166-218x(82)90033-6 · Cited by 548
State Agreement for Continuous‐Time Coupled Nonlinear Systems
Lin, Z., Francis, B., & Maggiore, M. (2007) · SIAM Journal on Control and Optimization · doi:10.1137/050626405 · Cited by 508
Distributed algorithms for reaching consensus on general functions
Cortés, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.022 · Cited by 469
Computing global structural balance in large-scale signed social networks
Facchetti, G., Iacono, G., & Altafini, C. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1109521108 · Cited by 440
Self-citationSpectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E. W., & Albayrak, S. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.49 · Cited by 369
Towards consensus: some convergence theorems on repeated averaging
Chatterjee, S., & Seneta, E. B. (1977) · Journal of Applied Probability · doi:10.1017/s0021900200104681 · Cited by 368
Matrix Diagonal Stability in Systems and Computation
Kaszkurewicz, E., & Bhaya, A. (2000) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-1346-8 · Cited by 365
Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks
Hui, Q., Haddad, W. M., & Bhat, S. P. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929392 · Cited by 313
Distributed nonlinear control algorithms for network consensus
Hui, Q., & Haddad, W. M. (2008) · Automatica · doi:10.1016/j.automatica.2008.01.011 · Cited by 276
Dynamics of Opinion Forming in Structurally Balanced Social Networks
Altafini, C. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038135 · Cited by 265
Self-citationNon-linear protocols for optimal distributed consensus in networks of dynamic agents
Bauso, D., Giarré, L., & Pesenti, R. (2006) · Systems & Control Letters · doi:10.1016/j.sysconle.2006.06.005 · Cited by 251
Smith, H. L. (1988) · SIAM Review · doi:10.1137/1030003 · Cited by 228
Monotone and near-monotone biochemical networks
Sontag, E. D. (2007) · Systems and Synthetic Biology · doi:10.1007/s11693-007-9005-9 · Cited by 208
Consensus problem in directed networks of multi-agents via nonlinear protocols
Liu, X., Chen, T., & Lu, W. (2009) · Physics Letters A · doi:10.1016/j.physleta.2009.06.054 · Cited by 159
Trust Evaluation in Anarchy: A Case Study on Autonomous Networks
Jiang, T., & Baras, J. S. (2006) · doi:10.1109/infocom.2006.156 · Cited by 99
Cao, L., Zheng, Y., & Zhou, Q. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2157393 · Cited by 60
Martin, S., & Antoine Girard, A. (2013) · SIAM Journal on Control and Optimization · doi:10.1137/11083438x · Cited by 57
Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
Ajorlou, A., Momeni, A., & Aghdam, A. G. (2011) · Automatica · doi:10.1016/j.automatica.2011.01.042 · Cited by 40
Iacono, G., & Altafini, C. (2010) · BMC Systems Biology · doi:10.1186/1752-0509-4-83 · Cited by 32
Self-citationOn Bifurcations in Nonlinear Consensus Networks
Srivastava, V., Moehlis, J., & Bullo, F. (2011) · Journal of Nonlinear Science · doi:10.1007/s00332-011-9103-4 · Cited by 24
Trust Estimation in autonomic networks: a statistical mechanics approach
Ermon, S., Schenato, L., & Zampieri, S. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5400923 · Cited by 22
Bauso, D., Giarré, L., & Pesenti, R. (2009) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2009.5160410 · Cited by 8
Cited by
Recent Advances in Consensus of Multi-Agent Systems: A Brief Survey
Qin, J., Ma, Q., Shi, Y., & Wang, L. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2636810 · Cited by 863
A tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
Consensus in multi-agent systems: a review
Amirkhani, A., & Barshooi, A. H. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10097-x · Cited by 476
Valcher, M. E., & Misra, P. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.01.006 · Cited by 415
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Metadata
- Authors
- Altafini, C.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-04
- Volume
- 58
- Issue
- 4
- Pages
- 935-946
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1967509640
- Cited by
- 2,109
- References
- 40
- FWCI
- 46.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.