Predictable dynamics of opinion forming for networks with antagonistic interactions

IEEE Transactions on Automatic Control

Volumn 60, Issue 2, 2015, Pages 342-357

  Altafini, Claudio ^a,b   Lini, Gabriele ^a,c  

^a SISSA   (Italy)

^b LINKÖPING UNIVERSITY   (Sweden)

^c Magneti Marelli SpA Venaria Reale (TO)   (Italy)

Author keywords

Eventually positive matrices; invariant cones; opinion dynamics; Perron Frobenius theorem; signed graphs; social networks

Indexed keywords

DYNAMICAL SYSTEMS; GRAPHIC METHODS; MATRIX ALGEBRA; SOCIAL NETWORKING (ONLINE);

INVARIANT CONE; OPINION DYNAMICS; PERRON-FROBENIUS THEOREM; POSITIVE MATRICES; SIGNED GRAPHS;

DYNAMICS;

EID: 84921776186     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2014.2343371     Document Type: Article

References (46)

1. D. Acemoglu, G. Como, F. Fagnani, and A. Ozdaglar, "Opinion fluctuations and persistent disagreement in social networks," in Proc. 50th IEEE Conf. Decision Control & Eur. Control Conf. (CDC-ECC), 2011, pp. 2347-2352.
2. D. Acemoglu and A. Ozdaglar, "Opinion dynamics and learning in social networks," Dyn. Games Appl., vol. 1, no. 1, pp. 3-49, 2011.
3. C. Altafini, "Dynamics of opinion forming in structurally balanced social networks," PLoS ONE, vol. 7, no. 6, p. 38135, 2012.
4. C. Altafini, "Consensus problems on networks with antagonistic interactions," IEEE Trans. Autom. Control, vol. 58, no. 4, pp. 935-946, 2013.
5. A. Berman and R. J. Plemmons, "Nonnegative matrices in the mathematical sciences," Classics Appl. Math., Soc. Ind. Appl. Math., 1994.
6. F. Blanchini, "Set invariance in control," Automatica, vol. 35, pp. 1747-1767, 1999.
7. F. Blanchini and S. Miani, "Set-theoretic methods in control," in Systems & Control. Boston, MA: Birkhäuser, 2008.
8. V. D. Blondel, J. M. Hendrickx, and J. N. Tsitsiklis, "On Krause's multiagent consensus model with state-dependent connectivity," IEEE Trans.Autom. Control, vol. 54, no. 11, pp. 2586-2597, Nov. 2009.
9. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," in Proc. 7th Int. Conf. World Wide Web 7, WWW7.Amsterdam, The Netherlands: Elsevier Science Publishers B. V., 1998, pp. 107-117.
10. K. Bryan and T. Leise, "The 25 000 000 000 eigenvector: The linear algebra behind Google," SIAM Rev., vol. 48, no. 3, pp. 569-581, 2006.
11. D. Cartwright and F. Harary, "Structural balance: A generalization of Heider's theory," Psychological Rev., vol. 63, pp. 277-292, 1956.
12. E. B. Castelan and J.-C. Hennet, "On invariant polyhedra of continuoustime linear systems," IEEE Trans. Autom. Control, vol. 38, no. 11, pp. 1680-1685, 1993.
13. F. Chung, A. Tsiatas, and W. Xu, "Dirichlet pagerank and ranking algorithms based on trust and distrust," Internet Math., vol. 9, no. 1, pp. 113-134, 2013.
14. C. De Kerchove and P. Van Dooren, "The PageTrust algorithm: How to rank web pages when negative links are allowed," in Proc. SIAM Int. Conf.Data Mining, 2008, pp. 346-252.
15. C. E. T. Dórea and J.-C. Hennet, "(A, B)-invariance conditions of polyhedral domains for continuous-time systems," Eur. J. Control, vol. 5, no. 1, pp. 70-81, 1999.
16. D. Easley and J. Kleinberg, Networks, Crowds, Markets. Reasoning About a Highly Connected World. Cambridge, U.K.: Cambridge Univ. Press, 2010.
17. A. Elhashash and D. B. Szyld, "On general matrices having the Perron-Frobenius property," Electron. J. Linear Algebra Electron., vol. 17, pp. 389-413, 2008.
18. G. Facchetti, G. Iacono, and C. Altafini, "Computing global structural balance in large-scale signed social networks," in Proc. Nat. Ac. Sci., 2011, vol. 108, pp. 20953-20958.
19. L. Farina and L. Benvenuti, "Invariant polytopes of linear systems," IMA J. Math. Control Inform., vol. 15, no. 3, pp. 233-240, 1998.
20. L. Farina and S. Rinaldi, Positive Linear Systems: Theory and Applications.New York: Wiley, 2000.
21. P. Frasca, C. Ravazzi, R. Tempo, and H. Ishii, "Gossips and prejudices: Ergodic randomized dynamics in social networks," in Proc. 4th IFAC Workshop Distrib. Estim. Control Networked Syst., Sep. 2013, vol. 4, pp. 212-219.
22. N. E. Friedkin and E. C. Johnsen, "Social influence networks and opinion change," Adv. Group Processes, vol. 16, pp. 1-29, 1999.
23. S. Friedland, "On an inverse problem for nonnegative and eventually nonnegative matrices," Israel J. Math., vol. 29, no. 1, pp. 43-60, 1978.
24. G. Iacono, F. Ramezani, N. Soranzo, and C. Altafini, "Determining the distance to monotonicity of a biological network: A graph-theoretical approach," IET Syst. Biol., vol. 4, no. 3, pp. 223-235, 2010.
25. H. Ishii and R. Tempo, "Distributed randomized algorithms for the Page-Rank computation," IEEE Trans. Autom. Control, vol. 55, no. 9, pp. 1987-2002, 2010.
26. C. R. Johnson and P. Tarazaga, "On matrices with Perron-Frobenius properties and some negative entries," Positivity, vol. 8, no. 4, pp. 327-338, 2004.
27. J. Maybee and J. Quirk, "Qualitative problems in matrix theory," SIAM Rev., vol. 11, no. 1, pp. 30-51, 1969.
28. M. Mesbahi and M. Egerstedt, Graph-Theoretic Methods in Multiagent Networks. Princeton, NJ: Princeton Univ. Press, 2010.
29. B. E. A. Milani and C. E. T. Dórea, "On invariant polyhedra of continuoustime systems subject to additive disturbances," Automatica, vol. 32, no. 5, pp. 785-789, 1996.
30. I.-C. Morarescu and A. Girard, "Opinion dynamics with decaying confidence: Application to community detection in graphs," IEEE Trans.Autom. Control, vol. 56, no. 8, pp. 1862-1873, 2011.
31. F. Morbidi, F. Bullo, and D. Prattichizzo, "Visibility maintenance via controlled invariance for leader-follower vehicle formations," Automatica, vol. 47, no. 5, pp. 1060-1067, 2011.
32. D. Noutsos and M. Tsatsomeros, "Reachability and holdability of nonnegative states," SIAM J. Matrix Anal. Appl., vol. 30, no. 2, pp. 700-712, 2008.
33. D. Noutsos, "On Perron-Frobenius property of matrices having some negative entries," Linear Algebra Appl., vol. 412, pp. 132-153, 2006.
34. D. D. Olesky, M. J. Tsatsomeros, and P. van den Driessche, "Mv- matrices: A generalization ofM-matrices based on eventually nonnegative matrices," Electron. J. Linear Algebra, vol. 18, pp. 339-351, 2009.
35. N. J. Pullman, "A geometric approach to the theory of nonnegative matrices," Linear Algebra Appl., vol. 4, pp. 297-312, 1971.
36. W. Ren, R. W. Beard, and E. M. Atkins, "Information consensus in multivehicle cooperative control," IEEE Control Syst., vol. 27, no. 2, pp. 71-82, 2007.
37. E. Seneta, Non-negative Matrices and Markov Chains. New York: Springer, 2006.
38. G. Shi, A. Proutiere, M. Johansson, J. Baras, K. H. Johansson et al., "Emergent behaviors over signed random networks in dynamical environments," arXiv preprint arXiv:1309.5488, 2013.
39. H. L. Smith, "Systems of ordinary differential equations which generate an order preserving flow. A survey of results," SIAM Rev., vol. 30, no. 1, pp. 87-113, 1988.
40. S. Tarbouriech and C. Burgat, "Positively invariant sets for constrained continuous-time systems with cone properties," IEEE Trans. Autom.Control, vol. 39, no. 2, pp. 401-405, Feb. 1994.
41. A. Tiwari, J. Fung, R. Bhattacharya, and R. M. Murray, "Polyhedral cone invariance applied to rendezvous of multiple agents," in Proc. 43rd IEEE Conf. Decision Control (CDC), 2004, vol. 1, pp. 165-170.
42. V. A. Traag, Y. E. Nesterov, and P. Van Dooren, "Exponential ranking: Taking into account negative links," in Proc. 2nd Int. Conf. Social Inform.(SocInfo'10), Berlin, Germany, 2010, pp. 192-202.
43. M. Valcher and L. Farina, "An algebraic approach to the construction of polyhedral invariant cones," SIAM J. Matrix Anal. Appl., vol. 22, no. 2, pp. 453-471, 2000.
44. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications.Cambridge, U.K.: Cambridge Univ. Press, 1994.
45. W. Xia and M. Cao, "Clustering in diffusively coupled networks," Automatica, vol. 47, no. 11, pp. 2395-2405, 2011.
46. Y. Yang, D. V. Dimarogonas, and X. Hu, "Opinion consensus of modified Hegselmann-Krause models," in Proc. IEEE 51st Annu. Conf. Decision Control (CDC'12), 2012, pp. 100-105.