A Polylogarithmic Gossip Algorithm for Plurality Consensus

DOI10.1145/2933057.2933097zbMATH Open1373.68099OpenAlexW2483628663MaRDI QIDQ5361925FDOQ5361925

Mohsen Ghaffari, M. 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

consensusnetwork dynamicsgossip algorithms

Mathematics Subject Classification ID

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

Cited In (10)

• Broadcast Gossip Algorithms for Consensus
• Noisy rumor spreading and plurality consensus
• Asynchronous opinion dynamics in social networks
• Almost-optimal gossip-based aggregate computation
• 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 3-majority opinion dynamics with noisy interactions
• A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
• Phase transition of the 2-choices dynamics on core-periphery networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361925)