Document Open Access Logo

Stabilization Time in Weighted Minority Processes

Authors Pál András Papp, Roger Wattenhofer

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2019.54.pdf
  • Filesize: 492 kB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph coloring
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Distributed computing models
  • Theory of computation → Self-organization
Keywords
  • Minority process
  • Benevolent model

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

A minority process in a weighted graph is a dynamically changing coloring. Each node repeatedly changes its color in order to minimize the sum of weighted conflicts with its neighbors. We study the number of steps until such a process stabilizes. Our main contribution is an exponential lower bound on stabilization time. We first present a construction showing this bound in the adversarial sequential model, and then we show how to extend the construction to establish the same bound in the benevolent sequential model, as well as in any reasonable concurrent model. Furthermore, we show that the stabilization time of our construction remains exponential even for very strict switching conditions, namely, if a node only changes color when almost all (i.e., any specific fraction) of its neighbors have the same color. Our lower bound works in a wide range of settings, both for node-weighted and edge-weighted graphs, or if we restrict minority processes to the class of sparse graphs.

Cite As Get BibTex

Pál András Papp and Roger Wattenhofer. Stabilization Time in Weighted Minority Processes. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 54:1-54:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.STACS.2019.54

Author Details

Pál András Papp
  • ETH Zürich, Switzerland
Roger Wattenhofer
  • ETH Zürich, Switzerland

References

  1. Ron Aharoni, Eric C Milner, and Karel Prikry. Unfriendly partitions of a graph. Journal of Combinatorial Theory, Series B, 50(1):1-10, 1990. Google Scholar
  2. Cristina Bazgan, Zsolt Tuza, and Daniel Vanderpooten. On the existence and determination of satisfactory partitions in a graph. In International Symposium on Algorithms and Computation, pages 444-453. Springer, 2003. Google Scholar
  3. Cristina Bazgan, Zsolt Tuza, and Daniel Vanderpooten. Complexity and approximation of satisfactory partition problems. In International Computing and Combinatorics Conference, pages 829-838. Springer, 2005. Google Scholar
  4. Cristina Bazgan, Zsolt Tuza, and Daniel Vanderpooten. The satisfactory partition problem. Discrete applied mathematics, 154(8):1236-1245, 2006. Google Scholar
  5. Cristina Bazgan, Zsolt Tuza, and Daniel Vanderpooten. Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research, 206(2):271-280, 2010. Google Scholar
  6. Olivier Bodini, Thomas Fernique, and Damien Regnault. Quasicrystallization by stochastic flips. HAL online archives, 2009. Google Scholar
  7. Olivier Bodini, Thomas Fernique, and Damien Regnault. Stochastic flips on two-letter words. In 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 48-55. SIAM, 2010. Google Scholar
  8. Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, and Philipp Sprüssel. Every rayless graph has an unfriendly partition. Combinatorica, 30(5):521-532, 2010. Google Scholar
  9. Zhigang Cao and Xiaoguang Yang. The fashion game: Network extension of matching pennies. Theoretical Computer Science, 540:169-181, 2014. Google Scholar
  10. Jacques Demongeot, Julio Aracena, Florence Thuderoz, Thierry-Pascal Baum, and Olivier Cohen. Genetic regulation networks: circuits, regulons and attractors. Comptes Rendus Biologies, 326(2):171-188, 2003. Google Scholar
  11. Silvio Frischknecht, Barbara Keller, and Roger Wattenhofer. Convergence in (social) influence networks. In International Symposium on Distributed Computing, pages 433-446. Springer, 2013. Google Scholar
  12. Michael U Gerber and Daniel Kobler. Algorithmic approach to the satisfactory graph partitioning problem. European Journal of Operational Research, 125(2):283-291, 2000. Google Scholar
  13. Michael U Gerber and Daniel Kobler. Classes of graphs that can be partitioned to satisfy all their vertices. Australasian Journal of Combinatorics, 29:201-214, 2004. Google Scholar
  14. Sandra M Hedetniemi, Stephen T Hedetniemi, KE Kennedy, and Alice A Mcrae. Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets. Parallel Processing Letters, 23(01):1350001, 2013. Google Scholar
  15. Barbara Keller, David Peleg, and Roger Wattenhofer. How Even Tiny Influence Can Have a Big Impact! In International Conference on Fun with Algorithms, pages 252-263. Springer, 2014. Google Scholar
  16. Jeremy Kun, Brian Powers, and Lev Reyzin. Anti-coordination games and stable graph colorings. In International Symposium on Algorithmic Game Theory, pages 122-133. Springer, 2013. Google Scholar
  17. Damien Regnault, Nicolas Schabanel, and Éric Thierry. Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority. In Luděk Kučera and Antonín Kučera, editors, Mathematical Foundations of Computer Science 2007, pages 320-332. Springer Berlin Heidelberg, 2007. Google Scholar
  18. Damien Regnault, Nicolas Schabanel, and Éric Thierry. On the analysis of “simple” 2d stochastic cellular automata. In International Conference on Language and Automata Theory and Applications, pages 452-463. Springer, 2008. Google Scholar
  19. Jean-Baptiste Rouquier, Damien Regnault, and Éric Thierry. Stochastic minority on graphs. Theoretical Computer Science, 412(30):3947-3963, 2011. Google Scholar
  20. Khurram H Shafique and Ronald D Dutton. On satisfactory partitioning of graphs. Congressus Numerantium, pages 183-194, 2002. Google Scholar
  21. Saharon Shelah and Eric C Milner. Graphs with no unfriendly partitions. A tribute to Paul Erdös, pages 373-384, 1990. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact