Gaussian Learning-Without-Recall in a dynamic social network

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We analyze the dynamics of the Learning-Without-Recall model with Gaussian priors in a dynamic social network. Agents seeking to learn the state of the world, the 'truth', exchange signals about their current beliefs across a changing network and update them accordingly. The agents are assumed memoryless and rational, meaning that they Bayes-update their beliefs based on current states and signals, with no other information from the past. The other assumption is that each agent hears a noisy signal from the truth at a frequency bounded away from zero. Under these conditions, we show that the system reaches truthful consensus almost surely with a convergence rate that is polynomial in expectation. Somewhat paradoxically, high outdegree can slow down the learning process. The lower-bound assumption on the truth-hearing frequency is necessary: even infinitely frequent access to the truth offers no guarantee of truthful consensus in the limit.

Original languageEnglish (US)
Title of host publication2017 American Control Conference, ACC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781509059928
StatePublished - Jun 29 2017
Externally publishedYes
Event2017 American Control Conference, ACC 2017 - Seattle, United States
Duration: May 24 2017May 26 2017

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619


Other2017 American Control Conference, ACC 2017
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Gaussian Learning-Without-Recall in a dynamic social network'. Together they form a unique fingerprint.

Cite this