Triggering cascades on undirected connected graphs
Highlights
► We consider threshold-based cascades on connected graphs. ► A degree-d vertex is activated when it has at least ρd active neighbors. ► We find bounds on the minimum number of seeds activating all vertices eventually. ► We use techniques of Ackerman et al. [Theoret. Comput. Sci. 411 (44–46) (2010) 4017–4022].
References (76)
- et al.
Combinatorial model and bounds for target set selection
Theoretical Computer Science
(2010) - et al.
The number of fixed points of the majority rule
Discrete Mathematics
(1988) Dynamic monopolies of constant size
Journal of Combinatorial Theory Series B
(2001)- et al.
The power of small coalitions in graphs
Discrete Applied Mathematics
(2003) The statistical mechanics of strategic interaction
Games and Economic Behavior
(1993)- et al.
Cascade dynamics of complex propagation
Physica A: Statistical Mechanics and its Applications
(2007) - et al.
The threshold regime of finite volume bootstrap percolation
Stochastic Processes and Their Applications
(2002) - et al.
Spreading messages
Theoretical Computer Science
(2009) - et al.
Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
Discrete Applied Mathematics
(2009) - et al.
Optimal irreversible dynamos in chordal rings
Discrete Applied Mathematics
(2001)
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms
(2003)
Dynamic monopolies in tori
Discrete Applied Mathematics
(2004)
The majority action on infinite graphs: Strings and puppets
Discrete Mathematics
(2000)
Periodic behavior of generalized threshold functions
Discrete Mathematics
(1980)
Decreasing energy functions as a tool for studying threshold networks
Discrete Applied Mathematics
(1985)
On a paper by Agur, Fraenkel and Klein
Discrete Mathematics
(1991)
Almost exact minimum feedback vertex set in meshes and butterflies
Information Processing Letters
(1998)
Parametrization for stationary patterns of the r-majority operators on 0–1 sequences
Discrete Mathematics
(1994)
The r-majority vote action on 0–1 sequences
Discrete Mathematics
(1994)
Size bounds for dynamic monopolies
Discrete Applied Mathematics
(1998)
Local majorities, coalitions and monopolies in graphs: A review
Theoretical Computer Science
(2002)
On an application of convexity to discrete systems
Discrete Applied Mathematics
(1986)
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
Resilience and variability in pathogens and hosts
IMA Journal on Mathematical Medicine and Biology
(1987)
Fixed points of majority rule cellular automata with application to plasticity and precision of the immune system
Complex Systems
(1991)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
(2004)
Bootstrap percolation on the hypercube
Probability Theory and Related Fields
(2006)
Bootstrap percolation in three dimensions
The Annals of Probability
(2009)
Majority bootstrap percolation on the hypercube
Combinatorics, Probability and Computing
(2009)
Bootstrap percolation in high dimensions
Combinatorics, Probability and Computing
(2010)
Bootstrap percolation on infinite trees and non-amenable groups
Combinatorics, Probability and Computing
(2006)
Random disease on the square grid
Random Structures & Algorithms
(1998)
Bootstrap percolation on the random regular graph
Random Structures & Algorithms
(2007)
Metastable behavior for bootstrap percolation on regular trees
Journal of Statistical Physics
(2009)
Dynamic monopolies in colored tori
Multicolored dynamos on toroidal meshes
On reversible cascades in scale-free and Erdős–Rényi random graphs
Cited by (9)
On the spread of influence in graphs
2021, Information and ComputationWhom to befriend to influence people
2020, Theoretical Computer ScienceDynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
2017, Theoretical Computer ScienceCitation Excerpt :We contribute to this question by showing the following results. For many more references to and discussion of related work see [12,13]. We proceed to the second proof.
Triggering cascades on strongly connected directed graphs
2015, Theoretical Computer ScienceSpread of Influence in Graphs
2020, arXivContagious sets in a degree-proportional bootstrap percolation process
2018, Random Structures and Algorithms
- 1
Supported in part by the National Science Council of Taiwan under grant 99-2218-E-155-014-MY2.
Copyright © 2011 Elsevier B.V. All rights reserved.