2026-07-25T22:04:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12497 2024-03-06T10:50:17Z ddc:004 open_access

A General Stabilization Bound for Influence Propagation in Graphs Papp, Pál András Wattenhofer, Roger Minority process Majority process We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a (1+λ)/2 fraction of its neighbors, for some 0 < λ < 1. Two examples of such processes are well-studied dynamically changing colorings in graphs: in majority processes, nodes switch to the most frequent color in their neighborhood, while in minority processes, nodes switch to the least frequent color in their neighborhood. We describe a non-elementary function f(λ), and we show that in the sequential model, the worst-case stabilization time of these processes can completely be characterized by f(λ). More precisely, we prove that for any ε > 0, O(n^(1+f(λ)+ε)) is an upper bound on the stabilization time of any proportional majority/minority process, and we also show that there are graph constructions where stabilization indeed takes Ω(n^(1+f(λ)-ε)) steps. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pál András Papp and Roger Wattenhofer 2020 Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2020.90 urn:nbn:de:0030-drops-124978 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.90 eng https://creativecommons.org/licenses/by/3.0/legalcode