Recommendations
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation in three dimensions
- Bootstrap percolation on the hypercube
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Bootstrap percolation on the random regular graph
- Cascading behavior in networks: algorithmic and economic issues
- Combinatorial model and bounds for target set selection
- Large induced degenerate subgraphs
- Lower bounds on the independence number in terms of the degrees
- Majority Bootstrap Percolation on the Hypercube
- On the approximability of influence in social networks
- On the size of identifying codes in binary hypercubes
- Random disease on the square grid
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The sharp threshold for bootstrap percolation in all dimensions
Cited in
(20)- Infinite and Giant Components in the Layers Percolation Model
- The acquaintance time of (percolated) random geometric graphs
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack
- Constant thresholds can make target set selection tractable
- Acquaintance time of random graphs near connectivity threshold
- Minimum degree conditions for small percolating sets in bootstrap percolation
- On some tractable and hard instances for partial incentives and target set selection
- Contagious sets in expanders
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
- Contagious sets in random graphs
- On giant components and treewidth in the layers model
- A note on the acquaintance time of random graphs
- Deterministic bootstrap percolation on trees
- On the spread of influence in graphs
- Hardness Results for Seeding Complex Contagion with Neighborhoods
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Triggering cascades on strongly connected directed graphs
- New ordering methods to construct contagious sets and induced degenerate subgraphs
- Minimal contagious sets in random regular graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
This page was built for publication: New bounds for contagious sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418891)
