Low Memory Distributed Protocols for 2-Coloring

  • Amos Israeli
  • Mathew D. McCubbins
  • Ramamohan Paturi
  • Andrea Vattani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6366)


In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experiments that show human subjects can achieve distributed coordination in the form of 2-coloring over networks with a simple communication protocol. All our protocols use low (often constant) memory and reach a solution in feasible (polynomial rounds) and sometimes optimal time. All the protocols also have short message length and use a broadcast communication strategy. Our contributions include two simple protocols RingElect and GraphCoalescing for rings and general bipartite graphs, which can be viewed as candidates for natural human strategies. We present two other protocols RingElect and GraphElect which are optimal or nearly optimal in terms of the number of rounds (proportional to the diameter of the graph) but require somewhat more complex strategies. The question of finding simple protocols in the style of RingElect and GraphCoalescing that run in time proportional to diameter is open.


Random Walk Slave Node Leader Election Consensus Problem Proper Coloring 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: FOCS 1979, pp. 218–223 (1979)Google Scholar
  2. 2.
    Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs,
  3. 3.
    Attiya, H., Welch, J.: Distributed Computing; Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley & Sons, Chichester (2004)zbMATHGoogle Scholar
  4. 4.
    Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures & Algorithms 18(3) (May 2001)Google Scholar
  6. 6.
    Chaudhuri, K., Chung Graham, F., Jamall, M.S.: A network coloring game. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 522–530. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Cooper, C., Frieze, A., Radzik, T.: Multiple random walks in random regular graphs. SIAM Journal on Discrete Mathematics 23(4), 1738–1761 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Enemark, D., McCubbins, M., Paturi, R., Weller, N.: Good edge, bad edge: How network structure affects a group’s ability to coordinate. In: ESORICS (March 2009)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Israeli, A., Jalfon, M.: Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion. In: PODC 1990, pp. 119–131 (1990)Google Scholar
  11. 11.
    Kearns, M., Suri, S., Montfort, N.: An experimental study of the coloring problem on human subject networks. Science 313(5788), 824–827 (2006)CrossRefGoogle Scholar
  12. 12.
    Kearns, M., Judd, S., Tan, J., Wortman, J.: Behavioral experiments on biased voting in networks. National Academy of Science (January 2009)Google Scholar
  13. 13.
    Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: FOCS 2001, pp. 600–609 (2001)Google Scholar
  14. 14.
    Latané, B., L’Herrou, T.: Spatial clustering in the conformity game: Dynamic social impact in electronic groups. Journal of Personality and Social Psychology 70(6), 1218–1230 (1996)CrossRefGoogle Scholar
  15. 15.
    McCubbins, M.D., Paturi, R., Weller, N.: Connected Coordination: Network Structure and Group Coordination. American Politics Research 37, 899–920 (2009)CrossRefGoogle Scholar
  16. 16.
    Mossel, E., Schoenebeck, G.: Reaching Consensus on Social Networks. In: Innovations in Computer Science, ICS (2009)Google Scholar
  17. 17.
    Peleg, D.: Distributed Computing: A Locally-Sensitive Approach. SIAM Monographs, Philadelphia (2000)CrossRefzbMATHGoogle Scholar
  18. 18.
    Santoro, N.: Design and Analysis of Distributed Algorithms. John Wiley & Sons, Inc., Chichester (2007)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Amos Israeli
    • 1
  • Mathew D. McCubbins
    • 3
  • Ramamohan Paturi
    • 2
  • Andrea Vattani
    • 2
  1. 1.Netanya Academic CollegeIsrael
  2. 2.University of CaliforniaSan Diego
  3. 3.University of Southern CaliforniaUSA

Personalised recommendations