Loading...
research article
Social Learning Over Weakly Connected Graphs
In this paper, we study diffusion social learning over weakly connected graphs. We show that the asymmetric flow of information hinders the learning abilities of certain agents regardless of their local observations. Under some circumstances that we clarify in this paper, a scenario of total influence (or “mind-control”) arises where a set of influential agents ends up shaping the beliefs of noninfluential agents. We derive useful closed-form expressions that characterize this influence, and which can be used to motivate design problems to control it. We provide simulation examples to illustrate the results.
Type
research article
ArXiv ID
1609.03703
Authors
Publication date
2017
Volume
3
Issue
2
Start page
222
End page
238
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 14, 2018
Use this identifier to reference this record