DeepAI AI Chat
Log In Sign Up

Simple Majority Consensus in Networks with Unreliable Communication

04/11/2021
by   Ran Tamir, et al.
0

In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems - binary majority consensus, in the presence of probabilistic message loss. Using probabilistic analysis for a large scale, fully-connected, network of 2n agents, we prove that the Simple Majority Protocol (SMP) reaches consensus in only three communication rounds with probability approaching 1 as n grows to infinity. Moreover, if the difference between the numbers of agents that hold different opinions grows at a rate of √(n), then the SMP with only two communication rounds attains consensus on the majority opinion of the network, and if this difference grows faster than √(n), then the SMP reaches consensus on the majority opinion of the network in a single round, with probability converging to 1 exponentially fast as n →∞. We also provide some converse results, showing that these requirements are not only sufficient, but also necessary.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/12/2022

Fast Convergence to Unanimity in Dense Erdős-Rényi Graphs

Majority dynamics on the binomial Erdős-Rényi graph 𝖦(n,p) with p=λ/√(n)...
12/07/2021

Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise

Communication noise is a common feature in several real-world scenarios ...
05/15/2020

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions

In several real Multi-Agent Systems (MAS), it has been observed that onl...
09/08/2022

Consensus on Dynamic Stochastic Block Models: Fast Convergence and Phase Transitions

We introduce two models of consensus following a majority rule on time-e...
07/15/2018

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise

Consensus and Broadcast are two fundamental problems in distributed comp...
03/22/2020

Distributed Computation with Continual Population Growth

Computing with synthetically modified bacteria is a vibrant and active f...
04/28/2022

Let's Agree to Agree: Targeting Consensus for Incomplete Preferences through Majority Dynamics

We study settings in which agents with incomplete preferences need to ma...