Listen to Your Neighbors: How (Not) to Reach a Consensus

Authors:
Nabil H. Mustafa;Aleksandar Pekec
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2004

Citing 0
Cited 5

Brief announcement: on reversible and irreversible conversions

DISC'10 Proceedings of the 24th international conference on Distributed computing
Irreversible conversion of graphs

Theoretical Computer Science
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids

Discrete Applied Mathematics
Reversible iterative graph processes

Theoretical Computer Science
Immediate versus eventual conversion: comparing geodetic and hull numbers in P3-convexity

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the following rather generic communication\slash coordination\slash computation problem: In a finite network of agents, each initially having one of the two possible states, can the majority initial state be computed and agreed upon by means of local computation only? We study an iterative synchronous application of the local majority rule and describe the architecture of networks that are always capable of reaching the consensus on the majority initial state of its agents. In particular, we show that, for any truly local network of agents, there are instances in which the network is not capable of reaching such a consensus. Thus, every truly local computational approach that requires reaching a consensus is not failure-free.