A polylogarithmic gossip algorithm for plurality consensus
From MaRDI portal
Publication:5361925
DOI10.1145/2933057.2933097zbMATH Open1373.68099OpenAlexW2483628663MaRDI QIDQ5361925FDOQ5361925
Authors: 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
Recommendations
Cited In (14)
- Broadcast Gossip Algorithms for Consensus
- Noisy rumor spreading and plurality consensus
- Plurality consensus in the gossip model
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- 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
- Brief announcement: Rapid asynchronous plurality consensus
- Plurality consensus in arbitrary graphs: lessons learned from load balancing
- Efficient plurality consensus, or: the benefits of cleaning up from time to time
- 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)
