The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Predictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions
Open accessAbstract
For communities of agents which are not necessarily cooperating, distributed processes of opinion forming are naturally represented by signed graphs, with positive edges representing friendly and cooperative interactions and negative edges the corresponding antagonistic counterpart. Unlike for nonnegative graphs, the outcome of a dynamical system evolving on a signed graph is not obvious and it is in general difficult to characterize, even when the dynamics are linear. In this paper, we identify a significant class of signed graphs for which the linear dynamics are however predictable and show many analogies with positive dynamical systems. These cases correspond to adjacency matrices that are eventually positive, for which the Perron-Frobenius property still holds and implies the existence of an invariant cone contained inside the positive orthant. As examples of applications, we determine cases in which it is possible to anticipate or impose unanimity of opinion in decision/voting processes even in presence of stubborn agents, and show how it is possible to extend the PageRank algorithm to include negative links.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 · cited 1×
“In particular, if collaboration is encoded as nonnegativity of the adjacency matrix of the graph, including non-collaborative interactions means resorting to signed graphs [3], [16], [18], [38], [44], [45].”
BackgroundThe anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×
“If we think of a distributed control problem on Γ(A) for the system (16), then L can be intended as obtained by choosing ui = − ∑ j∈adj(i) aij(xi − xj) [28], [36], or, in matrix form”
BackgroundOpinion Dynamics and Learning in Social Networks
Acemoglu, D., & Ozdaglar, A. (2011) · Dynamic Games and Applications · doi:10.1007/s13235-010-0004-1 · Cited by 705
Cited by
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
Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization
Proskurnikov, A. V., Matveev, A. S., & Cao, M. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2471655 · Cited by 357
A tutorial on modeling and analysis of dynamic social networks. Part II
Proskurnikov, A. V., & Tempo, R. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.03.005 · Cited by 294
Metadata
- Authors
- Altafini, C., & Lini, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-02
- Volume
- 60
- Issue
- 2
- Pages
- 342-357
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2004621158
- Cited by
- 209
- References
- 4
- FWCI
- 9.45
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions. https://app.cochat.ai/papers/10.1109/tac.2014.2343371
- The paper
- Altafini, C., & Lini, G. (2015). Predictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2014.2343371
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.
