Fast plurality consensus in regular expanders
From MaRDI portal
Publication:6487484
DOI10.4230/LIPICS.DISC.2017.13zbMATH Open1515.68063MaRDI QIDQ6487484FDOQ6487484
Takeharu Shiraga, Tomasz Radzik, Nicolás Rivera, Colin Cooper
Publication date: 3 February 2023
Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Voting theory (91B12) Distributed systems (68M14)
Cited In (9)
- Asynchronous opinion dynamics in social networks
- 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 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 transition of the \(k\)-majority dynamics in biased communication models
- Phase transition of the 2-choices dynamics on core-periphery networks
Recommendations
- Fast and exact majority in population protocols 👍 👎
- Fast deterministic consensus in a noisy environment 👍 👎
- Fast deterministic consensus in a noisy environment 👍 👎
- Fast agreement in networks with Byzantine nodes 👍 👎
- Fast consensus for voting on general expander graphs 👍 👎
- Fast and simple distributed consensus 👍 👎
- Faster randomized consensus with an oblivious adversary 👍 👎
- Brief Announcement 👍 👎
- Fast, Robust, Quantizable Approximate Consensus * 👍 👎
- Faster randomized consensus with an oblivious adversary 👍 👎
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)