Abstract
We consider the followingsync hronous colouringg ame played on a simple connected graph with vertices coloured black or white. Duringone step of the game, each vertex is recoloured accordingto the majority of its neighbours. The variants of the model differ by the choice of a particular tie-breakingrule and possible rule for enforcingmonotonicity. Two tie-breakingrules we consider are simple majority and strong majority, the first in case of a tie recolours the vertex black and the latter does not change the colour. The monotonicity-enforcing rule allows the votingonly in white vertices, thus leavingall black vertices intact. This model is called irreversible.
These synchronous dynamic systems have been extensively studied and have many applications in molecular biology, distributed systems modelling, etc.
In this paper we give two results describing the behaviour of these systems on trees. First we count the number of fixpoints of strongma jority rule on complete binary trees to be asymptotically 4N · (2α)N where N is the number of vertices and 0.7685 ≤ α ≤ 0.7686. The second result is an algorithm for testing whether a given configuration on an arbitrary tree evolves into an all-black state under irreversible simple majority rule. The algorithm works in time O(t log t) where t is the number of black vertices and uses labels of length O(logN).
The research has been supported by grants Comenius University 102/2001/UK and VEGA 1/7155/20.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Z. Agur, A.S. Frankel, S.T. Klein: The Number of Fixed Points of the Majority Rule.Discrete Mathematics 70:295–302, 1988
J.C. Bermond, J. Bond, D. Peleg, S. Pérennes: Tight Bounds on the Size of 2-monopolies. Proc. 3rd Colloq. on Structural Information & Communication Complexity (SIROCCO), Sienna, Italy, June 1996
P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro: Irreversible Dynamos in Tori.Proc. Euro-Par, Southampton, England, 1998, 554–562
P. Flocchini, R. Královič, A. Roncato, P. Ružička, N. Santoro: On Time versus Size for Monotone Dynamic Monopolies in Regular Topologies. Proc. 7th Colloq. on Structural Information & Communication Complexity (SIROCCO), L’Aquilla, Italy, June 1999, 111–127
P. Flocchini, F. Geurts, N. Santoro: Irreversible Dynamos in Chordal Rings. Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Ascona, Switzerland, June 1999, 202–214
E. Goles-Chacc, F. Fogelman-Soulie, D. Pellegrin: Decreasing Energy Functions as a Tool for StudyingThreshold Networks.Discrete Applied Mathematics 12:261–277, 1985
E. Goles, J. Olivos: Periodic behaviour of generalized threshold functions.Discrete Mathematics 30:187–189, 1980
C. Gavoille, D. Peleg, S. Pérennes, R. Raz: Distance Labelingin Graphs.Research Report RR-1182-97, LaBRI, Univ. of Bordeaux, 1999
S. Huang: Gene Expression Profiling, Genetic Networks, and Cellular States: an Integrating Concept for Tumorigenesis and Drug Discovery. To appear in Journal of Molecular Medicine, August 2000, Springer Verlag
S. Kutten, D. Peleg: Fault-Local Distributed Mending. Proc. Principles of Distributed Computing (PODC), Ottawa, 1995, ACM, 20–27
N. Linial, D. Peleg, Y. Rabinovich, M. Saks: Sphere packing and local majorities in graphs.2nd ISTCS, June 1993, IEEE Computer Soc. Press, 141–149
F. Luccio, L. Pagli, H. Sanossian: Irreversible Dynamos in Butterflies.Proc. 6th Colloq. on Structural Information & Communication Complexity (SIROCCO), Bordeaux, 1999, Carleton University Press
G. Moran: On r-majority vote action on 0–1 sequences. Discrete Mathematics 132:145–174, 1994
G. Moran: On the period-two-property of the majority operator in infinite graphs. Transactions of the American Mathematical Society 347(5):1649–1667, 1995
D. Peleg: Informative Labeling Schemes for Graphs. Proc. Mathematical Foundations of Computer Science (MFCS 2000), 2000, LNCS 1893, Springer Verlag, 579–588 (see also Technical Report MCS00-05, The Weizmann Institute of Science, 2000)
D. Peleg: Local Majorities, Coalitions and Monopolies in Graphs: A Review.Theoretical Computer Science, to appear
D. Peleg: Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review.Proc. 3rd Colloq. on Structural Information & Communication Complexity (SIROCCO), 1996, 152–169 (see also Technical Report CS96-12, the Weizmann Institute of Science, 1996)
D. Peleg: Graph Immunity Against Local Influence. Technical Report CS96-11, The Weizmann Institute of Science, 1996
S. Poljak, M. Sura: On periodical behaviour in societies with symmetric influences. Combinatorica 3:119–121, 1983
S. Poljak, D. Turzik: On an application of convexity to discrete systems. Discrete Applied Mathematics 13:27–32, 1986
P. Ružička: On the Efficiency of Interval RoutingAlg orithms. Proc. MFCS’88 LNCS 324, 492–500, 1988 (see also The Computer Journal 34:475-486, 1991)
N. Santoro, R. Khatib: Labellingand implicit routingin networks.The Computer Journal 28:5–8, 1985
J. van Leeuwen, R. B. Tan: Interval Routing.The Computer Journal 30:298–307, 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Královič, R. (2001). On Majority Voting Games in Trees. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_25
Download citation
DOI: https://doi.org/10.1007/3-540-45627-9_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42912-8
Online ISBN: 978-3-540-45627-8
eBook Packages: Springer Book Archive