On dynamic monopolies of graphs: the average and strict majority thresholds

DOI10.1016/j.disopt.2012.02.001zbMath1246.91115arXiv1202.1146OpenAlexW2962901628MaRDI QIDQ448965

Hossein Soltani, Manouchehr Zaker, Kaveh Khoshkhah

Publication date: 11 September 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1146

zbMATH Keywords

dynamic monopoliesirreversible spread of influence

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS ⋮ On dynamic monopolies of graphs with general thresholds ⋮ Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs ⋮ Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks ⋮ Triggering cascades on strongly connected directed 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 ⋮ Remarks on dynamic monopolies with given average thresholds ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ A polyhedral study of dynamic monopolies ⋮ Facets of the dynamic monopoly polytope: linear ordering formulation ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ On irreversible spread of influence in edge-weighted graphs ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A study of monopolies in graphs
• On dynamic monopolies of graphs with general thresholds
• Combinatorial model and bounds for target set selection
• Dynamic monopolies with randomized starting configuration
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Spreading messages
• Size bounds for dynamic monopolies
• Dynamic monopolies in tori.
• On time versus size for monotone dynamic monopolies in regular topologies
• Dynamic monopolies of constant size
• Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
• On the Approximability of Influence in Social Networks
• Optimal irreversible dynamos in chordal rings

This page was built for publication: On dynamic monopolies of graphs: the average and strict majority thresholds