Brief Announcement: On the Voting Time of the Deterministic Majority Process

Dominik Kaaser (1) , Frederik Mallmann-Trenn (2, 3) , Emanuele Natale (4)

1 Universität Salzburg
2 ENS-PSL - École normale supérieure - Paris
3 SFU.ca - Simon Fraser University = Université Simon Fraser
4 UNIROMA - Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]

We study the deterministic binary majority process which is defined as fol- lows. We are given a graph G = (V,E) where each node has one out of two opinions. The process runs in discrete rounds where in every round each node computes and adopts the majority opinion among all of its neighbors.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale. Brief Announcement: On the Voting Time of the Deterministic Majority Process. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨hal-01207836⟩