Triggering cascades on strongly connected directed graphs
From MaRDI portal
Publication:500995
DOI10.1016/J.TCS.2015.05.043zbMATH Open1331.05093OpenAlexW624050075MaRDI QIDQ500995FDOQ500995
Authors: Ching-Lueh Chang, Yuh-Dauh Lyuu 
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.043
Recommendations
- Triggering cascades on undirected connected graphs
- Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
Cites Work
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- Bounding the number of tolerable faults in majority-based systems
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Title not available (Why is that?)
- Almost exact minimum feedback vertex set in meshes and butterflies
- An improved testing scheme for catastrophic fault patterns
- Cascading behavior in networks: algorithmic and economic issues
- Bootstrap percolation in high dimensions
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Contagion
- The power of small coalitions in graphs
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- New bounds for contagious sets
- Decycling Cartesian Products of Two Cycles
- Optimal irreversible dynamos in chordal rings
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- A simple model of global cascades on random networks
- On enumeration of catastrophic fault patterns
- Triggering cascades on undirected connected graphs
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Contamination and decontamination in majority-based systems
- Spreading of messages in random graphs
Cited In (8)
- Stable sets of threshold-based cascades on the Erdős-Rényi random graphs
- New bounds for contagious sets
- Triggering cascades on undirected connected graphs
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- Partial immunization of trees
- Vaccinate your trees!
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
- Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
This page was built for publication: Triggering cascades on strongly connected directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500995)
