Phase transition of the 3-majority opinion dynamics with noisy interactions

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Francesco d'Amore, Isabella Ziccardi
{"title":"Phase transition of the 3-majority opinion dynamics with noisy interactions","authors":"Francesco d'Amore,&nbsp;Isabella Ziccardi","doi":"10.1016/j.tcs.2024.115030","DOIUrl":null,"url":null,"abstract":"<div><div>Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. Indeed, many biologically inspired systems that try to achieve agreements on some opinion must implement <em>resilient</em> dynamics, i.e. that are not strongly affected by noisy communications. In this work, we study the <span>3-Majority</span> dynamics, an opinion dynamics that has been shown to be an efficient protocol for the majority consensus problem, in which we introduce a simple feature of uniform communication noise, following D'Amore et al. (2022). We prove that, in the fully connected communication network of <em>n</em> agents and in the binary opinion case, the process induced by the <span>3-Majority</span> dynamics exhibits a phase transition. For a noise probability <span><math><mi>p</mi><mo>&lt;</mo><mn>1</mn><mo>/</mo><mn>3</mn></math></span>, the dynamics reach in logarithmic time an almost-consensus metastable phase which lasts for a polynomial number of rounds with high probability. We characterize this phase by showing that there exists an attractive equilibrium value <span><math><msub><mrow><mi>s</mi></mrow><mrow><mtext>eq</mtext></mrow></msub><mo>∈</mo><mo>[</mo><mi>n</mi><mo>]</mo></math></span> for the bias of the system, i.e. the difference between the majority community size and the minority one. Moreover, we show that the agreement opinion is the initial majority one if the bias towards it is of magnitude <span><math><mi>Ω</mi><mo>(</mo><msqrt><mrow><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi></mrow></msqrt><mo>)</mo></math></span> in the initial configuration. If, instead, <span><math><mi>p</mi><mo>&gt;</mo><mn>1</mn><mo>/</mo><mn>3</mn></math></span>, we show that no form of consensus is possible, and any information regarding the initial majority opinion is lost in logarithmic time with high probability. Despite more communications per-round being allowed, the <span>3-Majority</span> dynamics surprisingly turns out to be less resilient to noise than the <span>Undecided-State</span> dynamics, whose noise threshold value is <span><math><mi>p</mi><mo>=</mo><mn>1</mn><mo>/</mo><mn>2</mn></math></span>.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1028 ","pages":"Article 115030"},"PeriodicalIF":0.9000,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524006479","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. Indeed, many biologically inspired systems that try to achieve agreements on some opinion must implement resilient dynamics, i.e. that are not strongly affected by noisy communications. In this work, we study the 3-Majority dynamics, an opinion dynamics that has been shown to be an efficient protocol for the majority consensus problem, in which we introduce a simple feature of uniform communication noise, following D'Amore et al. (2022). We prove that, in the fully connected communication network of n agents and in the binary opinion case, the process induced by the 3-Majority dynamics exhibits a phase transition. For a noise probability p<1/3, the dynamics reach in logarithmic time an almost-consensus metastable phase which lasts for a polynomial number of rounds with high probability. We characterize this phase by showing that there exists an attractive equilibrium value seq[n] for the bias of the system, i.e. the difference between the majority community size and the minority one. Moreover, we show that the agreement opinion is the initial majority one if the bias towards it is of magnitude Ω(nlogn) in the initial configuration. If, instead, p>1/3, we show that no form of consensus is possible, and any information regarding the initial majority opinion is lost in logarithmic time with high probability. Despite more communications per-round being allowed, the 3-Majority dynamics surprisingly turns out to be less resilient to noise than the Undecided-State dynamics, whose noise threshold value is p=1/2.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
×
引用
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学术官方微信