Abstract
Consider the following reversible cascade on the Erdős-Rényi random graph G(n,p). In round zero, a set of vertices, called the seeds, are active. For a given ρ ∈ ( 0,1 ], a non-isolated vertex is activated (resp., deactivated) in round t ∈ ℤ + if the fraction f of its neighboring vertices that were active in round t − 1 satisfies f ≥ ρ (resp., f < ρ). An irreversible cascade is defined similarly except that active vertices cannot be deactivated. A set of vertices, S, is said to be stable if no vertex will ever change its state, from active to inactive or vice versa, once the set of active vertices equals S. For both the reversible and the irreversible cascades, we show that for any constant ε > 0, all p ∈ [ (1 + ε) (ln (e/ρ))/n,1 ] and with probability 1 − n − Ω(1), every stable set of G(n,p) has size O(⌈ρn⌉) or n − O(⌈ρn⌉).
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
Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theoretical Computer Science (forthcoming 2010), doi:10.1016/j.tcs.2010.08.021
Agur, Z.: Resilience and variability in pathogens and hosts. IMA Journal on Mathematical Medicine and Biology 4(4), 295–307 (1987)
Agur, Z.: Fixed points of majority rule cellular automata with application to plasticity and precision of the immune system. Complex Systems 5(3), 351–357 (1991)
Agur, Z., Fraenkel, A.S., Klein, S.T.: The number of fixed points of the majority rule. Discrete Mathematics 70(3), 295–302 (1988)
Balogh, J., Bollobás, B., Morris, R.: Bootstrap percolation in high dimensions. Combinatorics, Probability and Computing 19(5-6), 643–692 (2010)
Berger, E.: Dynamic monopolies of constant size. Journal of Combinatorial Theory Series B 83(2), 191–200 (2001)
Blume, L.E.: The statistical mechanics of strategic interaction. Games and Economic Behavior 5(3), 387–424 (1993)
Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press (2001)
Chang, C.-L., Lyuu, Y.-D.: Spreading messages. Theoretical Computer Science 410(27-29), 2714–2724 (2009)
Chang, C.-L., Lyuu, Y.-D.: Bounding the Number of Tolerable Faults in Majority-Based Systems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 109–119. Springer, Heidelberg (2010)
Chang, C.-L., Lyuu, Y.-D.: Spreading of messages in random graphs. Theory of Computing Systems 48(2), 389–401 (2011)
Chen, N.: On the approximability of influence in social networks. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1029–1037 (2008)
Dreyer, P.A., Roberts, F.S.: Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discrete Applied Mathematics 157(7), 1615–1627 (2009)
Ellison, G.: Learning, local interaction, and coordination. Econometrica 61(5), 1047–1071 (1993)
Flocchini, P.: Contamination and decontamination in majority-based systems. Journal of Cellular Automata 4(3), 183–200 (2009)
Flocchini, P., Geurts, F., Santoro, N.: Optimal irreversible dynamos in chordal rings. Discrete Applied Mathematics 113(1), 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. Journal of Discrete Algorithms 1(2), 129–150 (2003)
Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic monopolies in tori. Discrete Applied Mathematics 137(2), 197–212 (2004)
Ginosar, Y., Holzman, R.: The majority action on infinite graphs: Strings and puppets. Discrete Mathematics 215(1-3), 59–71 (2000)
Goles, E., Olivos, J.: Periodic behavior of generalized threshold functions. Discrete Mathematics 30(2), 187–189 (1980)
Goles-Chacc, E., Fogelman-Soulie, F., Pellegrin, D.: Decreasing energy functions as a tool for studying threshold networks. Discrete Applied Mathematics 12(3), 261–277 (1985)
Granville, A.: On a paper by Agur, Fraenkel and Klein. Discrete Mathematics 94(2), 147–151 (1991)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)
Kynčl, J., Lidický, B., Vyskočil, T.: Irreversible 2-conversion set is NP-complete. Technical Report KAM-DIMATIA Series 2009-933, Department of Applied Mathematics, Charles University, Prague, Czech Republic (2009)
Luccio, F.: Almost exact minimum feedback vertex set in meshes and butterflies. Information Processing Letters 66(2), 59–64 (1998)
Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity, pp. 204–218 (1999)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)
Montanari, A., Saberi, A.: Convergence to equilibrium in local interaction games. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 303–312 (2009)
Moran, G.: Parametrization for stationary patterns of the r-majority operators on 0-1 sequences. Discrete Mathematics 132(1-3), 175–195 (1994)
Moran, G.: The r-majority vote action on 0-1 sequences. Discrete Mathematics 132(1-3), 145–174 (1994)
Moran, G.: On the period-two property of the majority operator in infinite graphs. Transactions of the American Mathematical Society 347(5), 1649–1667 (1995)
Morris, S.: Contagion. Review of Economic Studies 67(1), 57–78 (2000)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
Mustafa, N.H., Pekec, A.: Majority Consensus and the Local Majority Rule. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 530–542. Springer, Heidelberg (2001)
Peleg, D.: Size bounds for dynamic monopolies. Discrete Applied Mathematics 86(2-3), 263–273 (1998)
Peleg, D.: Local majorities, coalitions and monopolies in graphs: A review. Theoretical Computer Science 282(2), 231–257 (2002)
Pike, D.A., Zou, Y.: Decycling Cartesian products of two cycles. SIAM Journal on Discrete Mathematics 19(3), 651–663 (2005)
Poljak, S., Sura, M.: On periodical behavior in societies with symmetric influences. Combinatorica 3(1), 119–121 (1983)
Poljak, S., Turzik, D.: On an application of convexity to discrete systems. Discrete Applied Mathematics 13(1), 27–32 (1986)
Reddy, T.V.T., Krishna, D.S., Rangan, C.P.: Variants of spreading messages. In: Proceedings of the 4th Workshop on Algorithms and Computation, pp. 240–251 (2010)
Stauffer, D., Aharony, A.: Introduction to Percolation Theory, 2nd edn. Taylor & Francis (1994)
West, D.B.: Introduction to Graph Theory, 3rd edn. Prentice-Hall, Upper Saddle River (2007)
Young, H.P.: The diffusion of innovations in social networks. In: Blume, L.E., Durlauf, S.N. (eds.) Economy as an Evolving Complex System. Proceedings Volume in the Santa Fe Institute Studies in the Sciences of Complexity, vol. 3, pp. 267–282. Oxford University Press, New York (2006)
Zollman, K.J.S.: Social structure and the effects of conformity. Humanities, Social Sciences and Law 172(3), 317–340 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, CL., Lyuu, YD. (2011). Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25011-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-25011-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25010-1
Online ISBN: 978-3-642-25011-8
eBook Packages: Computer ScienceComputer Science (R0)