arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.08535physics.soc-ph
收藏

具有选择性加固的随机网络对抗攻击的鲁棒性

Robustness of Random Networks with Selective Reinforcement against Attacks

Tomoyo Kawasumi, Takehisa Hasegawa

AI总结:

本文研究了通过添加隐藏边加固随机网络对抗针对性攻击的鲁棒性,提出均匀与选择性两种加固方式,利用生成函数推导巨分量大小与临界阈值,结合Monte Carlo模拟证明选择性加固显著提升了scale-free网络抗攻击能力。

摘要:

我们研究了通过添加隐藏边来加固的随机网络对抗针对性攻击的鲁棒性。本研究关注两种加固方式:均匀加固(将边随机添加到所有节点)和选择性加固(仅将边随机添加到给定网络中度最小的节点)。我们使用生成函数推导了加固网络在遭受针对性攻击时的巨分量大小和临界阈值。将我们的分析和Monte Carlo模拟应用于对scale-free网络的针对性攻击,结果表明选择性加固显著提升了网络对抗针对性攻击的鲁棒性。

英文摘要:

We investigate the robustness of random networks reinforced by adding hidden edges against targeted attacks. This study focuses on two types of reinforcement: uniform reinforcement, where edges are randomly added to all nodes, and selective reinforcement, where edges are randomly added only to the minimum degree nodes of the given network. We use generating functions to derive the giant component size and the critical threshold for the targeted attacks on reinforced networks. Applying our analysis and Monte Carlo simulations to the targeted attacks on scale-free networks, it becomes clear that selective reinforcement significantly improves the robustness of networks against the targeted attacks.

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

↑