Dynamic monopolies of constant size
| dc.creator | Berger, Eli | |
| dc.date | 1999-11-17 | |
| dc.date | 1999-12-24 | |
| dc.date.accessioned | 2026-07-07T05:31:39Z | |
| dc.date.available | 2026-07-07T05:31:39Z | |
| dc.description | The paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. We say that a set of vertices is a dynamic monopoly if starting the game with the vertices of the set colored white, the entire system is white after a finite number of rounds. Peleg asked how small a dynamic monopoly may be as a function of the number of vertices. We show that the answer is O(1). | |
| dc.description | Submitted to Journal of Combinatorial Th. Ser. B. Shared 1st prize at The Technion Excelence Program Conference 1999. 10 pages. three figures. v1 and v3 differ only by representation | |
| dc.identifier | https://arxiv.org/abs/math/9911125 | |
| dc.identifier | http://arxiv.org/abs/math/9911125 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79423 | |
| dc.subject | Combinatorics | |
| dc.title | Dynamic monopolies of constant size | |
| dc.type | text |