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 条
[11]  
Berenbrink P., 2016, LIPIcs, V55
[12]  
Boczkowski L, 2017, PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P2540
[13]   The complement system in regulation of adaptive immunity [J].
Carroll, MC .
NATURE IMMUNOLOGY, 2004, 5 (10) :981-986
[14]   Majority Rules with Random Tie-Breaking in Boolean Gene Regulatory Networks [J].
Chaouiya, Claudine ;
Ourrad, Ouerdia ;
Lima, Ricardo .
PLOS ONE, 2013, 8 (07)
[15]  
Clementi A.E.F., 2018, P INT S MATH FDN COM, V117, DOI DOI 10.4230/LIPICS.MFCS.2018.28
[16]   Approximate majority analyses using tri-molecular chemical reaction networks [J].
Condon, Anne ;
Hajiaghayi, Monir ;
Kirkpatrick, David ;
Manuch, Jan .
NATURAL COMPUTING, 2020, 19 (01) :249-270
[17]   Phase Transitions of the k-Majority Dynamics in a Biased Communication Model [J].
Cruciani, Emilio ;
Mimun, Hlafo Alfie ;
Quattropani, Matteo ;
Rizzo, Sara .
PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING (ICDCN '21), 2021, :146-155
[18]   Phase transition of a nonlinear opinion dynamics with noisy interactions [J].
d'Amore, Francesco ;
Clementi, Andrea ;
Natale, Emanuele .
SWARM INTELLIGENCE, 2022, 16 (04) :261-304
[19]   Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise [J].
d'Amore, Francesco ;
Ziccardi, Isabella .
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2022, 2022, 13298 :98-115
[20]  
Dietzfelbinger M, 2010, LECT NOTES COMPUT SC, V6198, P213, DOI 10.1007/978-3-642-14165-2_19