Plurality Consensus in the Gossip Model

DOI10.1137/1.9781611973730.27zbMath1371.68026arXiv1407.2565OpenAlexW2949361955MaRDI QIDQ5362981

Francesco Pasquale, Luca Becchetti, Riccardo Silvestri, Emanuele Natale, Andrea E. F. Clementi

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2565

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network protocols (68M12)

Related Items (9)

Simple dynamics for plurality consensus ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Unnamed Item ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Brief Announcement: Discrete Incremental Voting ⋮ Self-stabilizing repeated balls-into-bins ⋮ 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 ⋮ Noisy rumor spreading and plurality consensus

This page was built for publication: Plurality Consensus in the Gossip Model