Analysis of naming game based collective behavior with biased assimilation over adaptive networks
详细信息 查看官网全文
- 英文论文题名：Analysis of naming game based collective behavior with biased assimilation over adaptive networks
- 论文作者：Guiyuan Fu ; Weidong Zhang
- 英文论文作者：Guiyuan Fu ; Weidong Zhang ; Department of Automation ; Shanghai Jiaotong University and Key Laboratory of System Control and Information Processing ; Ministry of Education of China
- 年：2017
- 作者机构：Department of Automation,Shanghai Jiaotong University and Key Laboratory of System Control and Information Processing,Ministry of Education of China;
- 英文论文关键词：Two-word naming game ; Biased assimilation ; Adaptive network ; Collective behavior
- 会议召开时间：2017-07-26
- 会议录名称：第36届中国控制会议论文集（A）
- 英文会议录名称：Proceedings of the 36th Chinese Control Conference（A）
- 语种：英文
- 分类号：O157.5
- 学会代码：KZLL
- 会议名称：第36届中国控制会议
- 会议地点：中国辽宁大连
- 主办单位：中国自动化学会控制理论专业委员会
- 学会名称：中国自动化学会控制理论专业委员会
- 页数：5
- 文件大小：189k
- 原文格式：D
- 会议级别：全国
摘要
The dynamics of two-word naming game incorporating the influence of biased assimilation is investigated in this paper. Firstly an extended naming game with biased assimilation(NGBA) is proposed. The hearer in NGBA accepts the received information in a biased manner, where he will refuse to accept the conveyed word with a predefined probability, if it is different from his own current memory. Secondly, the adaptive network is formulated, where the existing links may be reconnected so that the individual can influence other individuals over the population as much as possible. Numerical simulation results show that the population in NGBA can eventually reach consensus; the larger strength of biased assimilation on both words, the slower convergence speed, while larger strength of biased assimilation on only one word can slightly accelerate the convergence; larger population size can make the rate of convergence slower to a large extent when it increases from relatively small size, but such effect becomes minor when the population size is large; the behavior of adaptively reconnecting the existing links can greatly accelerate the rate of convergence.
The dynamics of two-word naming game incorporating the influence of biased assimilation is investigated in this paper. Firstly an extended naming game with biased assimilation(NGBA) is proposed. The hearer in NGBA accepts the received information in a biased manner, where he will refuse to accept the conveyed word with a predefined probability, if it is different from his own current memory. Secondly, the adaptive network is formulated, where the existing links may be reconnected so that the individual can influence other individuals over the population as much as possible. Numerical simulation results show that the population in NGBA can eventually reach consensus; the larger strength of biased assimilation on both words, the slower convergence speed, while larger strength of biased assimilation on only one word can slightly accelerate the convergence; larger population size can make the rate of convergence slower to a large extent when it increases from relatively small size, but such effect becomes minor when the population size is large; the behavior of adaptively reconnecting the existing links can greatly accelerate the rate of convergence.
The dynamics of two-word naming game incorporating the influence of biased assimilation is investigated in this paper. Firstly an extended naming game with biased assimilation(NGBA) is proposed. The hearer in NGBA accepts the received information in a biased manner, where he will refuse to accept the conveyed word with a predefined probability, if it is different from his own current memory. Secondly, the adaptive network is formulated, where the existing links may be reconnected so that the individual can influence other individuals over the population as much as possible. Numerical simulation results show that the population in NGBA can eventually reach consensus; the larger strength of biased assimilation on both words, the slower convergence speed, while larger strength of biased assimilation on only one word can slightly accelerate the convergence; larger population size can make the rate of convergence slower to a large extent when it increases from relatively small size, but such effect becomes minor when the population size is large; the behavior of adaptively reconnecting the existing links can greatly accelerate the rate of convergence.
引文
[1]A.Baronchelli,C.Castellano and R.Pastor-Satorras.Voter models on weighted networks,Physical Review E,83(6):066117,2011.
[2]J.Lorenz,Continuous opinion dynamics under bounded confidence:A survey,International Journal of Modern Physics C,18(12):1819-1838,2007.
[3]L.Dall’Asta,A.Baronchelli,A.Barrat,and V.Loreto,Nonequilibrium dynamics of language games on complex networks,Physical Review E,74(3):036105,2006.
[4]A.Baronchelli,M.Felici,V.Loreto,E.Caglioti and L.Steels,Sharp transition towards shared vocabularies in multi-agent systems,Journal of Statistical Mechanics:Theory and Experiment,2006(6):P06014,2006.
[5]S.K.Maity,T.V.Manoj and A.Mukherjee,Opinion formation in time-varying social networks:The case of the naming game,Physical Review E,86(3):036110,2012.
[6]Q.Lu,G.Korniss,and B.K.Szymanski,The naming game in social networks:community formation and consensus engineering,Journal of Economic Interaction and Coordination,4(2):221-235,2009.
[7]W.X.Wang,B.Y.Lin,C.L.Tang and G.R.Chen,Agreement dynamics of finite-memory language games on networks,The European Physical Journal B,60(4):529-536,2007.
[8]A.Baronchelli,L.Dall’Asta,A.Barrat and V.Loreto,Nonequilibrium phase transition in negotiation dynamics,Physical Review E,76(5):3-6,2007.
[9]Q.Lu,G.Korniss and B.K.Szymanski,Naming games in two-dimensional and small-world-connected random geometric networks,Physical Review E,77:016111,2008.
[10]A.Baronchelli,Role of feedback and broadcasting in the naming game,Physical Review E,83(4):46103,2011.
[11]J.Xie,J.Emenheiser,M.Kirby,S.Sreenivasan,B.K.Szymanski and G.Korniss,Evolution of opinions on social networks in the presence of competing committed groups,Plo S one,7(3):e33215,2012.
[12]B.Li,G.Chen and T.W.S.Chow,Naming Game with Multiple Hearers,Communications in Nonlinear Science and Numerical Simulation,18(5):1214-1228,2013.
[13]A.M.Thompson,B.K.Szymanski and C.C.Lim,Propensity and stickiness in the naming game:tipping fractions of minorities,Physical review E,90(4):042809,2014.
[14]Y.Gao,G.Chen and R.H.M.Chan,Naming Game on Networks:Let Everyone be Both Speaker and Hearer,Scientific Reports,4:6149,2014.
[15]Lou,Y.and Chen,G.Analysis of the“naming game”with learning errors in communications,Scientific Reports,5:12191,2015.
[16]G.Fu,W.Zhang,Analysis of collective behavior over complex network based on namging game with memory loss,American Control Conference,2017,Accepted.
[17]G.D.Munro,P.H.Ditto,L.K.Lockhart,A.Fagerlin,M.Gready,and E.Peterson,Biased Assimilation of Sociopolitical Arguments:Evaluating the 1996 U.S.Presidential Debate,Basic and Applied Social Psychology,24(1):15-26,2002.
[18]C.G.Lord and L.Ross,Biased assimilation and attitude polarization:The effects of prior theories on subsequently considered evidence,Journal of Personality and Social Psychology,37(11):2098-2109,1979.
[19]P.Erds and A.Rényi,On the evolution of random graphs,Publications of the Mathematical Institute of the Hungarian Academy of Sciences,5:17-61,1960.
[20]A.-L.Barabsi and R.Albert,Emergence of Scaling in Random Networks,Science,286(5439):509-512,1999.
[2]J.Lorenz,Continuous opinion dynamics under bounded confidence:A survey,International Journal of Modern Physics C,18(12):1819-1838,2007.
[3]L.Dall’Asta,A.Baronchelli,A.Barrat,and V.Loreto,Nonequilibrium dynamics of language games on complex networks,Physical Review E,74(3):036105,2006.
[4]A.Baronchelli,M.Felici,V.Loreto,E.Caglioti and L.Steels,Sharp transition towards shared vocabularies in multi-agent systems,Journal of Statistical Mechanics:Theory and Experiment,2006(6):P06014,2006.
[5]S.K.Maity,T.V.Manoj and A.Mukherjee,Opinion formation in time-varying social networks:The case of the naming game,Physical Review E,86(3):036110,2012.
[6]Q.Lu,G.Korniss,and B.K.Szymanski,The naming game in social networks:community formation and consensus engineering,Journal of Economic Interaction and Coordination,4(2):221-235,2009.
[7]W.X.Wang,B.Y.Lin,C.L.Tang and G.R.Chen,Agreement dynamics of finite-memory language games on networks,The European Physical Journal B,60(4):529-536,2007.
[8]A.Baronchelli,L.Dall’Asta,A.Barrat and V.Loreto,Nonequilibrium phase transition in negotiation dynamics,Physical Review E,76(5):3-6,2007.
[9]Q.Lu,G.Korniss and B.K.Szymanski,Naming games in two-dimensional and small-world-connected random geometric networks,Physical Review E,77:016111,2008.
[10]A.Baronchelli,Role of feedback and broadcasting in the naming game,Physical Review E,83(4):46103,2011.
[11]J.Xie,J.Emenheiser,M.Kirby,S.Sreenivasan,B.K.Szymanski and G.Korniss,Evolution of opinions on social networks in the presence of competing committed groups,Plo S one,7(3):e33215,2012.
[12]B.Li,G.Chen and T.W.S.Chow,Naming Game with Multiple Hearers,Communications in Nonlinear Science and Numerical Simulation,18(5):1214-1228,2013.
[13]A.M.Thompson,B.K.Szymanski and C.C.Lim,Propensity and stickiness in the naming game:tipping fractions of minorities,Physical review E,90(4):042809,2014.
[14]Y.Gao,G.Chen and R.H.M.Chan,Naming Game on Networks:Let Everyone be Both Speaker and Hearer,Scientific Reports,4:6149,2014.
[15]Lou,Y.and Chen,G.Analysis of the“naming game”with learning errors in communications,Scientific Reports,5:12191,2015.
[16]G.Fu,W.Zhang,Analysis of collective behavior over complex network based on namging game with memory loss,American Control Conference,2017,Accepted.
[17]G.D.Munro,P.H.Ditto,L.K.Lockhart,A.Fagerlin,M.Gready,and E.Peterson,Biased Assimilation of Sociopolitical Arguments:Evaluating the 1996 U.S.Presidential Debate,Basic and Applied Social Psychology,24(1):15-26,2002.
[18]C.G.Lord and L.Ross,Biased assimilation and attitude polarization:The effects of prior theories on subsequently considered evidence,Journal of Personality and Social Psychology,37(11):2098-2109,1979.
[19]P.Erds and A.Rényi,On the evolution of random graphs,Publications of the Mathematical Institute of the Hungarian Academy of Sciences,5:17-61,1960.
[20]A.-L.Barabsi and R.Albert,Emergence of Scaling in Random Networks,Science,286(5439):509-512,1999.