An adaptive bounded-confidence model of opinion dynamics on networks

Author:

Kan Unchitta1ORCID,Feng Michelle2ORCID,Porter Mason A3ORCID

Affiliation:

1. Department of Computational and Data Sciences, George Mason University , 4400 University Drive, Fairfax, VA 22030, USA

2. Department of Computing + Mathematical Sciences, California Institute of Technology , 1200 E. California Blvd., MC 305-16, Pasadena, CA 91125-2100, USA

3. Department of Mathematics, University of California, Los Angeles, Mathematical Sciences Building , 520 Portola Plaza, Box 951555, Los Angeles, CA 90095, USA and Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA

Abstract

AbstractIndividuals 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.

Funder

National Science Foundation

Algorithms for Threat Detection

Publisher

Oxford University Press (OUP)

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization,Management Science and Operations Research,Computer Networks and Communications

Reference37 articles.

1. Birds of a feather: Homophily in social networks;McPherson,;Ann. Rev. Sociol.,2001

2. Filter bubbles, echo chambers, and online news consumption;Flaxman,;Public. Opin. Q.,2016

3. Origins of homophily in an evolving social network;Kossinets,;Am. J. Sociol.,2009

4. Multiscale voter model on real networks;Ortiz,;Chaos Solit. Fractals,2022

5. Social influence and unfollowing accelerate the emergence of echo chambers;Sasahara,;J. Comp. Social Sci.,2021

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3