Fast plurality consensus in regular expanders
From MaRDI portal
Publication:6487484
Recommendations
- Fast consensus for voting on general expander graphs
- Fast and exact majority in population protocols
- Fast deterministic consensus in a noisy environment
- Fast and simple distributed consensus
- Fast agreement in networks with Byzantine nodes
- Brief announcement: Rapid asynchronous plurality consensus
- Fast, robust, quantizable approximate consensus
- Faster randomized consensus with an oblivious adversary
- Faster randomized consensus with an oblivious adversary
- Fast deterministic consensus in a noisy environment
Cited in
(17)- On asymptotic fairness in voting with greedy sampling
- Threshold behaviour of discordant voting on the complete graph
- Asynchronous opinion dynamics in social networks
- Consensus and voting on large graphs: an application of graph limit theory
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
- Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions
- Fast consensus for voting on general expander graphs
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Brief Announcement: Discrete Incremental Voting
- Distributed Averaging in Opinion Dynamics
- Quasi-majority functional voting on expander graphs
- Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
- Phase transition of the \(k\)-majority dynamics in biased communication models
- Ignore or comply? On breaking symmetry in consensus
- Discordant voting processes on finite graphs
- Phase transition of the 2-choices dynamics on core-periphery networks
- Voting protocols on the star graph
This page was built for publication: Fast plurality consensus in regular expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487484)
