A polylogarithmic gossip algorithm for plurality consensus
From MaRDI portal
(Redirected from Publication:5361925)
Recommendations
Cited in
(19)- Phase transition of the 2-choices dynamics on core-periphery networks
- On the necessary memory to compute the plurality in multi-agent systems
- Noisy rumor spreading and plurality consensus
- Almost-optimal gossip-based aggregate computation
- Broadcast Gossip Algorithms for Consensus
- Efficient plurality consensus, or: the benefits of cleaning up from time to time
- Plurality consensus in arbitrary graphs: lessons learned from load balancing
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Plurality consensus in the gossip model
- Brief announcement: Rapid asynchronous plurality consensus
- The Maximum Label Propagation Algorithm on Sparse Random Graphs
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Distributed Averaging in Opinion Dynamics
- Asynchronous opinion dynamics in social networks
- Phase transition of the 3-majority opinion dynamics with noisy interactions
- Asynchronous majority dynamics in preferential attachment trees
- Asynchronous majority dynamics on binomial random graphs
- Game dynamics and equilibrium computation in the population protocol model
- Restorable shortest path tiebreaking for edge-faulty graphs
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)
