Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2011;6(5):e20207.
doi: 10.1371/journal.pone.0020207. Epub 2011 May 27.

Threshold learning dynamics in social networks

Affiliations

Threshold learning dynamics in social networks

Juan Carlos González-Avella et al. PLoS One. 2011.

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.

PubMed Disclaimer

Conflict of interest statement

Competing Interests: The authors have declared that no competing interests exist.

Figures

Figure 1
Figure 1. Phase diagram of the threshold model on a fully connected network.
The colors represent the fraction of agents choosing action formula image (from red, formula image to blue, formula image). System size given by formula image agents; averaged over formula image realizations.
Figure 2
Figure 2. Typical realizations of the time evolution of the fraction of agents choosing action 1, , in a fully connected network of system size with , and (A) ; (B) ; (C) .
Figure 3
Figure 3. The average survival time in fully connected networks for different system sizes for and .
The continuous line corresponds to an exponential fit of the form formula image, being formula image a constant; averaged over formula image realizations.
Figure 4
Figure 4. Phase diagram of the threshold model on a two-dimensional lattice with ().
The colors represent the fraction of agents choosing action 1 (from red, formula image, to blue, formula image). System size formula image; average over formula image realizations.
Figure 5
Figure 5. Time evolution of the threshold model on a two-dimensional lattice with for different values of and .
Panels (AC): formula image and time steps (A) formula image, (B) formula image and (C) formula image. Panels (DF): formula image and time steps (D) formula image, (E) formula image and (F) formula image. Panels (GI): formula image and time steps (G) formula image, (H) formula image and (I) formula image. Black color represents an agent using action formula image, while white color represents action formula image. The system size is formula image.
Figure 6
Figure 6. Phase diagram of the threshold model in a (A) ER network and in a (B) scale-free network with average degree .
The colors represent the fraction of agents choosing action 1 (from red, formula image, to blue formula image). System size formula image, average over formula image realizations.
Figure 7
Figure 7. Influence of local connectivity in social learning (A).
The initial probability density formula image that a node using action formula image has a fraction formula image of neighbor nodes with action formula image, computed on a two-dimensional lattice for formula image, formula image, formula image, formula image and a completely connected network (from the broadest to the narrowest probability density distribution). [Inset: formula image (black, continuous) and formula image (red, dotted) for formula image.] Time evolution of the probability densities formula image (black) and formula image (red) in a two-dimensional lattice with formula image for (B) formula image, (C) 5 and (D) 10. For all panels, the dashed line indicates the threshold formula image; parameter values: system size is formula image, formula image, and formula image.

Similar articles

Cited by

References

    1. Fudenberg D, Levine D K. The Theory of Learning in Games, Cambridge: MIT Press. 1998.
    1. Holley R, Liggett T. Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model, Ann Probab. 1975;3:643–663.
    1. Liggett TM. Interacting Particle Systems, New York: Springer. 1985.
    1. Castellano C, Fortunato S, Loreto V. Statistical physics of social dynamics, Rev Mod Phys. 2009;81:591–646.
    1. 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