An "opinion reproduction number" for infodemics in a bounded-confidence content-spreading process on networks.

IF 2.7 2区 数学 Q1 MATHEMATICS, APPLIED
Chaos Pub Date : 2025-01-01 DOI:10.1063/5.0206431
Heather Z Brooks, Mason A Porter
{"title":"An \"opinion reproduction number\" for infodemics in a bounded-confidence content-spreading process on networks.","authors":"Heather Z Brooks, Mason A Porter","doi":"10.1063/5.0206431","DOIUrl":null,"url":null,"abstract":"<p><p>We study the spreading dynamics of content on networks. To do this, we use a model in which content spreads through a bounded-confidence mechanism. In a bounded-confidence model (BCM) of opinion dynamics, the agents of a network have continuous-valued opinions, which they adjust when they interact with agents whose opinions are sufficiently close to theirs. Our content-spreading model, which one can also interpret as an independent-cascade model, introduces a twist into BCMs by using bounded confidence for the content spread itself. We define an analog of the basic reproduction number from disease dynamics that we call an opinion reproduction number. A critical value of the opinion reproduction number indicates whether or not there is an \"infodemic\" (i.e., a large content-spreading cascade) of content that reflects a particular opinion. By determining this critical value, one can determine whether or not an opinion dies off or propagates widely as a cascade in a population of agents. Using configuration-model networks, we quantify the size and shape of content dissemination by calculating a variety of summary statistics, and we illustrate how network structure and spreading-model parameters affect these statistics. We find that content spreads most widely when agents have a large expected mean degree or a large receptiveness to content. When the spreading process slightly exceeds the infodemic threshold, there can be longer dissemination trees than for larger expected mean degrees or receptiveness (which both promote content sharing and hence help push content spread past the infodemic threshold), even though the total number of content shares is smaller.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0206431","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We study the spreading dynamics of content on networks. To do this, we use a model in which content spreads through a bounded-confidence mechanism. In a bounded-confidence model (BCM) of opinion dynamics, the agents of a network have continuous-valued opinions, which they adjust when they interact with agents whose opinions are sufficiently close to theirs. Our content-spreading model, which one can also interpret as an independent-cascade model, introduces a twist into BCMs by using bounded confidence for the content spread itself. We define an analog of the basic reproduction number from disease dynamics that we call an opinion reproduction number. A critical value of the opinion reproduction number indicates whether or not there is an "infodemic" (i.e., a large content-spreading cascade) of content that reflects a particular opinion. By determining this critical value, one can determine whether or not an opinion dies off or propagates widely as a cascade in a population of agents. Using configuration-model networks, we quantify the size and shape of content dissemination by calculating a variety of summary statistics, and we illustrate how network structure and spreading-model parameters affect these statistics. We find that content spreads most widely when agents have a large expected mean degree or a large receptiveness to content. When the spreading process slightly exceeds the infodemic threshold, there can be longer dissemination trees than for larger expected mean degrees or receptiveness (which both promote content sharing and hence help push content spread past the infodemic threshold), even though the total number of content shares is smaller.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信