{"paper":{"title":"On dynamic monopolies of graphs: the average and strict majority thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hossein Soltani, Kaveh Khoshkhah, Manouchehr Zaker","submitted_at":"2012-02-06T14:17:57Z","abstract_excerpt":"Let $G$ be a graph and ${\\mathcal{\\tau}}: V(G)\\rightarrow \\Bbb{N}\\cup \\{0\\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \\tau)$ if the vertices of $G$ can be partitioned into subsets $D_0, D_1,..., D_k$ such that $D_0=D$ and for any $i\\in {0, ..., k-1}$, each vertex $v$ in $D_{i+1}$ has at least $\\tau(v)$ neighbors in $D_0\\cup ... \\cup D_i$. Dynamic monopolies are in fact modeling the irreversible spread of influence in social networks. In this paper we first obtain a lower bound for the smallest size of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1146","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}