Papers › An Adaptive Bounded-Confidence Model of Opinion Dynamics on Networks
An Adaptive Bounded-Confidence Model of Opinion Dynamics on Networks
Unchitta Kan, Michelle Feng, Mason A. Porter
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections