Triggering cascades on undirected connected graphs
DOI10.1016/J.IPL.2011.07.008zbMATH Open1260.68292OpenAlexW2008428279MaRDI QIDQ1944178FDOQ1944178
Authors: Ching-Lueh Chang
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.008
Recommendations
fault tolerancefault propagationirreversible dynamic monopolyrepetitive polling gamelocal interaction gameirreversible conversion setreversible dynamic monopolyWatts model
Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- On periodical behaviour in societies with symmetric influences
- Bounding the number of tolerable faults in majority-based systems
- Combinatorial model and bounds for target set selection
- Automata, Languages and Programming
- The number of fixed points of the majority rule
- Title not available (Why is that?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- The statistical mechanics of strategic interaction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning, Local Interaction, and Coordination
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- Almost exact minimum feedback vertex set in meshes and butterflies
- Size bounds for dynamic monopolies
- Cascading behavior in networks: algorithmic and economic issues
- On the behavior of some cellular automata related to bootstrap percolation
- Convergence to equilibrium in local interaction games
- Decreasing energy functions as a tool for studying threshold networks
- Sharp metastability threshold for two-dimensional bootstrap percolation
- The threshold regime of finite volume bootstrap percolation.
- Bootstrap percolation in high dimensions
- Bootstrap percolation on the hypercube
- Bootstrap percolation in three dimensions
- Title not available (Why is that?)
- Contagion
- The power of small coalitions in graphs
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Majority Bootstrap Percolation on the Hypercube
- Random disease on the square grid
- Minimal percolating sets in bootstrap percolation
- Spreading messages
- Periodic behaviour of generalized threshold functions
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- Decycling Cartesian Products of Two Cycles
- Optimal irreversible dynamos in chordal rings
- Bootstrap percolation on the random regular graph
- Title not available (Why is that?)
- A simple model of global cascades on random networks
- Metastable behavior for bootstrap percolation on regular trees
- Title not available (Why is that?)
- The majority action on infinite graphs: Strings and puppets
- Contamination and decontamination in majority-based systems
- On the Period-Two-Property of the Majority Operator in Infinite Graphs
- Spreading of messages in random graphs
- Title not available (Why is that?)
- On an application of convexity to discrete systems
- On a paper of Agur, Fraenkel and Klein
- The \(r\)-majority vote action on 0-1 sequences
- Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences
- Web Marshals Fighting Curly Link Farms
- Variants of spreading messages
Cited In (5)
- Stable sets of threshold-based cascades on the Erdős-Rényi random graphs
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- On the spread of influence in graphs
- Triggering cascades on strongly connected directed graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
This page was built for publication: Triggering cascades on undirected connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944178)