On dynamic monopolies of graphs with probabilistic thresholds
From MaRDI portal
Publication:2933686
DOI10.1017/S0004972714000604zbMATH Open1303.05146MaRDI QIDQ2933686FDOQ2933686
Authors: Hossein Soltani, Manouchehr Zaker 
Publication date: 5 December 2014
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Recommendations
- On dynamic monopolies of graphs with general thresholds
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- Weak dynamic monopolies in social graphs
Social networks; opinion dynamics (91D30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Probabilistic methods for algorithmic discrete mathematics
- On time versus size for monotone dynamic monopolies in regular topologies
- Some results on the target set selection problem
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- On the approximability of influence in social networks
- 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
- Irreversible conversion of graphs
- Bootstrap percolation on the hypercube
- Spreading messages
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- Dynamic monopolies with randomized starting configuration
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Cited In (15)
- On dynamic monopolies of graphs with general thresholds
- On dynamic monopolies of graphs: the average and strict majority thresholds
- On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds.
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Remarks on dynamic monopolies with given average thresholds
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- On the spread of influence in graphs
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- Weak dynamic monopolies in social graphs
- A polyhedral study of dynamic monopolies
- A study of monopolies in graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
- Integer programming approach to static monopolies in graphs
- Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
This page was built for publication: On dynamic monopolies of graphs with probabilistic thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933686)
