Naive learning in social networks with random communication

被引:4
|
作者
Huang, Jia-Ping [1 ]
Heidergott, Bernd [2 ]
Lindner, Ines [3 ]
机构
[1] Shenzhen Univ, China Ctr Special Econ Zone Res, Nanhai Ave 3688, Shenzhen 518060, Peoples R China
[2] Vrije Univ Amsterdam, Dept Econometr & Operat Res, De Boelelaan 1105, NL-1081 HV Amsterdam, Netherlands
[3] Tinhergen Inst, Gustav Mahlerpl 117, NL-1082 MS Amsterdam, Netherlands
关键词
Wisdom of crowds; Social networks; Naive learning;
D O I
10.1016/j.socnet.2019.01.004
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
We study social learning in a social network setting where agents receive independent noisy signals about the truth. Agents naively update beliefs by repeatedly taking weighted averages of neighbors' opinions. The weights are fixed in the sense of representing average frequency and intensity of social interaction. However, the way people communicate is random such that agents do not update their belief in exactly the same way at every point in time. Our findings, based on Theorem 1, Corollary 1 and simulated examples, suggest the following. Even if the social network does not privilege any agent in terms of influence, a large society almost always fails to converge to the truth. We conclude that wisdom of crowds seems an illusive concept and bares the danger of mistaking consensus for truth.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条
  • [31] MESSAGE PROPAGATION THROUGH RANDOM COMMUNICATION NETWORKS
    MATTEI, A
    FISCHL, R
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1972, CO20 (05) : 946 - &
  • [32] Random graph models of social networks
    Newman, MEJ
    Watts, DJ
    Strogatz, SH
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 : 2566 - 2572
  • [33] The Power of Random Neighbors in Social Networks
    Lattanzi, Silvio
    Singer, Yaron
    WSDM'15: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2015, : 77 - 86
  • [34] TURNOUT INTENTION AND RANDOM SOCIAL NETWORKS
    Fosco, Constanza
    Laruelle, Annick
    Sanchez, Angel
    ADVANCES IN COMPLEX SYSTEMS, 2011, 14 (01): : 31 - 53
  • [35] Communication in random geometric radio networks with positively correlated random faults
    Kranakis, Evangelos
    Paquette, Michel
    Pelc, Andrzej
    AD-HOC, MOBILE AND WIRELESS NETWORKS, PROCEEDINGS, 2008, 5198 : 108 - +
  • [36] Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
    Kranakis, Evangelos
    Paquette, Michel
    Pelc, Andrzej
    AD HOC & SENSOR WIRELESS NETWORKS, 2010, 9 (1-2) : 23 - 52
  • [37] Learning by optimization in random neural networks
    Atalay, V
    ADVANCES IN COMPUTER AND INFORMATION SCIENCES '98, 1998, 53 : 143 - 148
  • [38] Deep Learning with Random Neural Networks
    Gelenbe, Erol
    Yin, Yongha
    2016 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2016, : 1633 - 1638
  • [39] Deep Learning with Random Neural Networks
    Gelenbe, Erol
    Yin, Yongha
    PROCEEDINGS OF SAI INTELLIGENT SYSTEMS CONFERENCE (INTELLISYS) 2016, VOL 2, 2018, 16 : 450 - 462
  • [40] LIMITATIONS ON COMPLEXITY OF RANDOM LEARNING NETWORKS
    OFFNER, F
    BIOPHYSICAL JOURNAL, 1965, 5 (02) : 195 - &