Stabilizing Consensus with Many Opinions
From MaRDI portal
Publication:4575624
DOI10.1137/1.9781611974331.ch46zbMath1410.68045arXiv1508.06782OpenAlexW2952997697MaRDI QIDQ4575624
Luca Becchetti, Francesco Pasquale, Luca Trevisan, Andrea E. F. Clementi, Emanuele Natale
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06782
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (12)
Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Phase transition of the \(k\)-majority dynamics in biased communication models ⋮ Suppression of resilient targets via coordinated swarms ⋮ Approximate majority analyses using tri-molecular chemical reaction networks ⋮ Unnamed Item ⋮ Brief Announcement: Discrete Incremental Voting ⋮ The Maximum Label Propagation Algorithm on Sparse Random Graphs ⋮ MinMax algorithms for stabilizing consensus ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Phase transition of the 3-majority dynamics with uniform communication noise
This page was built for publication: Stabilizing Consensus with Many Opinions
