1. An adaptive bounded-confidence model of opinion dynamics on networks
- Author
-
Unchitta Kan, Michelle Feng, and Mason A Porter
- Subjects
Social and Information Networks (cs.SI) ,FOS: Computer and information sciences ,Physics - Physics and Society ,Control and Optimization ,Computer Networks and Communications ,Applied Mathematics ,SocArXiv|Social and Behavioral Sciences|Sociology|Collective Behavior and Social Movements ,FOS: Physical sciences ,bepress|Social and Behavioral Sciences|Sociology|Politics and Social Change ,Computer Science - Social and Information Networks ,Physics and Society (physics.soc-ph) ,Dynamical Systems (math.DS) ,Management Science and Operations Research ,Nonlinear Sciences - Adaptation and Self-Organizing Systems ,bepress|Social and Behavioral Sciences|Sociology ,SocArXiv|Social and Behavioral Sciences|Sociology ,Computational Mathematics ,bepress|Social and Behavioral Sciences ,FOS: Mathematics ,SocArXiv|Social and Behavioral Sciences ,SocArXiv|Social and Behavioral Sciences|Sociology|Social Psychology and Interaction ,Mathematics - Dynamical Systems ,91D30, 05C82, 91C99 ,Adaptation and Self-Organizing Systems (nlin.AO) ,bepress|Social and Behavioral Sciences|Sociology|Social Psychology and Interaction - Abstract
Individuals who interact with each other in social networks often exchange ideas and influence each other's opinions. A popular approach to study the spread of opinions on networks is by examining bounded-confidence models (BCMs), in which the nodes of a network have continuous-valued states that encode their opinions and are receptive to other nodes' opinions when they lie within some confidence bound of their own opinion. In this paper, we extend the Deffuant--Weisbuch (DW) model, which is a well-known BCM, by examining the spread of opinions that coevolve with network structure. We propose an adaptive variant of the DW model in which the nodes of a network can (1) alter their opinions when they interact with neighboring nodes and (2) break connections with neighbors based on an opinion tolerance threshold and then form new connections following the principle of homophily. This opinion tolerance threshold determines whether or not the opinions of adjacent nodes are sufficiently different to be viewed as `discordant'. Using numerical simulations, we find that our adaptive DW model requires a larger confidence bound than a baseline DW model for the nodes of a network to achieve a consensus opinion. In one region of parameter space, we observe `pseudo-consensus' steady states, in which there exist multiple subclusters of an opinion cluster with opinions that differ from each other by a small amount. In our simulations, we also examine the importance of early-time dynamics and nodes with initially moderate opinions for achieving consensus. Additionally, we explore the effects of coevolution on the convergence time of our BCM., accepted by Journal of Complex Networks; further cosmetic polishing from the last version
- Published
- 2022