Abstract
Consider the following coloring process in a simple directed graph G(V,E) with positive indegrees. Initially, a set S of vertices are white. Thereafter, a black vertex is colored white whenever the majority of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irreversible dynamic monopoly (or dynamo for short). We derive upper bounds of 0.7732|V| and 0.727|V| on the minimum sizes of irreversible dynamos depending on whether the majority is strict or simple. When G is an undirected connected graph without isolated vertices, upper bounds of ⌈|V|/2 ⌉ and \(\lfloor |V|/2 \rfloor\) are given on the minimum sizes of irreversible dynamos depending on whether the majority is strict or simple. Let ε> 0 be any constant. We also show that, unless \(\text{NP}\subseteq \text{TIME}(n^{O(\ln \ln n)}),\) no polynomial-time, ((1/2 − ε)ln |V|)-approximation algorithms exist for finding a minimum irreversible dynamo.
The authors are supported in part by the National Science Council of Taiwan under grant 97-2221-E-002-096-MY3 and Excellent Research Projects of National Taiwan University under grant 98R0062-05.
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
Chang, C.-L., Lyuu, Y.-D.: Spreading Messages. Theor. Comp. Sci. 410, 2714–2724 (2009)
Feige, U.: A Threshold of ln n for Approximating Set Cover. J. ACM 45, 634–652 (1998)
Flocchini, P., Geurts, F., Santoro, N.: Optimal Irreversible Dynamos in Chordal Rings. Disc. Appl. Math. 113, 23–42 (2001)
Flocchini, P., Královič, R., Ružička, P., Roncato, A., Santoro, N.: On Time Versus Size for Monotone Dynamic Monopolies in Regular Topologies. J. Disc. Alg. 1, 129–150 (2003)
Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic Monopolies in Tori. Disc. Appl. Math. 137, 197–212 (2004)
Gleeson, J.P., Cahalane, D.J.: Seed Size Strongly Affects Cascades on Random Networks. Phys. Rev. E 75, 056103 (2007)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the Spread of Influence Through a Social Network. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, Washington (2003)
Kempe, D., Kleinberg, J., Tardos, É.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Luccio, E., Pagli, F., Sanossian, H.: Irreversible Dynamos in Butterflies. In: 6th International Colloquium on Structural Information & Communication Complexity, pp. 204–218. Carleton Scientific, Lacanau-Ocean (1999)
Mossel, E., Roch, S.: On the Submodularity of Influence in Social Networks. In: 39th Annual ACM Symposium on Theory of Computing, pp. 128–134. ACM, San Diego (2007)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Peleg, D.: Local Majorities, Coalitions and Monopolies in Graphs: A Review. Theor. Comp. Sci. 282, 231–257 (2002)
Pike, D.A., Zou, Y.: Decycling Cartesian Products of Two Cycles. SIAM J. Disc. Math. 19, 651–663 (2005)
Samuelsson, B., Socolar, J.: Exhaustive Percolation on Random Networks. Phys. Rev. E. 74, 036113 (2006)
Watts, D.J.: A Simple Model of Global Cascades on Random Networks. Proc. Nat. Acad. Sci. 99, 5766–5771 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, CL., Lyuu, YD. (2010). Bounding the Number of Tolerable Faults in Majority-Based Systems . In: Calamoneri, T., Diaz, J. (eds) Algorithms and Complexity. CIAC 2010. Lecture Notes in Computer Science, vol 6078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13073-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-13073-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13072-4
Online ISBN: 978-3-642-13073-1
eBook Packages: Computer ScienceComputer Science (R0)