On reversible cascades in scale-free and Erdős-Rényi random graphs
From MaRDI portal
Publication:1946489
DOI10.1007/s00224-012-9387-2zbMath1262.05105arXiv1011.0653MaRDI QIDQ1946489
Ching-Lueh Chang, Chao-Hong Wang
Publication date: 15 April 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.0653
fault propagation; global cascade; repetitive polling game; local interaction game; static monopoly; reversible dynamic monopoly
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial model and bounds for target set selection
- Spreading of messages in random graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Spreading messages
- Almost exact minimum feedback vertex set in meshes and butterflies
- Size bounds for dynamic monopolies
- The statistical mechanics of strategic interaction
- Dynamic monopolies in tori.
- Local majorities, coalitions and monopolies in graphs: A review
- The power of small coalitions in graphs
- On time versus size for monotone dynamic monopolies in regular topologies
- Dynamic monopolies of constant size
- The diameter of a scale-free random graph
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- E 11 and M theory
- Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
- Learning, Local Interaction, and Coordination
- Bounding the Number of Tolerable Faults in Majority-Based Systems
- A simple model of global cascades on random networks
- The Average Distance in a Random Graph with Given Expected Degrees
- Random disease on the square grid
- Contagion
- Convergence to Equilibrium in Local Interaction Games
- Decycling Cartesian Products of Two Cycles
- Optimal irreversible dynamos in chordal rings
