An adaptive bounded-confidence model of opinion dynamics on networks
- Creators
-
Kan, Unchitta
-
Feng, Michelle
-
Porter, Mason A.
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 article, 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 neighbouring nodes and (2) break connections with neighbours 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 roles 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.
Additional Information
© The Author(s) 2023. Published by Oxford University Press. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. We thank Heather Zinn Brooks and the other participants of UCLA's Networks Journal Club for helpful comments. We also thank Mark Neidengard for useful discussions and an anonymous referee for helpful comments. We acknowledge funding from the National Science Foundation (grant number 1922952) through the Algorithms for Threat Detection (ATD) program.Attached Files
Published - pone.0172982.pdf
Files
Name | Size | Download all |
---|---|---|
md5:7edbb88f3a2f63a44aaf07dcf0c03e03
|
3.3 MB | Preview Download |
Additional details
- Eprint ID
- 119544
- Resolver ID
- CaltechAUTHORS:20230227-88449200.22
- NSF
- DMS-1922952
- Created
-
2023-04-28Created from EPrint's datestamp field
- Updated
-
2023-04-28Created from EPrint's last_modified field