Pages that link to "Item:Q1850560"
From MaRDI portal
The following pages link to Dynamic monopolies of constant size (Q1850560):
Displaying 37 items.
- On non-progressive spread of influence through social networks (Q401306) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- The complexity of flood filling games (Q692938) (← links)
- Spreading messages (Q1029342) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Deprecation based greedy strategy for target set selection in large scale social networks (Q1749822) (← links)
- The effect of local majority on global majorityin connected graphs (Q1756113) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- A note on the majority dynamics in inhomogeneous random graphs (Q2038874) (← links)
- On the spread of influence in graphs (Q2051833) (← links)
- Diffusion in large networks (Q2152343) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Majority rule cellular automata (Q2232605) (← links)
- Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
- Majority dynamics and the retention of information (Q2339621) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Absorption time of the Moran process (Q2818278) (← links)
- Minority Becomes Majority in Social Networks (Q3460778) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results (Q5501616) (← links)
- (Q5743450) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Majority vote in social networks (Q6180001) (← links)