Noisy rumor spreading and plurality consensus
From MaRDI portal
Publication:2318110
DOI10.1007/s00446-018-0335-5zbMath1452.68023OpenAlexW2807069665MaRDI QIDQ2318110
Emanuele Natale, Pierre Fraigniaud
Publication date: 13 August 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-018-0335-5
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14) Distributed algorithms (68W15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (3)
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions ⋮ Phase transition of the \(k\)-majority dynamics in biased communication models ⋮ Phase transition of the 3-majority dynamics with uniform communication noise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- Global majority consensus by local majority polling on graphs of a given degree sequence
- The computational power of population protocols
- Simple dynamics for plurality consensus
- Beeping a maximal independent set
- Convergence Speed of Binary Interval Consensus
- Breathe before speaking
- A Biological Solution to a Fundamental Distributed Computing Problem
- Network Information Theory
- A Remark on Stirling's Formula
- On Spreading a Rumor
- Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
- Efficient plurality consensus, or: The benefits of cleaning up from time to time
- Plurality consensus in arbitrary graphs : lessons learned from load balancing.
- The Power of Two Choices in Distributed Voting
- A Polylogarithmic Gossip Algorithm for Plurality Consensus
- Plurality Consensus in the Gossip Model
- Brief Announcement
- Probability and Computing
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: Noisy rumor spreading and plurality consensus