Size bounds for dynamic monopolies
From MaRDI portal
Publication:1270828
DOI10.1016/S0166-218X(98)00043-2zbMath0910.90286MaRDI QIDQ1270828
Publication date: 3 November 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Games involving graphs (91A43) Voting theory (91B12) Microeconomic theory (price theory and economic markets) (91B24)
Related Items
The size of graphs with given feedback vertex number, Feedback vertex set in hypercubes, Feedback vertex sets in mesh-based networks, Almost exact minimum feedback vertex set in meshes and butterflies, Dynamic monopolies in two-way bootstrap percolation, Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree, The power of small coalitions under two-tier majority on regular graphs, On non-progressive spread of influence through social networks, MIP formulations for induced graph optimization problems: a tutorial, Maximum weighted induced forests and trees: new formulations and a computational comparative review, On dynamic monopolies of graphs with general thresholds, New bounds on the decycling number of generalized de Bruijn digraphs, Combinatorial model and bounds for target set selection, Solving target set selection with bounded thresholds faster than \(2^n\), Dynamic monopolies and feedback vertex sets in hexagonal grids, Triggering cascades on undirected connected graphs, Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids, On reversible cascades in scale-free and Erdős-Rényi random graphs, Spreading of messages in random graphs, Multi-level dynamo and opinion spreading, The decycling number of outerplanar graphs, On dynamic monopolies of graphs: the average and strict majority thresholds, Treewidth governs the complexity of target set selection, The predecessor-existence problem for \(k\)-reversible processes, On the decycling number of generalized Kautz digraphs, Majority rule cellular automata, Phase transition of the 2-choices dynamics on core-periphery networks, Solving Target Set Selection with Bounded Thresholds Faster than 2^n, Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees, Reversible iterative graph processes, The complexity of flood filling games, A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem, Irreversible conversion of graphs, Near-optimal solutions for the generalized max-controlled set problem, Computer science and decision theory, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$, Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis, Feedback arc number and feedback vertex number of Cartesian product of directed cycles, On the spread of influence in graphs, Opinion forming in Erdős-Rényi random graph and expanders, Size bounds for dynamic monopolies, Opinion Forming in Erdös-Rényi Random Graph and Expanders, Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Spreading messages, On time versus size for monotone dynamic monopolies in regular topologies, On the complexity of reasoning about opinion diffusion under majority dynamics, Dynamic monopolies of constant size, Majority dynamics and the retention of information, Local interaction on random graphs, Local majorities, coalitions and monopolies in graphs: A review, On reconfigurability of target sets
Cites Work
- On an application of convexity to discrete systems
- Periodic behaviour of generalized threshold functions
- Size bounds for dynamic monopolies
- The \(r\)-majority vote action on 0-1 sequences
- Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences
- The power of small coalitions in graphs
- On periodical behaviour in societies with symmetric influences
