A Polylogarithmic Gossip Algorithm for Plurality Consensus

DOI10.1145/2933057.2933097zbMath1373.68099OpenAlexW2483628663MaRDI QIDQ5361925

Mohsen Ghaffari, Merav Parter

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933097

zbMATH Keywords

network dynamicsconsensusgossip algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (6)

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Distributed Averaging in Opinion Dynamics ⋮ The Maximum Label Propagation Algorithm on Sparse Random Graphs ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States ⋮ Noisy rumor spreading and plurality consensus

This page was built for publication: A Polylogarithmic Gossip Algorithm for Plurality Consensus