arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.05589cs.SIphysics.soc-ph
收藏

目标扩散的图结构优化

Optimizing Graph Structure for Targeted Diffusion

Sixie Yu, Leonardo Torres, Scott Alfeld, Tina Eliassi-Rad, Yevgeniy Vorobeychik

摘要:

网络上的扩散控制问题已经得到了广泛的研究,其应用范围从市场营销到控制传染病。然而,在许多应用中,例如网络安全,攻击者可能想要攻击网络的目标子图,同时限制对网络其余部分的影响,以便保持未被检测到。我们提出了一个模型POTION,其中的主要目的是优化图结构,以实现这种有针对性的攻击。我们提出了一个算法POTION-ALG解决模型的规模,使用基于梯度的方法,利用瑞利矩和伪谱理论。此外,我们提出了一个条件,证明有针对性的子图是免疫这种攻击。最后,我们通过在真实网络和合成网络上的实验证明了我们方法的有效性。

英文摘要:

The problem of diffusion control on networks has been extensively studied, with applications ranging from marketing to controlling infectious disease. However, in many applications, such as cybersecurity, an attacker may want to attack a targeted subgraph of a network, while limiting the impact on the rest of the network in order to remain undetected. We present a model POTION in which the principal aim is to optimize graph structure to achieve such targeted attacks. We propose an algorithm POTION-ALG for solving the model at scale, using a gradient-based approach that leverages Rayleigh quotients and pseudospectrum theory. In addition, we present a condition for certifying that a targeted subgraph is immune to such attacks. Finally, we demonstrate the effectiveness of our approach through experiments on real and synthetic networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑