Threshold learning dynamics in social networks
- PMID: 21637714
- PMCID: PMC3103531
- DOI: 10.1371/journal.pone.0020207
Threshold learning dynamics in social networks
Abstract
Social learning is defined as the ability of a population to aggregate information, a process which must crucially depend on the mechanisms of social interaction. Consumers choosing which product to buy, or voters deciding which option to take with respect to an important issue, typically confront external signals to the information gathered from their contacts. Economic models typically predict that correct social learning occurs in large populations unless some individuals display unbounded influence. We challenge this conclusion by showing that an intuitive threshold process of individual adjustment does not always lead to such social learning. We find, specifically, that three generic regimes exist separated by sharp discontinuous transitions. And only in one of them, where the threshold is within a suitable intermediate range, the population learns the correct information. In the other two, where the threshold is either too high or too low, the system either freezes or enters into persistent flux, respectively. These regimes are generally observed in different social networks (both complex or regular), but limited interaction is found to promote correct learning by enlarging the parameter region where it occurs.
Conflict of interest statement
Figures
(from red,
to blue,
). System size given by
agents; averaged over
realizations.
, being
a constant; averaged over
realizations.
, to blue,
). System size
; average over
realizations.
and time steps (A)
, (B)
and (C)
. Panels (D–F):
and time steps (D)
, (E)
and (F)
. Panels (G–I):
and time steps (G)
, (H)
and (I)
. Black color represents an agent using action
, while white color represents action
. The system size is
.
, to blue
). System size
, average over
realizations.
that a node using action
has a fraction
of neighbor nodes with action
, computed on a two-dimensional lattice for
,
,
,
and a completely connected network (from the broadest to the narrowest probability density distribution). [Inset:
(black, continuous) and
(red, dotted) for
.] Time evolution of the probability densities
(black) and
(red) in a two-dimensional lattice with
for (B)
, (C) 5 and (D) 10. For all panels, the dashed line indicates the threshold
; parameter values: system size is
,
, and
.Similar articles
-
Numerical analysis of a reinforcement learning model with the dynamic aspiration level in the iterated Prisoner's dilemma.J Theor Biol. 2011 Jun 7;278(1):55-62. doi: 10.1016/j.jtbi.2011.03.005. Epub 2011 Mar 29. J Theor Biol. 2011. PMID: 21397610
-
Dynamics of learning near singularities in radial basis function networks.Neural Netw. 2008 Sep;21(7):989-1005. doi: 10.1016/j.neunet.2008.06.017. Epub 2008 Jul 1. Neural Netw. 2008. PMID: 18693082
-
Adaptive contact networks change effective disease infectiousness and dynamics.PLoS Comput Biol. 2010 Aug 19;6(8):e1000895. doi: 10.1371/journal.pcbi.1000895. PLoS Comput Biol. 2010. PMID: 20808884 Free PMC article.
-
Noise-driven manifestation of learning in mature neural networks.Phys Rev Lett. 2002 Oct 28;89(18):188102. doi: 10.1103/PhysRevLett.89.188102. Epub 2002 Oct 14. Phys Rev Lett. 2002. PMID: 12398640
-
The application of computational models to social neuroscience: promises and pitfalls.Soc Neurosci. 2018 Dec;13(6):637-647. doi: 10.1080/17470919.2018.1518834. Epub 2018 Sep 12. Soc Neurosci. 2018. PMID: 30173633 Free PMC article. Review.
Cited by
-
The coevolution of contagion and behavior with increasing and decreasing awareness.PLoS One. 2019 Dec 3;14(12):e0225447. doi: 10.1371/journal.pone.0225447. eCollection 2019. PLoS One. 2019. PMID: 31794564 Free PMC article.
-
Competing contagion processes: Complex contagion triggered by simple contagion.Sci Rep. 2018 Jul 10;8(1):10422. doi: 10.1038/s41598-018-28615-3. Sci Rep. 2018. PMID: 29991815 Free PMC article.
-
Learning and coordinating in a multilayer network.Sci Rep. 2015 Jan 14;5:7776. doi: 10.1038/srep07776. Sci Rep. 2015. PMID: 25585934 Free PMC article.
-
Empirical Models of Social Learning in a Large, Evolving Network.PLoS One. 2016 Oct 4;11(10):e0160307. doi: 10.1371/journal.pone.0160307. eCollection 2016. PLoS One. 2016. PMID: 27701430 Free PMC article.
-
Social learning mechanisms shape transmission pathways through replicate local social networks of wild birds.Elife. 2023 May 2;12:e85703. doi: 10.7554/eLife.85703. Elife. 2023. PMID: 37128701 Free PMC article.
References
-
- Fudenberg D, Levine D K. The Theory of Learning in Games, Cambridge: MIT Press. 1998.
-
- Holley R, Liggett T. Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model, Ann Probab. 1975;3:643–663.
-
- Liggett TM. Interacting Particle Systems, New York: Springer. 1985.
-
- Castellano C, Fortunato S, Loreto V. Statistical physics of social dynamics, Rev Mod Phys. 2009;81:591–646.
-
- San Miguel M, Eguíluz VM, Toral R, Klemm K. Binary and Multivariate Stochastic models of consensus formation, Comput Sci Eng. 2005;7:67–73.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
