• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

靶向攻击超图网络。

Targeting attack hypergraph networks.

机构信息

College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua 321004, China.

School of Public Health, Chongqing Medical University, Chongqing 400016, China.

出版信息

Chaos. 2022 Jul;32(7):073121. doi: 10.1063/5.0090626.

DOI:10.1063/5.0090626
PMID:35907733
Abstract

In modern systems, from brain neural networks to social group networks, pairwise interactions are not sufficient to express higher-order relationships. The smallest unit of their internal function is not composed of a single functional node but results from multiple functional nodes acting together. Therefore, researchers adopt the hypergraph to describe complex systems. The targeted attack on random hypergraph networks is still a problem worthy of study. This work puts forward a theoretical framework to analyze the robustness of random hypergraph networks under the background of a targeted attack on nodes with high or low hyperdegrees. We discovered the process of cascading failures and the giant connected cluster (GCC) of the hypergraph network under targeted attack by associating the simple mapping of the factor graph with the hypergraph and using percolation theory and generating function. On random hypergraph networks, we do Monte-Carlo simulations and find that the theoretical findings match the simulation results. Similarly, targeted attacks are more effective than random failures in disintegrating random hypergraph networks. The threshold of the hypergraph network grows as the probability of high hyperdegree nodes being deleted increases, indicating that the network's resilience becomes more fragile. When considering real-world scenarios, our conclusions are validated by real-world hypergraph networks. These findings will help us understand the impact of the hypergraph's underlying structure on network resilience.

摘要

在现代系统中,从脑神经网络到社会群体网络,成对的相互作用不足以表达高阶关系。其内部功能的最小单元不是由单个功能节点组成,而是由多个功能节点共同作用产生的。因此,研究人员采用超图来描述复杂系统。针对随机超图网络的有目标攻击仍然是一个值得研究的问题。这项工作提出了一个理论框架,在节点的高或低超度数的有目标攻击的背景下,分析随机超图网络的鲁棒性。我们通过将因子图的简单映射与超图联系起来,并利用渗流理论和生成函数,发现了超图网络在有目标攻击下的级联故障和巨大连通簇(GCC)的过程。在随机超图网络上,我们进行了蒙特卡罗模拟,并发现理论发现与模拟结果相符。同样,在破坏随机超图网络方面,有目标攻击比随机故障更为有效。随着删除高超度数节点的概率增加,超图网络的阈值增加,表明网络的弹性变得更加脆弱。在考虑真实场景时,我们通过真实的超图网络验证了我们的结论。这些发现将有助于我们理解超图的底层结构对网络弹性的影响。

相似文献

1
Targeting attack hypergraph networks.靶向攻击超图网络。
Chaos. 2022 Jul;32(7):073121. doi: 10.1063/5.0090626.
2
Robustness of directed higher-order networks.有向高阶网络的稳健性。
Chaos. 2023 Aug 1;33(8). doi: 10.1063/5.0159943.
3
Robustness of network of networks under targeted attack.遭受定向攻击时网络之网络的稳健性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 May;87(5):052804. doi: 10.1103/PhysRevE.87.052804. Epub 2013 May 16.
4
Theory of percolation on hypergraphs.超图上的渗流理论。
Phys Rev E. 2024 Jan;109(1-1):014306. doi: 10.1103/PhysRevE.109.014306.
5
Identifying Vital Nodes in Hypergraphs Based on Von Neumann Entropy.基于冯·诺依曼熵识别超图中的关键节点。
Entropy (Basel). 2023 Aug 25;25(9):1263. doi: 10.3390/e25091263.
6
Hypergraph-Induced Convolutional Networks for Visual Classification.超图诱导卷积网络的视觉分类。
IEEE Trans Neural Netw Learn Syst. 2019 Oct;30(10):2963-2972. doi: 10.1109/TNNLS.2018.2869747. Epub 2018 Oct 2.
7
Multi-view heterogeneous graph learning with compressed hypergraph neural networks.基于压缩超图神经网络的多视图异质图学习。
Neural Netw. 2024 Nov;179:106562. doi: 10.1016/j.neunet.2024.106562. Epub 2024 Jul 22.
8
Dynamics of the threshold model on hypergraphs.超图上阈模型的动力学。
Chaos. 2022 Feb;32(2):023125. doi: 10.1063/5.0075667.
9
Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.由n个相互依存网络形成的网络的稳健性,其中依存节点一一对应。
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Jun;85(6 Pt 2):066134. doi: 10.1103/PhysRevE.85.066134. Epub 2012 Jun 29.
10
Weighted projected networks: mapping hypergraphs to networks.加权投影网络:将超图映射到网络。
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 May;87(5):052813. doi: 10.1103/PhysRevE.87.052813. Epub 2013 May 30.

引用本文的文献

1
The recovery strategy of interdependent networks under targeted attacks.遭受定向攻击时相互依存网络的恢复策略
Heliyon. 2024 Sep 12;10(18):e37774. doi: 10.1016/j.heliyon.2024.e37774. eCollection 2024 Sep 30.
2
Fragility Induced by Interdependency of Complex Networks and Their Higher-Order Networks.复杂网络及其高阶网络的相互依存性所引发的脆弱性
Entropy (Basel). 2022 Dec 23;25(1):22. doi: 10.3390/e25010022.