Steering opinion dynamics via containment control.

Q1 Mathematics
Computational Social Networks Pub Date : 2017-01-01 Epub Date: 2017-11-27 DOI:10.1186/s40649-017-0048-0
Pietro DeLellis, Anna DiMeglio, Franco Garofalo, Francesco Lo Iudice
{"title":"Steering opinion dynamics via containment control.","authors":"Pietro DeLellis,&nbsp;Anna DiMeglio,&nbsp;Franco Garofalo,&nbsp;Francesco Lo Iudice","doi":"10.1186/s40649-017-0048-0","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper, we model the problem of influencing the opinions of groups of individuals as a containment control problem, as in many practical scenarios, the control goal is not full consensus among all the individual opinions, but rather their containment in a certain range, determined by a set of leaders. As in classical bounded confidence models, we consider individuals affected by the confirmation bias, thus tending to influence and to be influenced only if their opinions are sufficiently close. However, here we assume that the confidence level, modeled as a proximity threshold, is not constant and uniform across the individuals, as it depends on their opinions. Specifically, in an extremist society, the most radical agents (i.e., those with the most extreme opinions) have a higher appeal and are capable of influencing nodes with very diverse opinions. The opposite happens in a moderate society, where the more connected (i.e., influential) nodes are those with an average opinion. In three artificial societies, characterized by different levels of extremism, we test through extensive simulations the effectiveness of three alternative containment strategies, where leaders have to select the set of followers they try to directly influence. We found that, when the network size is small, a stochastic time-varying pinning strategy that does not rely on information on the network topology proves to be more effective than static strategies where this information is leveraged, while the opposite happens for large networks where the relevance of the topological information is prevalent.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"12"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0048-0","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s40649-017-0048-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2017/11/27 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we model the problem of influencing the opinions of groups of individuals as a containment control problem, as in many practical scenarios, the control goal is not full consensus among all the individual opinions, but rather their containment in a certain range, determined by a set of leaders. As in classical bounded confidence models, we consider individuals affected by the confirmation bias, thus tending to influence and to be influenced only if their opinions are sufficiently close. However, here we assume that the confidence level, modeled as a proximity threshold, is not constant and uniform across the individuals, as it depends on their opinions. Specifically, in an extremist society, the most radical agents (i.e., those with the most extreme opinions) have a higher appeal and are capable of influencing nodes with very diverse opinions. The opposite happens in a moderate society, where the more connected (i.e., influential) nodes are those with an average opinion. In three artificial societies, characterized by different levels of extremism, we test through extensive simulations the effectiveness of three alternative containment strategies, where leaders have to select the set of followers they try to directly influence. We found that, when the network size is small, a stochastic time-varying pinning strategy that does not rely on information on the network topology proves to be more effective than static strategies where this information is leveraged, while the opposite happens for large networks where the relevance of the topological information is prevalent.

Abstract Image

Abstract Image

Abstract Image

通过遏制控制引导舆论动态。
在本文中,我们将影响个体群体意见的问题建模为遏制控制问题,因为在许多实际场景中,控制目标不是所有个体意见的完全一致,而是由一组领导者确定的将其遏制在一定范围内。在经典的有界置信模型中,我们考虑受确认偏差影响的个体,因此只有当他们的意见足够接近时,才倾向于影响和被影响。然而,在这里,我们假设置信水平(建模为接近阈值)在个体之间不是恒定和统一的,因为它取决于他们的意见。具体来说,在极端主义社会中,最激进的行动者(即观点最极端的人)具有更高的号召力,能够影响观点非常多样化的节点。在一个温和的社会中,情况正好相反,在那里,更有联系(即有影响力)的节点是那些持平均意见的节点。在三个极端主义程度不同的人造社会中,我们通过广泛的模拟测试了三种替代遏制策略的有效性,其中领导者必须选择他们试图直接影响的追随者。我们发现,当网络规模较小时,不依赖于网络拓扑信息的随机时变固定策略被证明比利用该信息的静态策略更有效,而对于拓扑信息相关性普遍存在的大型网络则相反。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computational Social Networks
Computational Social Networks Mathematics-Modeling and Simulation
自引率
0.00%
发文量
0
审稿时长
13 weeks
期刊介绍: Computational Social Networks showcases refereed papers dealing with all mathematical, computational and applied aspects of social computing. The objective of this journal is to advance and promote the theoretical foundation, mathematical aspects, and applications of social computing. Submissions are welcome which focus on common principles, algorithms and tools that govern network structures/topologies, network functionalities, security and privacy, network behaviors, information diffusions and influence, social recommendation systems which are applicable to all types of social networks and social media. Topics include (but are not limited to) the following: -Social network design and architecture -Mathematical modeling and analysis -Real-world complex networks -Information retrieval in social contexts, political analysts -Network structure analysis -Network dynamics optimization -Complex network robustness and vulnerability -Information diffusion models and analysis -Security and privacy -Searching in complex networks -Efficient algorithms -Network behaviors -Trust and reputation -Social Influence -Social Recommendation -Social media analysis -Big data analysis on online social networks This journal publishes rigorously refereed papers dealing with all mathematical, computational and applied aspects of social computing. The journal also includes reviews of appropriate books as special issues on hot topics.
×
引用
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学术官方微信