Spread of (mis)information in social networks
type: Item
instance of: scholarly article
title: Spread of (mis)information in social networks
zbMATH Open document ID: 1202.91284
author: Daron Acemoglu
author: Asuman Ozdaglar
author: Ali ParandehGheibi
published in: Games and Economic Behavior
publication date: 2010-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/0906.5007
full work available at URL: http://hdl.handle.net/1721.1/61745
review text: Consider a social network, where individuals meet pairwise and exchange information. An agent is forceful if he influences the beliefs of other agents, but is not influenced by others. This setup induces a Markov chain. The main result of the paper characterizes the consensus distribution of that Markov chain. This distribution contains misinformation, the extent of which can be measured.
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 91A26
Mathematics Subject Classification ID: 91B44
zbMATH DE Number: 5819677
zbMATH Keywords: information aggregation
zbMATH Keywords: learning
zbMATH Keywords: misinformation
zbMATH Keywords: social networks
MaRDI profile type: Publication
OpenAlex ID: W3121562466
arXiv ID: 0906.5007
cites work: Bayesian learning in social networks
cites work: Learning from Neighbours
cites work: Conformism and diversity under social learning.
cites work: Word-of-mouth learning.
cites work: Markov Chains
cites work: Observational learning under imperfect information
cites work: Open problems of Paul Erd�s in graph theory
cites work: Strategic Information Transmission
cites work: Reaching a Consensus
cites work: Persuasion Bias, Social Influence, and Unidimensional Opinions
cites work: Average Consensus with Packet Drop Communication
cites work: Bayesian learning in social networks.
cites work: Strategic information transmission networks
cites work: Strategic Communication Networks
cites work: Perturbation bounds for the stationary probabilities of a finite Markov chain
cites work: Q3526040
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: Finite Continuous Time Markov Chains
cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
cites work: Convergence Speed in Distributed Consensus and Averaging
cites work: Q4340161
cites work: Perturbation theory and finite Markov chains
cites work: Pathological Outcomes of Observational Learning
cites work: Equilibrium Selection in Signaling Games
cites work: Distributed asynchronous deterministic and stochastic gradient optimization algorithms
DOI: 10.1016/J.GEB.2010.01.005
description: scientific article