Optimal irreversible dynamos in chordal rings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Theoretical Computer Science
Spreading of messages in random graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Bounding the number of tolerable faults in majority-based systems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Minimum weight dynamo and fast opinion spreading
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
| Hi-index | 5.23 |
Properties of systems with majority voting rules have been extensively studied. In this work we focus on the randomized case, where the system is initialized by random initial set of seeds. Our main aim is to find an asymptotic estimate for sampling probability, so that the initial set of seeds is (not) almost surely a dynamic monopoly. After presenting some trivial examples, we present extensive results for toroidal mesh and random 4-regular graph under simple majority scenario.