ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS

DOI10.1017/S0004972714000604zbMath1303.05146MaRDI QIDQ2933686

Hossein Soltani, Manouchehr Zaker

Publication date: 5 December 2014

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

zbMATH Keywords

irreversible dynamic monopoliesprobabilistic threshold assignmentspread of influence in graphs

Mathematics Subject Classification ID

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

Related Items (2)

Integer programming approach to static monopolies in graphs ⋮ A polyhedral study of dynamic monopolies

Cites Work

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

This page was built for publication: ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS