Emergence of polarization in a sigmoidal bounded-confidence model of opinion dynamics
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:XUTYOI7Zrecord.jsonopen to challenge →
read the original abstract
We study a nonlinear bounded-confidence model (BCM) of continuous-time opinion dynamics on networks with both persuadable individuals and zealots. The model is parameterized by a scalar $\gamma$, which controls the steepness of a smooth influence function. This influence function encodes the relative weights that nodes place on the opinions of other nodes. When $\gamma = 0$, this influence function recovers Taylor's averaging model; when $\gamma \rightarrow \infty$, the influence function converges to that of a modified Hegselmann--Krause (HK) BCM. Unlike the classical HK model, however, our sigmoidal bounded-confidence model (SBCM) is smooth for any finite $\gamma$. We show that the set of steady states of our SBCM is qualitatively similar to that of the Taylor model when $\gamma$ is small and that the set of steady states approaches a subset of the set of steady states of a modified HK model as $\gamma \rightarrow \infty$. For several special graph topologies, we give analytical descriptions of important features of the space of steady states. A notable result is a closed-form relationship between the stability of a polarized state and the graph topology in a simple model of echo chambers in social networks. Because the influence function of our BCM is smooth, we are able to study it with linear stability analysis, which is difficult to employ with the usual discontinuous influence functions in BCMs.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Opinion dynamics: Statistical physics and beyond
A review synthesizing opinion dynamics research, categorizing models by macroscopic outcomes and microscopic mechanisms while connecting to empirical data and emerging AI tools.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.