On dynamic monopolies of graphs with probabilistic thresholds

DOI10.1017/S0004972714000604MaRDI QIDQ2933686zbMATH OpenFDO

Authors Hossein Soltani, Manouchehr Zaker

Publication date 5 December 2014

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972714000604

zbMATH Keywords

irreversible dynamic monopoliesprobabilistic threshold assignmentspread of influence in graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Social networks; opinion dynamics (91D30)

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

Cites work

• Bootstrap percolation on the hypercube
• Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
• Combinatorial model and bounds for target set selection
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• Dynamic monopolies with randomized starting configuration
• Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Irreversible conversion of graphs
• Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
• On dynamic monopolies of graphs with general thresholds
• On dynamic monopolies of graphs: the average and strict majority thresholds
• On the approximability of influence in social networks
• On time versus size for monotone dynamic monopolies in regular topologies
• Probabilistic methods for algorithmic discrete mathematics
• Some results on the target set selection problem
• Spreading messages

Cited in

(15)

• Integer programming approach to static monopolies in graphs
• Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
• On the spread of influence in graphs
• Remarks on dynamic monopolies with given average thresholds
• A polyhedral study of dynamic monopolies
• Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
• Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• A study of monopolies in graphs
• 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 for degree proportional thresholds in connected graphs of girth at least five and trees
• On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
• Weak dynamic monopolies in social graphs

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)