非渐进阈值模型中的最小目标集:当时机至关重要
Minimum Target Sets in Non-Progressive Threshold Models: When Timing Matters
AI总结:
本文研究非渐进阈值模型中的定时目标集选择问题,证明其时序优势、多数规则下的紧界与 NP 难性,并提出 ILP、贪心算法及树上的线性时间精确算法。
摘要:
令 $G$ 为表示社交网络的图,并假设每个节点 $v$ 都有一个阈值 $τ(v)$。考虑一种初始配置,其中每个节点要么为正,要么为负。在每个离散时间步中,当节点 $v$ 的邻居中至少有 $τ(v)$ 个为正时,该节点变为/保持为正,否则为负。若节点集 $\mathcal{S}$ 满足以下条件,则称其为目标集(Target Set,TS):如果 $\mathcal{S}$ 中的所有节点初始均为正,则图中所有节点最终都会变为正。我们关注 TS 的一种推广,称为定时目标集(Timed TS,TTS),其中允许在过程的任意一步将正状态分配给某个节点,而不仅仅是在开始时。我们给出了一些图结构,在这些结构上最小 TTS 显著小于最小 TS,表明时机是成功目标选择策略的一个关键方面。此外,当阈值依据多数规则分配时,我们以节点数和最大度为参数,证明了 TTS 最小规模的紧界。我们证明了确定 TTS 最小规模的问题是 NP 难的,并给出了一个整数线性规划公式和一种贪心算法。我们通过在多种合成网络和真实网络上进行实验,评估了算法的性能。我们还给出了一种适用于树的线性时间精确算法。
英文摘要:
Let $G$ be a graph, which represents a social network, and suppose each node $v$ has a threshold value $τ(v)$. Consider an initial configuration, where each node is either positive or negative. In each discrete time step, a node $v$ becomes/remains positive if at least $τ(v)$ of its neighbors are positive and negative otherwise. A node set $\mathcal{S}$ is a Target Set (TS) whenever the following holds: if $\mathcal{S}$ is fully positive initially, all nodes in the graph become positive eventually. We focus on a generalization of TS, called Timed TS (TTS), where it is permitted to assign a positive state to a node at any step of the process, rather than just at the beginning. We provide graph structures for which the minimum TTS is significantly smaller than the minimum TS, indicating that timing is an essential aspect of successful target selection strategies. Furthermore, we prove tight bounds on the minimum size of a TTS in terms of the number of nodes and maximum degree when the thresholds are assigned based on the majority rule. We show that the problem of determining the minimum size of a TTS is NP-hard and provide an Integer Linear Programming formulation and a greedy algorithm. We evaluate the performance of our algorithm by conducting experiments on various synthetic and real-world networks. We also present a linear-time exact algorithm for trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。