Articles

OPINION DYNAMICS ON SOCIAL NETWORKS

  • Xing WANG ,
  • Bingjue JIANG ,
  • Bo LI
Expand
  • 1. KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;
    2. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China

Received date: 2022-07-30

  Online published: 2022-12-16

Supported by

This work was partially supported by the National Natural Science Foundation of China (61873262).

Abstract

Opinion dynamics has recently attracted much attention, and there have been a lot of achievements in this area. This paper first gives an overview of the development of opinion dynamics on social networks. We introduce some classical models of opinion dynamics in detail, including the DeGroot model, the Krause model, 0-1 models, sign networks and models related to Gossip algorithms. Inspired by some real life cases, we choose the unit circle as the range of the individuals’ opinion values. We prove that the individuals’ opinions of the randomized gossip algorithm in which the individuals’ opinion values are on the unit circle reaches consensus almost surely.

Cite this article

Xing WANG , Bingjue JIANG , Bo LI . OPINION DYNAMICS ON SOCIAL NETWORKS[J]. Acta mathematica scientia, Series B, 2022 , 42(6) : 2459 -2477 . DOI: 10.1007/s10473-022-0616-8

References

[1] Akers R L, Krohn M D, Lanza-Kaduce L, Radosevich M. Social learning and deviant behavior: A specific test of a general theory. American Sociological Review, 1979, 44(4): 636-655
[2] Wood W. Attitude change: persuasion and social influence. Annu Rev Psychol, 2000, 51: 539-570
[3] Jadbabaie A, Lin J, Morse A S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 2003, 48(6): 988-1001
[4] Ren W, Beard R W. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 2005, 50(5): 655-661
[5] Olfati-Saber R, Fax J A, Murray R M. Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 2007, 95(1): 215-233
[6] Kar S, Moura J M. Distributed consensus algorithms in sensor networks: Quantized data and random link failures. IEEE Transactions on Signal Processing, 2009, 58(3): 1383-1400
[7] Easley D, Kleinberg J. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. New York: Cambridge University Press, 2010
[8] Golub B, Jackson M O. Naive learning in social networks and the wisdom of crowds. American Economic Journal: Microeconomics, 2010, 2(1): 112-149
[9] Eugster P T, Guerraoui R, Handurukande S B, et al. Lightweight probabilistic broadcast. ACM Transactions on Computer Systems, 2003, 21(4): 341-374
[10] Jelasity M, Montresor A, Babaoglu O. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems, 2005, 23(3): 219-252
[11] Shah D. Gossip Algorithms. Now Foundations and Trends, 2009
[12] Dimakis A G, Kar S, Moura J M, et al. Gossip algorithms for distributed signal processing. Proceedings of the IEEE, 2010, 98(11): 1847-1864
[13] Bullo F, Carli R, Frasca P. Gossip coverage control for robotic networks: Dynamical systems on the space of partitions. SIAM Journal on Control and Optimization, 2012, 50(1): 419-447
[14] Tsianos K I, Rabbat M G. Consensus-based distributed online prediction and optimization//2013 IEEE Global Conference on Signal and Information Processing. IEEE, 2013: 807-810
[15] DeGroot M H. Reaching a consensus. Journal of the American Statistical Association, 1974, 69(345): 118-121
[16] Krause U. Soziale dynamiken mit vielen interakteuren. eine problemskizze. Modellierung und Simulation von Dynamiken mit vielen interagierenden Akteuren, 1997, 3751: 2
[17] Hegselmann R, Krause U. Opinion dynamics and bounded confidence models, analysis and simulation. Journal of Artificial Societies and Social Simulation, 2002, 5(3): 1-33
[18] Blondel V D, Hendrickx J M, Tsitsiklis J N. On Krause’s multi-agent consensus model with state-dependent connectivity. IEEE transactions on Automatic Control, 2009, 54(11): 2586-2597
[19] Shi G, Johansson M, Johansson K H. How agreement and disagreement evolve over random dynamic networks. IEEE Journal on Selected Areas in Communications, 2013, 31(6): 1061-1071
[20] Shi G, Proutiere A, Johansson M, et al. The evolution of beliefs over signed social networks. Operations Research, 2016, 64(3): 585-604
[21] Shi G, Altafini C, Baras J S. Dynamics over signed networks. SIAM Review, 2019, 61(2): 229-257
[22] Cao Z, Gao H, Qu X, et al. Fashion, cooperation, and social interactions. PLoS ONE, 2013, 8(1): e49441
[23] Cao Z, Yang X. The fashion game: network extension of matching pennies. Theoretical Computer Science, 2014, 540: 169-181
[24] Zhang B, Cao Z, Qin C Z, et al. Fashion and homophily. Operations Research, 2018, 66(6): 1486-1497
[25] Cao Z, Qin C Z, Yang X, et al. Dynamic matching pennies on networks. International Journal of Game Theory, 2019, 48(3): 887-920
[26] Young H P. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton, NJ: Princeton University Press, 2001
[27] Jackson M O. Social and Economic Networks. Princeton, NJ: Princeton University Press, 2010
[28] Demers A, Greene D, Hauser C, et al. Epidemic algorithms for replicated database maintenance// Proceedings of the sixth annual ACM Symposium on Principles of distributed computing. New York: Association for Computing Machinery, 1987: 1-12
[29] Boyd S, Ghosh A, Prabhakar B, et al. Randomized gossip algorithms. IEEE Transactions on Information Theory, 2006, 52(6): 2508-2530
[30] Shi G, Li B, Johansson M, et al. Finite-time convergent gossiping. IEEE/ACM Transactions on Networking, 2015, 24(5): 2782-2794
[31] Li B, Wu J, Qi H, et al. Boolean gossip networks. IEEE Computer Architecture Letters, 2018, 26(1): 118-130
[32] Karp R, Schindelhauer C, Shenker S, et al. Randomized rumor spreading//Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE, 2000: 565-574
[33] Kauffman S A. Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 1969, 22(3): 437-467
[34] Van Mieghem P, Omic J, Kooij R. Virus Spread in Networks. IEEE/ACM Transactions on Networking, 2009, 17(1): 1-14
[35] Yildiz E, Ozdaglar A, Acemoglu D, et al. Binary opinion dynamics with stubborn agents. ACM Transactions on Economics and Computation, 2013, 1(4): 1-30
[36] Zeng Y, Hendriks R C, Heusdens R. Clique-based distributed beamforming for speech enhancement in wireless sensor networks//21st European Signal Processing Conference (EUSIPCO2013). IEEE, 2013: 1-5
[37] Biswas K, Muthukkumarasamy V, Sithirasenan E, et al. An energy efficient clique based clustering and routing mechanism in wireless sensor networks//2013 9th International Wireless Communications and Mobile Computing Conference. IEEE, 2013: 171-176
[38] Li B, Li S, Wu J, et al. Quantum clique gossiping. Scientific Reports, 2018, 8(1): 2747
[39] Liu Y, Li B, Anderson B D, et al. Clique gossiping. IEEE/ACM Transactions on Networking, 2019, 27(6): 2418-2431
[40] Shi G, Li B, Miao Z et al. Reaching agreement in quantum hybrid networks. Scientific Reports, 2017, 7(1): 1-9
Options
Outlines

/