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

被引:0
作者
d'Amore, Francesco [1 ]
Ziccardi, Isabella [1 ]
机构
[1] Bocconi Univ, BIDSA, Milan, Italy
关键词
Opinion dynamics; Consensus problem; Randomized algorithms; Distributed computing; CONSENSUS; INFORMATION; SYSTEM;
D O I
10.1016/j.tcs.2024.115030
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 s eq is an element of [n] for the bias of the system, i.e. the difference between the majority community size and the minority one. Moreover, we show that t he agreement opinion is the initial majority one root if the bias towards it is of magnitude Omega(root nlog n) 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.
引用
收藏
页数:18
相关论文
共 49 条
[1]   Global majority consensus by local majority polling on graphs of a given degree sequence [J].
Abdullah, Mohammed Amin ;
Draief, Moez .
DISCRETE APPLIED MATHEMATICS, 2015, 180 :1-10
[2]   Opinion Fluctuations and Disagreement in Social Networks [J].
Acemoglu, Daron ;
Como, Giacomo ;
Fagnani, Fabio ;
Ozdaglar, Asuman .
MATHEMATICS OF OPERATIONS RESEARCH, 2013, 38 (01) :1-27
[3]  
Bankhamer G, 2022, PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, P3417
[4]   Small talk: Cell-to-cell communication in bacteria [J].
Bassler, BL .
CELL, 2002, 109 (04) :421-424
[5]   A review of swarm robotics tasks [J].
Bayindir, Levent .
NEUROCOMPUTING, 2016, 172 :292-321
[6]  
Becchetti Luca, 2020, ACM SIGACT News, V51, P58, DOI 10.1145/3388392.3388403
[7]   Simple dynamics for plurality consensus [J].
Becchetti, Luca ;
Clementi, Andrea ;
Natale, Emanuele ;
Pasquale, Francesco ;
Silvestri, Riccardo ;
Trevisan, Luca .
DISTRIBUTED COMPUTING, 2017, 30 (04) :293-306
[8]  
Becchetti Luca, 2016, Proc. 27th Annu. ACMSIAM Symp. Discret. Algorithms (SODA), DOI DOI 10.1137/1.9781611974331.CH46
[9]   Direction election in flocking swarms [J].
Ben-Shahar, Ohad ;
Dolev, Shlomi ;
Dolgin, Andrey ;
Segal, Michael .
AD HOC NETWORKS, 2014, 12 :250-258
[10]  
Berenbrink P., 2017, P ACM S PRINCIPLES D