The Power of Two Choices in Distributed Voting

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires Ω(n) expected steps to complete, even if initially there are only two distinct opinions.

[1]  Alan M. Frieze,et al.  Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity , 2002, Combinatorics, Probability and Computing.

[2]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[3]  P. Donnelly,et al.  Finite particle systems and infection models , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Roberto Imbuzeiro Oliveira,et al.  On the coalescence time of reversible random walks , 2010, 1009.0664.

[5]  N. Wormald,et al.  Models of the , 2010 .

[6]  R. Ramaswami,et al.  Book Review: Design and Analysis of Fault-Tolerant Digital Systems , 1990 .

[7]  Béla Bollobás,et al.  The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[8]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[9]  Masafumi Yamashita,et al.  Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs , 1999, COCOON.

[10]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[11]  Ayalvadi Ganesh,et al.  Probabilistic consensus via polling and majority rules , 2013, Queueing Syst. Theory Appl..

[12]  Alan M. Frieze,et al.  Multiple Random Walks in Random Regular Graphs , 2009, SIAM J. Discret. Math..

[13]  N. Wormald.  Models of random regular graphs , 2010 .

[14]  Luca Trevisan,et al.  Simple Dynamics for Majority Consensus , 2013, SPAA 2014.

[15]  David Peleg,et al.  Distributed Probabilistic Polling and Applications to Proportionate Agreement , 1999, ICALP.

[16]  Moez Draief,et al.  Consensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs , 2012, 1209.5025.

[17]  Christian Scheideler,et al.  Stabilizing consensus with the power of two choices , 2011, SPAA '11.

[18]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

[19]  Colin Cooper,et al.  Coalescing random walks and voting on graphs , 2012, PODC '12.

[20]  Elchanan Mossel,et al.  Majority dynamics and aggregation of information in social networks , 2012, Autonomous Agents and Multi-Agent Systems.

[21]  Barry W. Johnson.  Design & analysis of fault tolerant digital systems , 1988 .

[22]  Konstantinos Panagiotou,et al.  Rumor spreading on random regular graphs and expanders , 2013, Random Struct. Algorithms.

[23]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[24]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[25]  Sudebkumar Prasant Pal,et al.  Fair Leader Election by Randomized Voting , 2004, ICDCIT.

[26]  Colin Cooper,et al.  Coalescing Random Walks and Voting on Connected Graphs , 2012, SIAM J. Discret. Math..

[27]  Alan M. Frieze,et al.  On the independence and chromatic numbers of random regular graphs , 1992, J. Comb. Theory, Ser. B.

[28]  Konstantinos Panagiotou,et al.  Rumor spreading on random regular graphs and expanders , 2010, Random Struct. Algorithms.

[29]  L. Trevisan,et al.  Simple Dynamics for Majority Consensus , 2013 .