基于综合度量驱动进化算法的超网络分解

IF 2.8 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY
Meng Ma , Sanyang Liu , Yiguang Bai
{"title":"基于综合度量驱动进化算法的超网络分解","authors":"Meng Ma ,&nbsp;Sanyang Liu ,&nbsp;Yiguang Bai","doi":"10.1016/j.physa.2025.130505","DOIUrl":null,"url":null,"abstract":"<div><div>Network disintegration, which aims to degrade network functionality through the optimal set of node or edge removals, has been widely applied in various domains such as epidemic control and rumor containment. Hypernetworks are crucial and ubiquitous in capturing complex real-world higher-order interactions. However, existing network disintegration methods primarily focus on traditional pairwise networks, facing two significant challenges when dealing with hypernetworks: ineffective disruption of higher-order structures and limited capability in capturing higher-order features. To address these issues, we propose the Pre-Elite Multi-Objective Evolutionary Algorithm (PEEA), which identifies critical hyperedge set by optimizing two objectives: overall structure and higher-order disintegration. PEEA introduces weighted line graph to capture inter-hyperedge topological relationships and designs multi-scale importance metrics. It incorporates prior network information for elite individual initialization and optimizes target hyperedge set through multi-dimensional updates and selection operations. Simulation results show that PEEA improves the two objectives by 45.852% and 73.476%, demonstrating its effectiveness in hypernetwork disintegration. Further analysis of iterations (<span><math><mi>T</mi></math></span>) and crossover rate (<span><math><mi>β</mi></math></span>) indicates that PEEA achieves its most significant improvement in the first iteration, balancing fast convergence with accuracy.</div></div>","PeriodicalId":20152,"journal":{"name":"Physica A: Statistical Mechanics and its Applications","volume":"666 ","pages":"Article 130505"},"PeriodicalIF":2.8000,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hypernetwork disintegration with integrated metrics-driven evolutionary algorithm\",\"authors\":\"Meng Ma ,&nbsp;Sanyang Liu ,&nbsp;Yiguang Bai\",\"doi\":\"10.1016/j.physa.2025.130505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Network disintegration, which aims to degrade network functionality through the optimal set of node or edge removals, has been widely applied in various domains such as epidemic control and rumor containment. Hypernetworks are crucial and ubiquitous in capturing complex real-world higher-order interactions. However, existing network disintegration methods primarily focus on traditional pairwise networks, facing two significant challenges when dealing with hypernetworks: ineffective disruption of higher-order structures and limited capability in capturing higher-order features. To address these issues, we propose the Pre-Elite Multi-Objective Evolutionary Algorithm (PEEA), which identifies critical hyperedge set by optimizing two objectives: overall structure and higher-order disintegration. PEEA introduces weighted line graph to capture inter-hyperedge topological relationships and designs multi-scale importance metrics. It incorporates prior network information for elite individual initialization and optimizes target hyperedge set through multi-dimensional updates and selection operations. Simulation results show that PEEA improves the two objectives by 45.852% and 73.476%, demonstrating its effectiveness in hypernetwork disintegration. Further analysis of iterations (<span><math><mi>T</mi></math></span>) and crossover rate (<span><math><mi>β</mi></math></span>) indicates that PEEA achieves its most significant improvement in the first iteration, balancing fast convergence with accuracy.</div></div>\",\"PeriodicalId\":20152,\"journal\":{\"name\":\"Physica A: Statistical Mechanics and its Applications\",\"volume\":\"666 \",\"pages\":\"Article 130505\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2025-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Physica A: Statistical Mechanics and its Applications\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0378437125001578\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physica A: Statistical Mechanics and its Applications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378437125001578","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

网络解体是一种通过去除最优节点或边缘来降低网络功能的方法,已广泛应用于疫情控制和谣言遏制等各个领域。在捕捉复杂的现实世界的高阶交互时,超网络是至关重要且无处不在的。然而,现有的网络分解方法主要集中在传统的两两网络上,在处理超网络时面临两个重大挑战:对高阶结构的无效破坏和对高阶特征的捕获能力有限。为了解决这些问题,我们提出了Pre-Elite多目标进化算法(PEEA),该算法通过优化总体结构和高阶分解两个目标来识别临界超边缘集。PEEA引入加权线形图来捕捉超边缘间的拓扑关系,并设计了多尺度重要性度量。它结合了精英个体初始化的先验网络信息,并通过多维更新和选择操作优化目标超边缘集。仿真结果表明,PEEA算法分别提高了45.852%和73.476%,证明了其在超网络分解中的有效性。对迭代次数(T)和交叉率(β)的进一步分析表明,PEEA在第一次迭代中实现了最显著的改进,在快速收敛和准确性之间取得了平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hypernetwork disintegration with integrated metrics-driven evolutionary algorithm
Network disintegration, which aims to degrade network functionality through the optimal set of node or edge removals, has been widely applied in various domains such as epidemic control and rumor containment. Hypernetworks are crucial and ubiquitous in capturing complex real-world higher-order interactions. However, existing network disintegration methods primarily focus on traditional pairwise networks, facing two significant challenges when dealing with hypernetworks: ineffective disruption of higher-order structures and limited capability in capturing higher-order features. To address these issues, we propose the Pre-Elite Multi-Objective Evolutionary Algorithm (PEEA), which identifies critical hyperedge set by optimizing two objectives: overall structure and higher-order disintegration. PEEA introduces weighted line graph to capture inter-hyperedge topological relationships and designs multi-scale importance metrics. It incorporates prior network information for elite individual initialization and optimizes target hyperedge set through multi-dimensional updates and selection operations. Simulation results show that PEEA improves the two objectives by 45.852% and 73.476%, demonstrating its effectiveness in hypernetwork disintegration. Further analysis of iterations (T) and crossover rate (β) indicates that PEEA achieves its most significant improvement in the first iteration, balancing fast convergence with accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.20
自引率
9.10%
发文量
852
审稿时长
6.6 months
期刊介绍: Physica A: Statistical Mechanics and its Applications Recognized by the European Physical Society Physica A publishes research in the field of statistical mechanics and its applications. Statistical mechanics sets out to explain the behaviour of macroscopic systems by studying the statistical properties of their microscopic constituents. Applications of the techniques of statistical mechanics are widespread, and include: applications to physical systems such as solids, liquids and gases; applications to chemical and biological systems (colloids, interfaces, complex fluids, polymers and biopolymers, cell physics); and other interdisciplinary applications to for instance biological, economical and sociological systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信